Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Distributed Algorithms
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
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
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Rendezvous of Mobile Agents When Tokens Fail Anytime
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Rendezvous of mobile agents without agreement on local orientation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Exclusive perpetual ring exploration without chirality
DISC'10 Proceedings of the 24th international conference on Distributed computing
Uniform multi-agent deployment on a ring
Theoretical Computer Science
Network exploration by silent and oblivious robots
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Optimal exploration of small rings
Proceedings of the Third International Workshop on Reliability, Availability, and Security
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
DISC 2011 invited lecture: deterministic rendezvous in networks: survey of models and results
DISC'11 Proceedings of the 25th international conference on Distributed computing
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Space-optimal rendezvous of mobile agents in asynchronous trees
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Mobile robots gathering algorithm with local weak multiplicity in rings
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Optimal deterministic ring exploration with oblivious asynchronous robots
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Asynchronous exclusive perpetual grid exploration without sense of direction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
Theoretical Computer Science
Hi-index | 0.00 |
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, Theor. Comp. Sci. 390(1), 27-39, 2008]. 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.