Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

DOI10.1016/j.tcs.2010.05.020zbMath1195.68099OpenAlexW2001165134MaRDI QIDQ986558

Alfredo Navarra, Adrian Kosowski, Ralf Klasing

Publication date: 11 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.020

zbMATH Keywords

ringmobile robotsasynchronous systemoblivious robotsgathering problem

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items

Memory optimal dispersion by anonymous mobile robots, On asynchronous rendezvous in general graphs, Gathering over Meeting Nodes in Infinite Grid*, Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, Ring exploration with myopic luminous robots, Computing without communicating: ring exploration by asynchronous oblivious robots, Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings, Optimal probabilistic ring exploration by semi-synchronous oblivious robots, Gathering asynchronous oblivious agents with local vision in regular bipartite graphs, Ring exploration of myopic luminous robots with visibility more than one, Gathering of robots on anonymous grids and trees without multiplicity detection, Time optimal gathering of myopic robots on an infinite triangular grid, Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model, How many oblivious robots can explore a line, Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains, Gathering robots in graphs: the central role of synchronicity, Asynchronous deterministic rendezvous in bounded terrains, Optimal torus exploration by oblivious robots, Gathering six oblivious robots on anonymous symmetric rings, Memory optimal dispersion by anonymous mobile robots, Computing on rings by oblivious robots: a unified approach for different tasks, A unified approach for gathering and exclusive searching on rings under weak assumptions, Leader election for anonymous asynchronous agents in arbitrary networks, Gathering of oblivious robots on infinite grids with minimum traveled distance, Gathering on rings under the look-compute-move model, On the self-stabilization of mobile oblivious robots in uniform rings, Embedded pattern formation by asynchronous robots without chirality, Universal Systems of Oblivious Mobile Robots, Optimal Gathering of Oblivious Robots in Anonymous Graphs, Deterministic polynomial approach in the plane, Distributed graph searching with a sense of direction, Anonymous meeting in networks

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Asynchronous deterministic rendezvous in graphs
• Impossibility of gathering by a set of autonomous mobile robots
• Gathering asynchronous oblivious mobile robots in a ring
• Deterministic rendezvous in graphs
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Structural Information and Communication Complexity
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Algorithms and Computation
• SOFSEM 2006: Theory and Practice of Computer Science
• LATIN 2004: Theoretical Informatics
• LATIN 2004: Theoretical Informatics