Compatibility of convergence algorithms for autonomous mobile robots (extended abstract)

DOI10.1007/978-3-031-32733-9_8OpenAlexW4377971971MaRDI QIDQ6148061

Yuichi Asahiro, Masafumi Yamashita

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-32733-9_8

zbMATH Keywords

convergencecompatibilitygatheringcrash faultautonomous mobile robot

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Plane formation by synchronous mobile robots in the three dimensional Euclidean space
• Monotonic self-stabilization and its application to robust and adaptive pattern formation
• On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
• Forming sequences of geometric patterns with oblivious mobile robots
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots
• Distributed Computing by Mobile Robots: Gathering
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems

This page was built for publication: Compatibility of convergence algorithms for autonomous mobile robots (extended abstract)