Distributed algorithms for partitioning a swarm of autonomous mobile robots

DOI10.1016/J.TCS.2008.04.042MaRDI QIDQ1008735zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
• Distributed Models and Algorithms for Mobile Robot Systems
• scientific article; zbMATH DE number 2080911
• Distributed computing by mobile robots: gathering
• Distributed computing by mobile robots: uniform circle formation

Cites work

• scientific article; zbMATH DE number 1629980 (Why is no real title available?)
• scientific article; zbMATH DE number 1049494 (Why is no real title available?)
• scientific article; zbMATH DE number 2044499 (Why is no real title available?)
• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• Algorithms – ESA 2004
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed Models and Algorithms for Mobile Robot Systems
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Fault-tolerant gathering algorithms for autonomous mobile robots
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• LATIN 2004: Theoretical Informatics
• Structural Information and Communication Complexity
• Structural Information and Communication Complexity

Cited in

(14)

• Optimal probabilistic ring exploration by semi-synchronous oblivious robots
• Geometric computations by broadcasting automata
• Distributed Models and Algorithms for Mobile Robot Systems
• Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
• Gathering asynchronous robots in the presence of obstacles
• scientific article; zbMATH DE number 7042503 (Why is no real title available?)
• Leader election and gathering for asynchronous fat robots without common chirality
• \(k\)-circle formation by disoriented asynchronous robots
• scientific article; zbMATH DE number 2080911 (Why is no real title available?)
• Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots
• Parking problem by oblivious mobile robots in infinite grids
• The effect of synchronicity on the behavior of autonomous mobile robots
• Team assembling problem for asynchronous heterogeneous mobile robots

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

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