A new approach for analyzing convergence algorithms for mobile robots

DOI10.1007/978-3-642-22012-8_52MaRDI QIDQ3012964zbMATH OpenOpenAlexFDO

Authors Andreas Cord-Landwehr, Bastian Degener, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Christoph Weddemann, Daniel Wonisch, 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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Artificial intelligence for robotics (68T40)

Recommendations

• Algorithms – ESA 2004
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Structural Information and Communication Complexity
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements

Cites work

• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• Collisionless gathering of robots with an extent
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Fault-tolerant gathering algorithms for autonomous mobile robots
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Gathering few fat mobile robots in the plane
• Impossibility of gathering by a set of autonomous mobile robots
• Local spreading algorithms for autonomous robot systems
• Structural Information and Communication Complexity

Cited in

(13)

• Compatibility of convergence algorithms for autonomous mobile robots (extended abstract)
• Rendezvous with constant memory
• Algorithms – ESA 2004
• Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
• On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
• The optimal tolerance of uniform observation error for mobile robot convergence
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Gathering on rings under the look-compute-move model
• On fast pattern formation by autonomous robots
• Convergecast and broadcast by power-aware mobile agents
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement

This page was built for publication: A new approach for analyzing convergence algorithms for mobile robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012964)