Distributed algorithms for partitioning a swarm of autonomous mobile robots

A number of recent studies address systems of mobile autonomous robots from a distributed computing point of view. Although such systems employ robots that are relatively weak and simple (i.e., dimensionless, oblivious and anonymous), they are nevertheless expected to have strong fault tolerance capabilities as a group. This paper studies the partitioning problem, where n robots must divide themselves into k size-balanced groups, and examines the impact of common orientation on the solvability of this problem. First, deterministic crash-fault-tolerant algorithms are given for the problem in the asynchronous full-compass and semi-synchronous half-compass models, and a randomized algorithm is given for the semi-synchronous no-compass model. Next, the role of common orientation shared by the robots is examined. Necessary and sufficient conditions for the partitioning problem to be solvable are given in the different timing models. Finally, the problem is proved to be unsolvable in the no-compass synchronous model.

[1]  Ichiro Suzuki,et al.  Distributed algorithms for formation of geometric patterns with many mobile robots , 1996, J. Field Robotics.

[2]  Mark Cieliebak,et al.  Gathering Non-oblivious Mobile Robots , 2004, LATIN.

[3]  Giuseppe Prencipe.  Achievable Patterns by an Even Number of Autonomous Mobile Robots , 2000 .

[4]  Giuseppe Prencipe,et al.  CORDA : distributed coordination of a set of autonomous mobile robots , 2001 .

[5]  Nicola Santoro,et al.  Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots , 1999, ISAAC.

[6]  Nicola Santoro,et al.  Solving the Robots Gathering Problem , 2003, ICALP.

[7]  Masafumi Yamashita,et al.  Tight bound on the gathering of two oblivious mobile robots with inconsistent compasses , 2007 .

[8]  Yoshiaki Katayama,et al.  Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result , 2007, DISC.

[9]  Reuven Cohen,et al.  Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems , 2005, SIAM J. Comput..

[10]  Giuseppe Prencipe.  Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots , 2001, ICTCS.

[11]  Mark Cieliebak,et al.  Gathering Autonomous Mobile Robots , 2002, SIROCCO.

[12]  David Peleg,et al.  Distributed Models and Algorithms for Mobile Robot Systems , 2007, SOFSEM.

[13]  Reuven Cohen,et al.  Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements , 2006, SIAM J. Comput..

[14]  Giuseppe Prencipe.  On the Feasibility of Gathering by Autonomous Mobile Robots , 2005, SIROCCO.

[15]  Xavier Défago,et al.  Fault-Tolerant and Self-stabilizing Mobile Robots Gathering , 2006, DISC.

[16]  Masafumi Yamashita,et al.  Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 2006, SIAM J. Comput..

[17]  Yoshiaki Katayama,et al.  Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots , 2007, SIROCCO.

[18]  Xavier Défago,et al.  Gathering Asynchronous Mobile Robots with Inaccurate Compasses , 2006, OPODIS.

[19]  Noa Agmon,et al.  Fault-tolerant gathering algorithms for autonomous mobile robots , 2004, SODA '04.

[20]  Reuven Cohen,et al.  Robot Convergence via Center-of-Gravity Algorithms , 2004, SIROCCO.

[21]  Nicola Santoro,et al.  Distributed coordination of a set of autonomous mobile robots , 2000, Proceedings of the IEEE Intelligent Vehicles Symposium 2000 (Cat. No.00TH8511).

[22]  Masafumi Yamashita,et al.  Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots , 1996, Intelligent Robots.