Impossibility of gathering by a set of autonomous mobile robots
From MaRDI portal
Publication:2382675
DOI10.1016/j.tcs.2007.04.023zbMath1125.68124OpenAlexW2119517221MaRDI QIDQ2382675
Publication date: 2 October 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.023
Related Items
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ On asynchronous rendezvous in general graphs ⋮ Gathering fat mobile robots with slim omnidirectional cameras ⋮ Gathering Anonymous, Oblivious Robots on a Grid ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ MinMax-Distance Gathering on Given Meeting Points ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Energy-efficient strategies for building short chains of mobile robots locally ⋮ Unifying gathering protocols for swarms of mobile robots ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ Rendezvous Problem ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ Optimum Gathering of Asynchronous Robots ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ Gathering six oblivious robots on anonymous symmetric rings ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ Randomized gathering of asynchronous 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 New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Characterizing geometric patterns formable by oblivious anonymous mobile robots ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Unnamed Item ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Rendezvous with constant memory ⋮ Synchronous gathering without multiplicity detection: a certified algorithm ⋮ Collisionless Gathering of Robots with an Extent ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering ⋮ Convergence of Mobile Robots with Uniformly-Inaccurate Sensors ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Rendezvous of Two Robots with Constant Memory ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The effect of synchronicity on the behavior of autonomous mobile robots
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Structural Information and Communication Complexity
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Algorithms – ESA 2004
- LATIN 2004: Theoretical Informatics
