Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Dynamic compass models and gathering algorithms for autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Gathering asynchronous mobile robots with inaccurate compasses
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Gathering few fat mobile robots in the plane
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Local algorithms for autonomous robot systems
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On the computational power of oblivious robots: forming a series of geometric patterns
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: leader election vs pattern formation
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Leader election problem versus pattern formation problem
DISC'10 Proceedings of the 24th international conference on Distributed computing
Network exploration by silent and oblivious robots
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Pattern formation through optimum matching by oblivious CORDA robots
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Review: Of robot ants and elephants: A computational comparison
Theoretical Computer Science
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
SIAM Journal on Computing
Getting close without touching
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Asynchronous pattern formation by anonymous oblivious mobile robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Position discovery for a system of bouncing robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 5.23 |
In a system in which anonymous mobile robots repeatedly execute a ''Look-Compute-Move'' cycle, a robot is said to be oblivious if it has no memory to store its observations in the past, and hence its move depends only on the current observation. This paper considers the pattern formation problem in such a system, and shows that oblivious robots can form any pattern that non-oblivious robots can form, except that two oblivious robots cannot form a point while two non-oblivious robots can. Therefore, memory does not help in forming a pattern, except for the case in which two robots attempt to form a point. Related results on the pattern convergence problem are also presented.