Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Self-stabilization
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Proceedings of the second ACM international workshop on Principles of mobile computing
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Circle formation of weak robots and Lyndon words
Information Processing Letters
Circle formation of weak mobile robots
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Robots and demons: the code of the origins
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Biangular circle formation by asynchronous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Self-deployment algorithms for mobile sensors on a ring
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Theoretical Computer Science
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Robots and demons: the code of the origins
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Deterministic leader election in anonymous sensor networks without common coordinated system
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
| Hi-index | 0.00 |
In this paper, we first introduce the swing words. Based on intrinsic properties of these words, we present a new approach to solve the Circle Formation Problem in the semi-synchronous model (SSM)-- no two robots are supposed to be at the same position in the initial configuration. The proposed protocol is quiescent-- all the robots are eventually motionless in the desired configuration, which remains true thereafter. In SSM, the improvement of the latest recent work for this problem is twofold: (1) the protocol works for any number n of weak robots, except if n = 4, and (2) no robot is required to reach its computed destination in one step. Finally, starting from a biangular configuration, our protocol also solves CFP in the fully asynchronous model (CORDA). To our best knowledge, it is the first CFP protocol for SSM which is compatible with CORDA.