Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R. The primary objective is to minimize the makespan, that is, the time to fill the entire region. An environment is composed of pixels that form a connected subset of the integer grid. There is at most one robot per pixel and robots move horizontally or vertically at unit speed. Robots enter R by means of k ≥ 1 door pixels. Robots are primitive finite automata, only having local communication, local sensors, and a constant-sized memory.

[1]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[2]  David W. Payton,et al.  Progress in Pheromone Robotics , 2001 .

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

[4]  Israel A. Wagner,et al.  Efficiently searching a graph by a smell-oriented vertex process , 2004, Annals of Mathematics and Artificial Intelligence.

[5]  Hongyan Wang,et al.  Social potential fields: A distributed behavioral control for autonomous robots , 1995, Robotics Auton. Syst..

[6]  Israel A. Wagner,et al.  Probabilistic Pursuits on the Grid , 1997 .

[7]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[8]  Gaurav S. Sukhatme,et al.  Spreading Out: A Local Approach to Multi-robot Coverage , 2002, DARS.

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

[10]  and G Vincenzo Gervasi.  Flocking by a Set of Autonomous Mobile Robots , 2001 .

[11]  Israel A. Wagner,et al.  Distributed covering by ant-robots using evaporating traces , 1999, IEEE Trans. Robotics Autom..

[12]  Gaurav S. Sukhatme,et al.  Multi-robot Dynamic Coverage of a Planar Bounded Environment , 2003 .

[13]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  Michael R. M. Jenkin,et al.  Map validation and robot self-location in a graph-like world , 1997, Robotics Auton. Syst..

[15]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[16]  David W. Payton,et al.  Pheromone Robotics , 2001, Auton. Robots.

[17]  Mona Singh,et al.  Piecemeal Graph Exploration by a Mobile Robot , 1999, Inf. Comput..

[18]  William M. Spears,et al.  Using artificial physics to control agents , 1999, Proceedings 1999 International Conference on Information Intelligence and Systems (Cat. No.PR00446).

[19]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[20]  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).

[21]  Alan F. T. Winfield,et al.  Distributed Sensing and Data Collection via Broken Ad Hoc Wireless Connected Networks of Mobile Robots , 2000, DARS.

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

[23]  Mona Singh,et al.  Piecemeal graph exploration by a mobile robot (extended abstract) , 1995, COLT '95.

[24]  Masafumi Yamashita,et al.  High speed formations of reconfigurable modular robotic systems , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[25]  Douglas W. Gage,et al.  Sensor abstractions to support many-robot systems , 1993, Other Conferences.