Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result

DOI10.1007/978-3-540-75142-7_24MaRDI QIDQ3523215zbMATH OpenOpenAlexFDO

Authors Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada

Publication date 2 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_24

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Recommendations

• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
• The gathering problem for two oblivious robots with unreliable compasses
• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 2038783

Cited in

(22)

• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• Embedded pattern formation by asynchronous robots without chirality
• Forming sequences of geometric patterns with oblivious mobile robots
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• Gathering problems for autonomous mobile robots with lights
• The gathering problem for two oblivious robots with unreliable compasses
• A new approach for analyzing convergence algorithms for mobile robots
• Collisionless gathering of robots with an extent
• Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
• Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
• Energy-efficient strategies for building short chains of mobile robots locally
• The optimal tolerance of uniform observation error for mobile robot convergence
• A survey on relay placement with runtime and approximation guarantees
• Optimal rendezvous \(\mathcal{L}\)-algorithms for asynchronous mobile robots with external-lights
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
• Rendezvous of Asynchronous Mobile Robots with Lights
• Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
• On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
• Gathering semi-synchronously scheduled two-state robots
• Symmetry breaking in the plane. Rendezvous by robots with unknown attributes

This page was built for publication: Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result

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