Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses

DOI10.1007/978-3-540-69355-0_3MaRDI QIDQ3511385zbMATH OpenOpenAlexFDO

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

Publication date 10 July 2008

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-69355-0_3

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Recommendations

• The gathering problem for two oblivious robots with unreliable compasses
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Gathering asynchronous robots in the presence of obstacles
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Optimum Gathering of Asynchronous Robots
• Randomized gathering of asynchronous mobile robots
• Gathering of asynchronous robots with limited visibility
• scientific article; zbMATH DE number 1688369

Cites work

• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Gathering of asynchronous robots with limited visibility
• Structural Information and Communication Complexity

Cited in

(3)

• The gathering problem for two oblivious robots with unreliable compasses
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots

This page was built for publication: Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses

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