Gathering asynchronous oblivious mobile robots in a ring
From MaRDI portal
Publication:2474070
DOI10.1016/j.tcs.2007.09.032zbMath1134.68013OpenAlexW2144182788MaRDI QIDQ2474070
Euripides Markou, Ralf Klasing, Andrzej Pelc
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.032
Related Items (51)
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 ⋮ ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Searching for a Non-adversarial, Uncooperative Agent on a Cycle ⋮ Gathering Anonymous, Oblivious Robots on a Grid ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ 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 ⋮ MinMax-Distance Gathering on Given Meeting Points ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Gathering identical autonomous systems on a circle using stigmergy ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Time optimal gathering of myopic robots on an infinite triangular grid ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ 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 ⋮ Gathering six oblivious robots on anonymous symmetric rings ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ 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 ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Gathering on rings under the look-compute-move model ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Of robot ants and elephants: a computational comparison ⋮ Network Exploration by Silent and Oblivious Robots ⋮ Gathering in dynamic rings ⋮ Searching for a non-adversarial, uncooperative agent on a cycle ⋮ On the self-stabilization of mobile oblivious robots in uniform rings ⋮ Collisionless Gathering of Robots with an Extent ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Universal Systems of Oblivious Mobile Robots ⋮ Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks
Cites Work
- Unnamed Item
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Structural Information and Communication Complexity
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Structural Information and Communication Complexity
- Algorithms and Computation
- LATIN 2004: Theoretical Informatics
- LATIN 2004: Theoretical Informatics
This page was built for publication: Gathering asynchronous oblivious mobile robots in a ring
