Gathering Asynchronous Robots in the Presence of Obstacles
From MaRDI portal
Publication:2980916
DOI10.1007/978-3-319-53925-6_22zbMath1485.68261OpenAlexW2588177768MaRDI QIDQ2980916
Krishnendu Mukhopadhyaya, Subhash Bhagat
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_22
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Leader election and gathering for asynchronous fat robots without common chirality
- Gathering of asynchronous robots with limited visibility
- Gathering few fat mobile robots in the plane
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Impossibility of gathering by a set of autonomous mobile robots
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Distributed Computing by Mobile Robots: Gathering
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- A distributed algorithm for gathering many fat mobile robots in the plane
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots