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

DOI10.1007/978-3-031-32733-9_8MaRDI QIDQ6148061zbMATH OpenOpenAlexFDO

Authors 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

convergencegatheringcompatibilitycrash 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

• A new approach for analyzing convergence algorithms for mobile robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed computing by mobile robots: gathering
• Fault-tolerant gathering algorithms for autonomous mobile robots
• Forming sequences of geometric patterns with oblivious mobile robots
• 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
• The gathering problem for two oblivious robots with unreliable compasses

Cited in

(2)

• Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
• Compatibility of convergence algorithms for autonomous mobile robots

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

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