Distributed covering by ant-robots using evaporating traces

IEEE Transactions on Robotics and Automation

Volumn 15, Issue 5, 1999, Pages 918-933

  Wagner, Israel A ^a   Lindenbaum, Michael ^b   Bruckstein, Alfred M ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; ARTIFICIAL INTELLIGENCE; GRAPH THEORY; MATHEMATICAL MODELS; MOBILE ROBOTS; POLYNOMIALS;

ANT ROBOTICS; MULTIAGENT SYSTEMS;

INTELLIGENT ROBOTS;

EID: 0033339546     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.795795     Document Type: Article

References (60)

1. F. R. Adler and D. M. Gordon, "Information collection and spread by networks of patrolling ants," Amer. Naturalist, vol. 140, no. 3, Sept. 1992.
2. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rakoff, "Random walks, universal traversal sequences, and the complexity of maze problems," in Proc. 20th Annu. Symp. Foundations Comput. Sci., San Juan, Puerto Rico, Oct. 1979, pp. 218-223.
3. W. Alt, "Biased random walk models for chemotaxis and related diffusion approximations," J. Math. Biol., vol. 9, pp. 147-177, 1980.
4. G. Giralt and C. Weisbin, Eds., Auton. Robots Planet. Explorat., Auton. Robots, vol. 2, pp. 259-362, 1995.
5. J. Borenstein, H. R. Everett, and L. Feng, Navigating Mobile Robots - Systems and Techniques. Wellesley, MA: A. K. Peters, 1996.
6. C. M. Bender and S. A. Orszag, Advanced Mathematical Methods for Sdentists and Engineers. New York: McGraw-Hill, 1978.
7. G. Beni and J. Wang, "Theoretical problems for the realization of distributed robotic systems," in Proc. 1991 IEEE Int. Conf. Robot. Automat., Sacramento, CA, Apr. 1991, pp. 1914-1920.
8. B. Bollobas, Graph Theory - An Introductory Course. New York: Springer-Verlag, 1990.
9. V. Braitenberg, Vehicles. Cambridge, MA: MIT Press, 1984.
10. T. Balch and R. C. Arkin, "Communication in reactive multiagent robotic systems," Auton. Robots, vol. 1, pp. 27-52, 1994.
11. M. Blum and W. J. Sakoda, "On the capability of finite automata in 2 and 3 dimensional space," in Proc. FOCS'77, 1977, pp. 147-161.
12. G. Barnes and U. Feige, "Short random walks on graphs," in Proc. 25th ACM STOC, 1993.
13. M. Blum and D. Kozen, "On the power of the compass, or, why mazes are easier to search than graphs," in Proc. FOCS'78, 1978, pp. 132-142.
14. A. Z. Broder, A. R. Karlin, P. Raghavan, and E. Upfal, "Trading space for time in undirected s - t connectivity," SIAM J. Comput., vol. 23, no. 2, pp. 324-334, Apr. 1994.
15. P. Bonasso and K. Mayers, "The home-vacuum event," Al Mag., vol. 19, no. 3, Fall 1998.
16. R. A. Brooks, "Artificial life and real robots," in Proceedings of the First European Conference on Artificial Life. Cambridge, MA: MIT Press/Bradford Books, 1992, pp. 3-10.
17. A. M. Bruckstein, "Why the ant trails look so straight and nice," Math. Intell., vol. 15, no. 2, pp. 59-62, 1993.
18. A. M. Bruckstein, C. L. Mallows, and I. A. Wagner, "Probabilistic pursuits on the integer grid," Amer. Math. Monthly, vol. 104, no. 4, Apr. 1997.
19. S. H. Clearwater, T. Hogg, and B. H. Huberman, "Cooperative solution of constraint satisfaction problems," in Computation: The Micro and the Macro View, B. A. Huberman, Ed. Singapore: World Scientific, 1992, pp. 33-70.
20. Z. Collin and S. Dolev, "Self-stabilizing depth-first search," Inform. Process. Lett., vol. 49, pp. 297-301, 1994.
21. J. L. Deneubourg, S. Aron, S. Goss, J. M. Pasteels, and G. Duerink, "Random behavior, amplification processes and number of participants How they contribute to the foraging properties of ants," Physica, vol. 22D, pp. 176-186, 1986.
22. E. W. Dijkstra, "Self-stabilizing systems in spite of distributed control," Commun. ACM, vol. 17, pp. 643-644, 1974.
23. X. Deng and A. Mirzaian, "Competitive robot mapping with homogeneous markers," IEEE Trans. Robot. Automat., vol. 12, pp. 532-542, Aug. 1996.
24. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," IEEE Trans. Robot. Automat., vol. 7, pp. 859-864, Dec. 1991.
25. S. Even, Graph Algorithms. Rockville, MD: Comput. Sci. Press, 1979.
26. A. S. Fraenkel, "Economic traversal of labyrinths," Math. Mag., vol. 43, pp. 125-130, 1970; correction vol. 44, p. 12, 1971.
27. S. Gal and E. J. Anderson, "Search in a maze," Probab. Eng. Inform. Sci., vol. 4, pp. 311-318, 1990.
28. C. Hofner and G. Schmidt, "Path planning and guidance techniques for an autonomous mobile cleaning robot," Robot. Auton. Syst., vol. 14, pp. 199-212, 1995.
29. B. K. Holldobler and E. O. Wilson, "Weaver ants," Sci. Amer., vol. 237, no. 6, pp. 146-154, 1977.
30. J. Huxley, Ants London, U.K.: Arrow Books, 1962.
31. J. Hopcroft and R. Tarjan, "Efficient algorithms for graph manipulation," Commun. ACM, pp. 372-378, June 1973.
32. S. Hert, S. Tiwari, and V. Lumelsky, "A terrain covering algorithm for an AUV," Auton. Robots, vol. 3, nos. 2-3, pp. 91-119, June-July 1996.
33. S. Hedberg, "Robots cleaning up hazardous waste," Al Expert. New York: Springer-Verlag, May 1995, pp. 20-24, 1994.
34. A. Itai, C. H. Papadimitriou, and J. L. Szwarefiter, "Hamilton paths in grid graphs," SIAM J. Comput., vol. 11, pp. 676-686, 1982.
35. Instantiating Real-World Agents Papers from the AAAI 1993 Fall Symposium, Technical Report FS-93-03. Menlo Park, CA: AAAI Press, 1993.
36. M. Kac, "Some mathematical models in science," Science, vol. 166, pp. 695-699, 1969.
37. B. Kuipers and Y. T. Byun, "A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations," Robot. Auton. Syst., vol. 8, pp. 47-63, 1981.
38. S. Katz and O. Shmueli, "Cooperative distributed algorithms for dynamic cycle prevention," IEEE Tran. Softw. Eng., vol. SE-13, pp. 540-552, May 1987.
39. S. Lefschetz, Differential Equations Geometric Theory. New York: Interscience, 1957.
40. E. M. Rauch, M. M. Millonas, and D. R. Chialvo, "Pattern formation and functionality in swarm models," Phys. Lett. A, 1995.
41. J. D. Nicoud and M. K. Habib, "The Pemex B autonomous demining robot: Perception and navigation strategies," in Proc. 1995 IEEE/RSJ Int. Conf. Intel. Robots Syst., Human-Robot Interaction Cooperative Robots, Pittsburgh, PA, Aug. 1995, vol. 1, pp. 419-424.
42. L. E. Parker, "On the design of behavior-based multi-robot teams," Adv. Robot., vol. 10, no. 6, pp. 547-578, 1996.
43. R. A. Russell, "Mobile robot guidance using a short-lived heat trail," Robotica, vol. 11, pp. 427-431, 1993.
44. _, "Laying and sensing odor markings as a strategy for assisting mobile robots navigation tasks," IEEE Robot. Automat. Mag., vol. 2, pp. 3-9, Sep. 1995.
45. _, "Heat trails as short-lived navigational markers for mobile robots," in Proc. 1997 IEEE Int. Conf. Robot. Automat., 1997, pp. 3534-3539.
46. M. Schneider-Fontán and M. J. Matríc, "Territorial multi-robot task division," IEEE Trans. Robot. Automat., vol. 15, pp. 815-822, Oct. 1998.
47. Y. Shoham and M. Tennenholtz, "On social laws for artificial agent societies: Off line design," in Al J., 1995.
48. H. A. Simon, The Sciences of the Artificial, 2nd ed. Cambridge, MA: MIT Press, 1981.
49. S. Sen, M. Sekaran, and J. Hale, "Learning to coordinate without sharing information," in Proc. AAAI-94, 1994, pp. 426-431.
50. L. Steels, "Cooperation between distributed agents through self-organization," Decentralized A.I. - Proceedings of the Firstst European Workshop on Modeling Autonomous Agents in Multi-Agent World, Y. DeMazeau and J. P. Muller, Eds. Amsterdam, The Netherlands: Elsevier, 1990, pp. 175-196.
51. R. Tarjan, "Depth-first search and linear graph algorithms," SIAM J. Comput., vol. 1, no. 2, pp. 146-160, 1972.
52. G. Tarry, "Le problem des labyrinths," Nouvelles Annales de Mathematiques, vol. 14, p. 187, 1895.
53. ∼wagner/pub/vaw.html.
54. I. A. Wagner and A. M. Bruckstein, "Cooperative cleaners - A study in ant-robotics," in Communications, Computation, Control, and Signal Processing: A Tribute to Thomas Kailath, A. Paulraj, V. Roychowdhury, and C. D. Schaper, Eds. Amsterdam: The Netherlands, Kluwer, 1997, pp. 289-308.
55. Preliminary version appeared 1st Online Workshop on Evolutionary Computation, Nagoya university and the WWW, Oct. 1995, http://www.bioele.nuee.nagoya-u.ac.jp/wec/.
56. I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein, "Smell as a computational resource - A lesson we can learn from the ant," in Proc. 4th Israeli Symp. Theory Comput. Syst., Jerusalem, Israel, June 10-12, 1996;
57. also in Tech. Rep. CIS-9610, Ctr. Intell. Syst., Technion, Haifa, Israel, Apr. 1996.
58. _, "On-line graph searching by a smell-oriented vertex process," in Proc. AAAA'97 Workshop On-Line Search, Providence, RI, July 28, 1997, pp. 122-125.
59. _, "Efficiently searching a graph by a smell-oriented vertex process," in Annals of Mathematics and AI. The Netherlands: Baltzer Science Publishers, 1998, pp. 211-223.
60. H. Yaguchi, "Robot introduction to cleaning work in the East Japan Railway Co.," Adv. Robot., vol. 10, no. 4, pp. 403-414, 1996.