Distributed Models and Algorithms for Mobile Robot Systems

DOI10.1007/978-3-540-69507-3_5zbMath1131.68556OpenAlexW1950782218MaRDI QIDQ5448766

Asaf Efrima, David Peleg

Publication date: 7 March 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-69507-3_5

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Autonomous mobile robots with lights ⋮ Computing by Mobile Robotic Sensors ⋮ Mutual visibility by luminous robots without collisions ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ Collisionless Gathering of Robots with an Extent ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Getting close without touching: near-gathering for autonomous mobile robots ⋮ Forming sequences of geometric patterns with oblivious mobile robots ⋮ Geometric computations by broadcasting automata

This page was built for publication: Distributed Models and Algorithms for Mobile Robot Systems