Efficiently searching a graph by a smell-oriented vertex process

Annals of Mathematics and Artificial Intelligence

Volumn 24, Issue 1-4, 1998, Pages 211-223

  Wagner, Israel A ^a,b   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

EID: 0032244577     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018957401093     Document Type: Article

References (20)

1. 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: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico (October 1979) pp. 218-223.
2. G. Barnes and U. Feige, Short random walks on graphs, in: Proc. of the 25th ACM STOC (1993).
3. M. Blum and D. Kozen, On the power of the compass, or, Why mazes are easier to search than graphs, in: Proc. of FOCS '78 (1978) pp. 132-142.
4. M. Blum and W.J. Sakoda, On the capability of finite automata in 2- and 3-dimensional space, in: Proc. of FOCS '77 (1977) pp. 147-161.
5. A.Z. Broder, A.R. Karlin, P. Raghavan and E. Upfal, Trading space for time in undirected s-t connectivity, SIAM J. Comput. 23(2) (1994) 324-334.
6. M. Dorigo, V. Maniezzo and A. Colorni, The ant system: Optimization by a colony of cooperating agents, IEEE Trans. on Systems, Man, and Cybernetics - Part B 26 (1996) 29-41.
7. S. Even, Graph Algorithms (Computer Science Press, Rockville, MD, 1979).
8. A.S. Fraenkel, Economic traversal of labyrinths, Math. Mag. 43 (1970) 125-130, and a correction in 44 (1971) 12.
9. S. Gal and E.J. Anderson, Search in a maze, Probab. Engrg. Inform. Sci. 4 (1990) 311-318.
10. C.V. Goldman and J.S. Rosenschein, Emergent coordination through the use of cooperative state-changing rules, in: Proc. of The National Conference on AI, Seattle, WA (August 1994) pp. 408-413.
11. J. Hopcroft and R. Tarjan, Efficient algorithms for graph manipulation, Comm. ACM (1973) 372-378.
12. R.E. Korf, Real-time heuristic search, Artificial Intelligence 42 (1990) 189-211.
13. S. Koenig and Y. Smirnov, Graph learning with a nearest neighbor approach, in: Proc. of COLT '96, Desenzano del Garda, Italy (June 28-July 1, 1996).
14. N. Madras and G. Slade, The Self-Avoiding Walk (Birkhäuser, Basel, 1993).
15. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1(2) (1972) 146-160.
16. G. Tarry, Le problem des labyrinths, Nouvelles Annales de Mathematiques 14 (1895) 187.
17. S. Thrun, The role of exploration in learning control, in: Handbook for Intelligent Control: Neural, Fuzzy and Adaptive Approaches (Van Nostrand Reinhold, Florence, KY, 1992).
18. S. Thrun, Efficient Exploration in Reinforcement Learning, Technical Report CMU-CS-92-102, Carnegie-Mellon Univ., Pittsburgh, PA (1992).
19. I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Smell as a computational resource - a lesson we can learn from the ant, in: Proc. of ISTCS '96 (1996) pp. 219-230. Web accessible through: http://www.cs.technion.ac.il/∼wagner.
20. I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Cooperative covering by ant-robots using evaporating traces, Technical Report CIS-9610, Center for Intelligent Systems, Technion, Haifa (April 1996); to appear in IEEE Trans. Robot. Autom.