k-Circle formation by disoriented asynchronous robots
Authors:
- Bibhuti DasBDBibhuti Das
- Abhinav ChakrabortyACAbhinav Chakraborty
- Subhash BhagatSBSubhash Bhagat
- Krishnendu MukhopadhyayaKMKrishnendu Mukhopadhyaya
- 7 March 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 916, 40-61
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Distributed computing by mobile robots: uniform circle formationDistributed Computing, 2016
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreementJournal of Discrete Algorithms, 2016
- Distributed Computing by Mobile Robots: GatheringSIAM Journal on Computing, 2012
- Distributed algorithms for partitioning a swarm of autonomous mobile robotsTheoretical Computer Science, 2009
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robotsTheoretical Computer Science, 2008
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformityTheoretical Computer Science, 2008
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and MovementsSIAM Journal on Computing, 2008
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile RobotsSIAM Journal on Computing, 2006
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot SystemsSIAM Journal on Computing, 2005
- Distributed Anonymous Mobile Robots: Formation of Geometric PatternsSIAM Journal on Computing, 1999