Collisionless Gathering of Robots with an Extent
From MaRDI portal
Publication:3075515
DOI10.1007/978-3-642-18381-2_15zbMath1298.68269OpenAlexW1480113909MaRDI QIDQ3075515
Sven Kurras, Kamil Swierkot, Andreas Cord-Landwehr, Christoph Raupach, Daniel Wonisch, Marcus Märtens, Peter Kling, Barbara Kempkes, Alexander Klaas, Bastian Degener, Friedhelm Meyer auf der Heide, Christoph Weddemann, Martina Hüllmann, Daniel D. Warner, Matthias Fischer
Publication date: 15 February 2011
Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_15
Related Items (6)
Gathering fat mobile robots with slim omnidirectional cameras ⋮ The mutual visibility problem for fat robots ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots ⋮ Getting close without touching: near-gathering for autonomous mobile robots
Cites Work
- Unnamed Item
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Gathering few fat mobile robots in the plane
- Practical multiagent rendezvous through modified circumcenter algorithms
- Impossibility of gathering by a set of autonomous mobile robots
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Distributed Models and Algorithms for Mobile Robot Systems
This page was built for publication: Collisionless Gathering of Robots with an Extent
