Distributed covering by ant-robots using evaporating traces

We investigate the ability of a group of robots, that communicate by leaving traces, to perform the task of cleaning the floor of an un-mapped building, or any task that requires the traversal of an unknown region. More specifically, we consider robots which leave chemical odour traces that evaporate with time, and are able to evaluate the strength of smell at every point they reach, with some measurement error. Our abstract model is a decentralized multi-agent adaptive system with a shared memory, moving on a graph whose vertices are the floor-tiles. We describe three methods of covering a graph in a distributed fashion, using smell traces that gradually vanish with time, and show that they all result in eventual task completion, two of them in a time polynomial in the number of tiles. Our algorithms can complete the traversal of the graph even if some of the agents die or the graph changes during the execution, as long as the graph stays connected. Another advantage of our agent interaction processes is the ability of agents to use noisy information at the cost of longer cover time.

[1]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[2]  Uriel Feige,et al.  Short random walks on graphs , 1993, SIAM J. Discret. Math..

[3]  Maki K. Habib,et al.  The Pemex-B autonomous demining robot: perception and navigation strategies , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[4]  W. Alt.  Biased random walk models for chemotaxis and related diffusion approximations , 1980, Journal of mathematical biology.

[5]  Moshe Tennenholtz,et al.  On Social Laws for Artificial Agent Societies: Off-Line Design , 1995, Artif. Intell..

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

[7]  R. Andrew Russell.  Mobile robot guidance using a short-lived heat trail , 1993, Robotica.

[8]  Shmuel Katz,et al.  Cooperative Distributed Algorithms for Dynamic Cycle Prevention , 1987, IEEE Transactions on Software Engineering.

[9]  Tucker R. Balch,et al.  Communication in reactive multiagent robotic systems , 1995, Auton. Robots.

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

[11]  Xiaotie Deng,et al.  Competitive robot mapping with homogeneous markers , 1996, IEEE Trans. Robotics Autom..

[12]  Eli Upfal,et al.  Trading Space for Time in Undirected s-t Connectivity , 1994, SIAM J. Comput..

[13]  Benjamin Kuipers,et al.  A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..

[14]  Karen L. Myers,et al.  The Home-Vacuum Event , 1998, AI Mag..

[15]  Shmuel Gal,et al.  Search in a Maze , 1990 .

[16]  Israel A. Wagner,et al.  On-Line Graph Searching by a Smell-Oriented Vertex Process , 1997 .

[17]  Hiroshi Yaguchi.  Robot introduction to cleaning work in the East Japan Railway Company , 1995, Adv. Robotics.

[18]  Maja J. Mataric,et al.  Territorial multi-robot task division , 1998, IEEE Trans. Robotics Autom..

[19]  Vladimir J. Lumelsky,et al.  A terrain-covering algorithm for an AUV , 1996, Auton. Robots.

[20]  Luc Steels,et al.  Cooperation between distributed agents through self-organisation , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.

[21]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[22]  A. Fraenkel.  Economic Traversal of Labyrinths , 1970 .

[23]  S. Orszag,et al.  Advanced Mathematical Methods For Scientists And Engineers , 1979 .

[24]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[26]  Solomon Lefschetz,et al.  Differential Equations: Geometric Theory , 1958 .

[27]  R. Andrew Russell,et al.  Laying and sensing odor markings as a strategy for assisting mobile robot navigation tasks , 1995, IEEE Robotics Autom. Mag..

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

[29]  M Kac,et al.  Some mathematical models in science. , 1969, Science.

[30]  D. Chialvo,et al.  Pattern Formation and Functionality in Swarm Models , 1995, adap-org/9507003.

[31]  Jean-Louis Deneubourg,et al.  Random behaviour, amplification processes and number of participants: how they contribute to the foraging properties of ants , 1986 .

[32]  Liqiang Feng,et al.  Navigating Mobile Robots: Systems and Techniques , 1996 .

[33]  Rodney A. Brooks,et al.  Artificial Life and Real Robots , 1992 .

[34]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[35]  F R Adler,et al.  Information Collection and Spread by Networks of Patrolling Ants , 1992, The American Naturalist.

[36]  Günther Schmidt,et al.  Path planning and guidance techniques for an autonomous mobile cleaning robot , 1995, Robotics Auton. Syst..

[37]  R.A. Russell,et al.  Heat trails as short-lived navigational markers for mobile robots , 1997, Proceedings of International Conference on Robotics and Automation.

[38]  Sandip Sen,et al.  Learning to Coordinate without Sharing Information , 1994, AAAI.

[39]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[40]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .

[41]  B A Huberman,et al.  Cooperative Solution of Constraint Satisfaction Problems , 1991, Science.

[42]  Jing Wang,et al.  Theoretical problems for the realization of distributed robotic systems , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[43]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

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

[45]  Bernardo A. Huberman.  Computation: The Micro and the Macro View , 1992 .

[46]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[47]  J. Hopcroft,et al.  Efficient algorithms for graph manipulation , 1971 .