Piecemeal Graph Exploration by a Mobile Robot

Information and Computation

Volumn 152, Issue 2, 1999, Pages 155-172

  Awerbuch, Baruch ^a   Betke, Margrit ^b   Rivest, Ronald L ^c   Singh, Mona ^d  

^a Johns Hopkins University   (United States)

^b BOSTON COLLEGE   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d WHITEHEAD INSTITUTE FOR BIOMEDICAL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000151983     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2795     Document Type: Article

References (22)

1. Awerbuch, B., Berger, B., Cohen, L., and Peleg, D. (1998), Near-linear time construction of sparse neighborhood covers, SIAM J. Comput. 28(1), 254-262.
2. Awerbuch, B., and Gallager, R. G. (1985), Distributed BFS algorithm, in "Proceedings of the 26th Symposium on Foundations of Computer Science," pp. 250-256.
3. Awerbuch, B., and Gallager, R. G. (1987), A new distributed algorithm to find breadth first search trees, IEEE Trans. Inform. Theory IT-33(3), 315-332.
4. Bar-Eli, E., Berman, P., Fiat, A., and Yan, P. (1994), On-line navigation in a room, J. Algorithms 17, 319-341.
5. Bender, M. A., and Slonim, D. K. (1994) The power of team exploration: two robots can learn unlabeled directed graphs, in "Proceedings of the Thirty-Fifth Annual Symposium on Foundations of Computer Science," pp. 75-85.
6. Betke, M. (1992), "Algorithms for Exploring an Unknown Graph," Master's thesis, MIT Department of Electrical Engineering and Computer Science, Published as MIT laboratory for Computer Science Technical Report MIT/LCS/TR-536, March 1992.
7. Betke, M., and Gurvits, L. (April 1997), Mobile robot localization using landmarks, IEEE Trans. Robot. Automat. 13(2), 251-263.
8. Betke, M., Rivest, R. L., and Singh, M. (1995), Piecemeal learning of an unknown environment, Mach. Learning 18(2/3), 231-254.
9. Blum, A., and Chalasani, P. (1993), An on-line algorithm for improving performance in navigation, in "Proceedings of the Thirty-Fourth Annual Symposium on Foundations of Computer Science," pp. 2-11.
10. Blum, A., Raghavan, P., and Schieber, B. (1997), Navigating in unfamiliar geometric terrain, SIAM J. Comput. 26(1), 110-137.
11. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990), "Introduction to Algorithms," MIT Press, Cambridge, MA, McGraw-Hill, New York.
12. Deng, X., Kameda, T., and Papadimitriou, C. H. (1998), How to learn an unknown environment I: The rectilinear case, J. Assoc. Comput. Mach. 45(2), 215-245.
13. Deng, X., and Papadimitriou, C. H. (1990), Exploring an unknown graph, in "Proceedings of the 31st Symposium on Foundations of Computer Science," Vol. I, pp. 355-361.
14. Dudek, G., Jenkin, M., Milios, E., and Wilkes, D. (1989), Using multiple markers in graph exploration, in "SPIE Vol. 1195 Mobile Robots IV," pp. 77-87.
15. Klein, R. (June 1992), Walking an unknown street with bounded detour, Comput. Geom. Theory Appl. 1(6), 325-351.
16. Kleinberg, J. M. (1994), The localization problem for mobile robots, in "Proceedings of the 35st Annual Symposium on Foundations of Computer Science," pp. 521-531.
17. Lee, C. Y. (1961), An algorithm for path connection and its applications, IRE Transactions on Electronic Computers EC-10(3), 346-365.
18. Moore, E. F. (1959), The shortest path through a maze, in "Proceedings of the International Symposium on the Theory of Switching," pp. 285-292.
19. Papadimitriou, C. H., and Yanakakis, M. (1991), Shortest paths without a map, Theor. Comput. Sci. 84, 127-150.
20. Rao, N. S. V., Kareti, S., Shi, W., and Iyengar, S. (1993), "Robot Navigation in Unknown Terrains: Introductory Survey of Non-heuristic Algorithms," Technical Report, ORNL/TM-12410 Oak Ridge National Laboratory.
21. Rivest, R. L., and Schapire, R. E. (April 1993), Inference of finite automata using homing sequences, Inform. and Comput. 103(2), 299-347.
22. Romanik, K., and Schuierer, S. (1996) Optimal robot localization in trees, in "Proceedings of the 12th Symposium on Foundations of Computational Geometry."