Dispersing robots in an unknown environment

We examine how the choice of the movement algorithm can affect the success of a swarm of simple mobile robots attempting to disperse themselves in an unknown environment. We assume there is no central control, and the robots have limited processing power, simple sensors, and no active communication. We evaluate different movement algorithms based on the percentage of the environment that the group of robots succeeds in observing.

[1]  Israel A. Wagner,et al.  MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown Domains , 2000, Int. J. Robotics Res..

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

[3]  Gaurav S. Sukhatme,et al.  Most valuable player: a robot device server for distributed control , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[4]  Maria L. Gini,et al.  Performance of a distributed robotic system using shared communications channels , 2002, IEEE Trans. Robotics Autom..

[5]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[6]  Esther M. Arkin,et al.  Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments , 2002, WAFR.

[7]  Esther M. Arkin,et al.  Online dispersion algorithms for swarms of robots , 2003, SCG '03.

[8]  Boleslaw K. Szymanski,et al.  Efficient and inefficient ant coverage methods , 2001, Annals of Mathematics and Artificial Intelligence.

[9]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[10]  G. Swaminathan.  Robot Motion Planning , 2006 .