Solving the Robots Gathering Problem

Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, deterministic) moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of gathering them at a point not fixed in advance (GATHERING PROBLEM). In the literature, most contributions are simulation-validated heuristics. The existing algorithmic contributions for such robots are limited to solutions for n ≤ 4 or for restricted sets of initial configurations of the robots. In this paper, we present the first algorithm that solves the GATHERING PROBLEM for any initial configuration of the robots.

[1]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .

[2]  E. J. Cockayne,et al.  Euclidean Constructibility in Graph-Minimization Problems , 1969 .

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

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

[5]  Gordon Cheng,et al.  Experiments in Realising Cooperation between Autonomous Mobile Robots , 1997, ISER.

[6]  Maja J. Matarić,et al.  Designing emergent behaviors: from local interactions to collective intelligence , 1993 .

[7]  Hermann A. Maurer,et al.  New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.

[8]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

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

[10]  Chandrajit L. Bajaj,et al.  The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..

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

[12]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

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

[14]  Nicola Santoro,et al.  Gathering of Asynchronous Oblivious Robots with Limited Visibility , 2001, STACS.

[15]  Tucker R. Balch,et al.  Behavior-based formation control for multirobot teams , 1998, IEEE Trans. Robotics Autom..