Piecemeal graph exploration by a mobile robot

Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995

Volumn 1995-January, Issue , 1995, Pages 321-328

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MOBILE ROBOTS;

GRAPH EXPLORATION; LINEAR ALGORITHMS; UNDIRECTED GRAPH; UNKNOWN ENVIRONMENTS;

GRAPH THEORY;

EID: 84923103437     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Baruch Awerbuch and Robert G. Gallager. Distributed BFS algorithms. The 26th Symposium on Foundations of Computer Science, pages 250-256, October 1985.
2. Baruch Awerbuch and Robert G. Gallager. A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory, IT-33(3):315-322, 1987.
3. E. Bar-Eli, P. Berman, A. Fiat, and P. Yan. On-line navigation in a room. In Symposium on Discrete Algorithms, pages 237-249, 1992.
4. R. Behringer and S. Hotzel. Simultaneous estimation of pitch angle and lane width from the video image of a marked road. In IEEE/RSJ/GI International Conference on Intelligent Robots and Systems, September 1994.
5. Michael A. Bender and Donna K. Slonim. 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, pages 75-85, November 1994.
6. Margrit Betke. Algorithms for exploring an unknown graph. Master's thesis, MIT Department of Electrical Engineering and Computer Science, February 1992. (Published as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-536, March, 1992).
7. Margrit Betke and Leonid Gurvits. Mobile robot localization using landmarks. IEEE/RSJ/GI International Conference on Intelligent Robots and Systems, September 1994.
8. To appear in IEEE Transactions on Robotics and Automation.
9. Margrit Betke, Ronald Rivest, and Mona Singh. Piecemeal learning of an unknown environment. Machine Learning, 18(2/3):231-254, March 1995.
10. Avrim Blum and P. Chalasani. An on-line algorithm for improving performance in navigation. In Proceedings of the Thirty-Fourth Annual Symposium on Foundations of Computer Science, pages 2-11, November 1993.
11. Avrim Blum, Prabhakar Raghavan, and Baruch Schieber. Navigating in unfamiliar geometric terrain. In Proceedings of Twenty-Third ACM Symposium on Theory of Computing, pages 494-504. ACM, 1991.
12. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
13. Xiaotie Deng, Tiko Kameda, and Christos H. Papadimitriou. How to learn an unknown environment. In Proceedings of the 32nd Symposium on Foundations of Computer Science, pages 298-303. IEEE, 1991.
14. Xiaotie Deng and Christos H. Papadimitriou. Exploring an unknown graph. In Proceedings of the 31st Symposium on Foundations of Computer Science, volume I, pages 355-361, 1990.
15. Gregory Dudek, Michael Jenkin, Evangelos Milios, and David Wilkes. Using multiple markers in graph exploration. In SPIE Vol. 1195 Mobile Robots IV, pages 77-87, 1989.
16. ™: An autonomous mobile robot courier for hospitals. In IEEE/RSJ/GI International Conference on Intelligent Robots and Systems, September 1994.
17. Rolf Klein. Walking an unknown street with bounded detour. Computational geometry: theory and applications, 1(6):325-351, June 1992.
18. Also published in The 32nd Symposium on Foundations of Computer Science, 1991.
19. Jon M. Kleinberg. The localization problem for mobile robots. In Proceedings of the Thirty-Fifth Annual Symposium on Foundations of Computer Science, pages 521-531, May 1994.
20. C. Y. Lee. An algorithm for path connection and its applications. IRE Transactions on Electronic Computers, EC-10(3):346-365, 1961.
21. Edward F. Moore. The shortest path through a maze. In Proceedings of the International Symposium on the Theory of Switching, pages 285-292 Harvard University Press, 1959.
22. Christos H. Papadimitriou and Mihalis Yanakakis. Shortest paths without a map. Theoretical Computer Science, 84:127-150, 1991.
23. Nagewara S. V. Rao, Srikumar Kareti, Weimin Shi, and S. Sitharama Iyengar. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Technical Report ORNL/TM-12410, Oak Ridge National Laboratory, July 1993.
24. Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, April 1993.