Distributed algorithms for partitioning a swarm of autonomous mobile robots

DOI10.1016/J.TCS.2008.04.042zbMath1164.68037OpenAlexW2108943074MaRDI QIDQ1008735

Asaf Efrima, David Peleg

Publication date: 30 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.042

zbMATH Keywords

partitioningautonomous mobile robotsrobot swarm

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (8)

\(k\)-circle formation by disoriented asynchronous robots ⋮ Optimal probabilistic ring exploration by semi-synchronous oblivious robots ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences ⋮ Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots ⋮ Geometric computations by broadcasting automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Structural Information and Communication Complexity
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Distributed Models and Algorithms for Mobile Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Algorithms – ESA 2004
• Structural Information and Communication Complexity
• LATIN 2004: Theoretical Informatics

This page was built for publication: Distributed algorithms for partitioning a swarm of autonomous mobile robots