On a simple depth-first search strategy for exploring unknown graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 345-353

  Kwek, Stephen ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

DEPTH FIRST SEARCH STRATEGIES; EULERIAN; SEARCH STRATEGIES; STRONGLY CONNECTED;

GRAPH THEORY;

EID: 84947940108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_73     Document Type: Conference Paper

References (23)

1. [ABRS95] B. Awerbuch, M. Betke, R. Rivest, and M. Singh. Piecemeal graph exploration by a mobile robot. In Proc. 8th Annu. Conf. on Comput. Learning Theory, pages 321-328. ACM Press, New York, NY, 1995.
2. [AH97] S. Albers and M. Henzinger. Exploring unknown environments. In Proc. 29th Annu. ACM Sympos. Theory Comput., pages 416-425, 1997.
3. [AWZ96] D. Angluin, J. Westbrook, and W. Zhu. Robot navigation with range queries. In Proc. 28th Annu. ACM Sympos. Theory Comput., 1996. 469-478.
4. +96] P. Berman, A. Blum, A. Fiat, H. Karloff, A. Rosen, and M. Saks. Randomized robot navigation algorithms. In Proceedings SODA 96, 1996. to appear.
5. [BC93] A. Blum and P. Chalasani. An on-line algorithm fox improving performance in navigation. In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci., pages 2-11. IEEE Computer Society Press, Los Alamitos, CA, 1993.
6. [BNKSP97] A. Bar-Noy, S. Kutten, B. Scieber, and D. Peleg. Competitive unidirectional learning. Unpublished Manuscript, 1997.
7. [BRS91] A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. In Proc. 23th Annu. ACM Sympos. Theory Comput., pages 494-504. ACM, 1991.
8. [BRS95] M. Betke, R. Rivest, and M. Singh. Piecemeal learning of an unknown environment. Machine Learning, 18(2/3):231-254, 1995.
9. [BS94] M. Bender and D. Slonim. The power of team exploration: two robots can learn unlabeled directed graphs. In Proceedings of the 35rd Annual Symposium on Foundations of Computer Science, pages 75-85. IEEE Computer Society Press, Los Alamitos, CA, 1994.
10. [DKP91] X. Deng, T. Kameda, and C. Papadimitriou. How to learn in an unknown environment. In Proc. of the 32nd Symposium on the Foundations of Comp. Sci., pages 298-303. IEEE Computer Society Press, Los Alamitos, CA, 1991.
11. [DP90] X. Deng and C. H. Papadimitriou. Exploring an unknown graph. In Proc. 31th Annu. IEEE Sympos. Found. Comput. Sci., volume I, pages 355-361, 1990.
12. [EBEY92] A. Fiat E, Bar-Eli, P. Berman and P. Yan. On-line navigation in a room. In Proc. 3rd SODA, pages 75-84, 1992.
13. [Kor90] R.E. Korf. Real-time heuristic search. Artificial Intelligence, 42(3):189-211, 1990.
14. [KS96] S. Keonig and Y. Smirnov. Graph learning with a nearest neighbor approach. In Proceedings of the 9th Conference on Computaitonal Learning Theory, pages 19-28, 1996.
15. [Kut88] S. Kutten. Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks. In 9th International Conference on Computer Communication, Tel Aviv, Israel, pages 446-452, 1988.
16. [LS86] V. Lumelsky and A. Stepanov. Dynamic path planning for a mobile automaton with limited information on the environment. IEEE Trans, on Automatic Control, AC-31:1059-1063, 1986.
17. [LS87] V, Lumelsky and A. Stepanov. Path planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shapes. Algorithmica, 2:403-430, 1987.
18. [LT94] V. Lumelsky and S. Tiwari. An algorithm for maze searching with azimuth input. In IEEE Conference on Robotics and Automation, pages 111-116, 1994.
19. [PK92] J.C. Pemberton and R.E. Korf. Incremental path planning on graphs with cycles. In Proceedings of the AI Planning Systems Conference, pages 179-188, 1992.
20. [PY91] C. Papadimitriou and C. Yannakakis. Shortest path wothout a map. Theoretical Computer Science, 84:127-150, 1991.
21. [SKVS96] Y. Smirnov, S. Keonig, M. Veloso, and R. Simmons. Efficient goal-directed exploration. In Proceedings of the National Conference on AI, 1996. 292-297.
22. [Ste95] Stentz. The focussed d* algorithm for real-time replanning. In Proceedings of the International Joint Conf. on AI, pages 1652-1659, 1995.
23. [TK94] C. J. Taylor and D. J. Kriegman. Vision-based motion planning and exploration algorithms for mobile robots. In Proc. of the Workshop on Algorithmic Foundation of Robotics, 1994.