Gathering few fat mobile robots in the plane

Autonomous identical robots represented by unit discs move deterministically in the plane. They do not have any common coordinate system, do not communicate, do not have memory of the past and are totally asynchronous. Gathering such robots means forming a configuration for which the union of all discs representing them is connected. We solve the gathering problem for at most four robots. This is the first algorithmic result on gathering robots represented by two-dimensional figures rather than points in the plain: we call such robots fat.

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

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

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

[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]  Reuven Cohen,et al.  Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems , 2005, SIAM J. Comput..

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

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

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

[10]  Andrew B. Kahng,et al.  Cooperative Mobile Robotics: Antecedents and Directions , 1997, Auton. Robots.

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

[12]  Lynne E. Parker,et al.  Multi-Robot Learning in a Cooperative Observation Task , 2000, DARS.

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

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

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

[16]  Lynne E. Parker,et al.  On the design of behavior-based multi-robot teams , 1995, Adv. Robotics.

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

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

[19]  Lynne E. Parker.  Designing control laws for cooperative agent teams , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.