Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
SIAM Journal on Computing
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Deterministic Rendezvous in Graphs
Algorithmica
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
SIAM Journal on Computing
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
How many oblivious robots can explore a line
Information Processing Letters
Gathering of six robots on anonymous symmetric rings
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
Gathering of robots on anonymous grids without multiplicity detection
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Gathering an even number of robots in an odd ring without global multiplicity detection
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the self-stabilization of mobile oblivious robots in uniform rings
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
How to gather asynchronous oblivious robots on anonymous rings
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Theoretical Computer Science
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 5.23 |
One of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous move to this neighbor (Move). Cycles are performed asynchronously for each robot. In such a restricted scenario, we study the influence of symmetries of the robot configuration on the feasibility of certain computational tasks. More precisely, we deal with the problem of gathering all robots at one node of the graph, and propose a solution based on a symmetry-preserving strategy. When the considered graph is an undirected ring and the number of robots is sufficiently large (more than 18), such an approach is proved to solve the problem for all starting situations, as long as gathering is feasible. In this way we also close the open problem of characterizing symmetric situations on the ring which admit a gathering [R. Klasing, E. Markou, A. Pelc: Gathering asynchronous oblivious mobile robots in a ring, Theoret. Comput. Sci. 390 (1) (2008) 27-39]. The proposed symmetry-preserving approach, which is complementary to symmetry-breaking techniques found in related work, appears to be new and may have further applications in robot-based computing.