Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
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
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Gathering of Asynchronous Oblivious Robots with Limited Visibility
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Circle formation of weak robots and Lyndon words
Information Processing Letters
Theoretical Computer Science
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On the Inability of Gathering by Asynchronous Mobile Robots with Initial Movements
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Circle formation of weak mobile robots
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Robots and demons: the code of the origins
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Deterministic leader election in anonymous sensor networks without common coordinated system
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Multi-agent deployment on a ring graph
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Leader election problem versus pattern formation problem
DISC'10 Proceedings of the 24th international conference on Distributed computing
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Robot networks with homonyms: the case of patterns formation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Distributed coordination algorithms for mobile robot swarms: new directions and challenges
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Self-deployment algorithms for mobile sensors on a ring
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Circle formation by asynchronous fat robots with limited visibility
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Deterministic geoleader election in disoriented anonymous systems
Theoretical Computer Science
| Hi-index | 0.00 |
Consider a community of simple autonomous robots freely moving in the plane. The robots are decentralized, asynchronous, deterministic without the common coordination system, identities, direct communication, memory of the past, but with the ability to sense the positions of the other robots. We study the problem of forming an absolutely symmetric formation – regular circle. Unlike the existing algorithms for similar problems that have supposed a stronger model and guaranteed only convergence to a final formation, we are interested in solving the problem for fully asynchronous model. Unfortunately, the problem in general is very hard under these circumstances and seems to be unsolvable. We present an algorithm that solves an intermediate problem, the biangular circle formation, deterministically in finite time.