Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result

DOI10.1007/978-3-540-75142-7_24zbMath1145.68549OpenAlexW1878407411MaRDI QIDQ3523215

Yoshiaki Katayama, Taisuke Izumi, 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)

Related Items (16)

Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Energy-efficient strategies for building short chains of mobile robots locally ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ Unnamed Item ⋮ Collisionless Gathering of Robots with an Extent ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Embedded pattern formation by asynchronous robots without chirality ⋮ Convergence of Mobile Robots with Uniformly-Inaccurate Sensors ⋮ Forming sequences of geometric patterns with oblivious mobile robots

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