A New Approach for Analyzing Convergence Algorithms for Mobile Robots
From MaRDI portal
Publication:3012964
DOI10.1007/978-3-642-22012-8_52zbMath1334.68227OpenAlexW119243154MaRDI QIDQ3012964
Bastian Degener, Martina Hüllmann, Daniel Wonisch, Christoph Weddemann, Marcus Märtens, Andreas Cord-Landwehr, Barbara Kempkes, Peter Kling, Kamil Swierkot, Sven Kurras, Friedhelm Meyer auf der Heide, Christoph Raupach, Alexander Klaas, Matthias Fischer, Daniel D. Warner
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_52
Related Items
On fast pattern formation by autonomous robots, Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement, Gathering of robots on anonymous grids and trees without multiplicity detection, Compatibility of convergence algorithms for autonomous mobile robots (extended abstract), Gathering on rings under the look-compute-move model, Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement, Rendezvous with constant memory, Convergecast and broadcast by power-aware mobile agents
Cites Work
- Unnamed Item
- Unnamed Item
- Local spreading algorithms for autonomous robot systems
- Gathering few fat mobile robots in the plane
- Impossibility of gathering by a set of autonomous mobile robots
- Collisionless Gathering of Robots with an Extent
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Structural Information and Communication Complexity
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems