Covering a Continuous Domain by Distributed, Limited Robots

We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in their neighborhood. These pheromone marks can be sensed by all robots and thus provide a way for indirect communication between the robots. Apart from this, the robots have no means to communicate. Additionally they are memoryless, have no global information such as the domain map, own position, coverage percentage, etc. Despite the robots’ simplicity, we show that they are able to cover efficiently any connected domains, including non-planar ones.

[1]  Israel A. Wagner,et al.  From Ants to A(ge)nts: A Special Issue on Ant-Robotics , 2001, Annals of Mathematics and Artificial Intelligence.

[2]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[3]  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..

[4]  R. Andrew Russell,et al.  Ant trails - an example for robots to follow? , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[5]  Howie Choset,et al.  Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods , 2003, Int. J. Robotics Res..

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

[7]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

[9]  Sven Koenig,et al.  Terrain coverage with ant robots: a simulation study , 2001, AGENTS '01.

[10]  David Gale Games people do not play , 1993 .

[11]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[12]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[13]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[14]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[15]  W Sibbett,et al.  Ultrashort-pulse lasers: big payoffs in a flash. , 2000, Scientific American.

[16]  Israel A. Wagner,et al.  Smell as a Computational Resource - A Lesson We Can Learn from the Ant , 1996, ISTCS.

[17]  Ralph L. Hollis,et al.  Distributed coverage of rectilinear environments , 2000 .

[18]  Israel A. Wagner,et al.  Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs , 2004, Annals of Mathematics and Artificial Intelligence.

[19]  E. Bonabeau,et al.  Swarm smarts. , 2000, Scientific American.

[20]  Alfred M. Bruckstein,et al.  Why the ant trails look so straight and nice , 1993 .

[21]  Douglas W. Gage,et al.  Randomized search strategies with imperfect sensors , 1994, Other Conferences.

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