Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots

DOI10.1007/978-3-540-72951-8_22zbMath1201.68122OpenAlexW1865048550MaRDI QIDQ5425977

Hiroyuki Imazu, Koichi Wada, Yuichi Tomida, Yoshiaki Katayama, Nobuhiro Inuzuka

Publication date: 15 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72951-8_22

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (13)

Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Gathering Anonymous, Oblivious Robots on a Grid ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ Computing by Mobile Robotic Sensors ⋮ Self-deployment of mobile sensors on a ring ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Characterizing geometric patterns formable by oblivious anonymous mobile robots ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Convergence of Mobile Robots with Uniformly-Inaccurate Sensors ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots

This page was built for publication: Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots