Exploring unknown environments with obstacles

Algorithmica (New York)

Volumn 32, Issue 1, 2002, Pages 123-143

  Albers, S ^a,b   Kursawe, K ^b   Schuierer, S ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c Institut fur Informatik   (Germany)

Author keywords

Competitive analysis; Geometric scenes; Grid graphs; Online algorithms; Robot exploration

Indexed keywords

EID: 11244265971     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0067-x     Document Type: Article

References (18)

1. S. Albers and M. Henzinger. Exploring unknown environments. Proc. 29th Annual ACM Symposium on Theory of Computing, pages 416-425, 1997.
2. B. Awerbuch, M. Betke, R. Rivest and M. Singh. Piecemeal graph learning by a mobile robot. Information and Computation, 152:155-172, 1999.
3. M. Bender and D. Slonim. The power of team exploration: two robots can learn unlabeled directed graphs. Proc. 35th Symposium on Foundations of Computer Science, pages 75-85, 1994.
4. M. Betke, R. Rivest and M. Singh. Piecemeal learning of an unknown environment. Machine Learning, 18:1-24, 1995.
5. A. Blum, P. Raghavan and B. Schieber. Navigating in unfamiliar geometric terrain. SIAM Journal on Computing, 26:110-137, 1997.
6. J. Borenstein and Y. Koren. The vector field histogram - fast obstacle avoidance for mobile robots. IEEE Journal of Robotics and Automation, 7:278-288, 1991.
7. X. Deng, T. Kameda and C. H. Papadimitriou. How to learn an unknown environment. Journal of the ACM, 45:215-245, 1998.
8. X. Deng and C. H. Papadimitriou. Exploring an unknown graph. Proc. 31st Symposium on Foundations of Computer Science, pages 356-361, 1990.
9. A. Elfes. Sonar-based real-world mapping and navigation. IEEE Journal of Robotics and Automation, 3:249-265, 1987.
10. F. Hoffmann. Private communication, 1997.
11. F. Hoffmann, C. Icking, R. Klein and K. Kriegel. A competitive strategy for learning a polygon. Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pages 166-174, 1997.
12. F. Hoffmann, C. Icking, R. Klein and K. Kriegel. The polygon exploration problem: a new strategy and a new analysis technique. Proc. 3rd International Workshop on Algorithmic Foundations of Robotics, pages 211-222, 1998.
13. B. Kalyanasundaram and K. Pruhs. A competitive analysis of algorithms for searching unknown scenes. Computational Geometry and Applications, 3:139-155, 1993.
14. J. Kleinberg. On-line search in a simple polygon. Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 8-15, 1994.
15. H. P. Moravec. Sensor fusion in certainty grids for mobile robots. AI Magazine, 2:61-74, 1988.
16. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
17. S. Thrun, A. Bücken, W. Burgard, D. Fox, T. Fröhlinghaus, D. Hennig, T. Hofmann, M. Krell, and T. Schmidt. Map learning and high-speed navigation in RHINO. In D. Kortenkamp, R. P. Bonasso, and R. Murphy, editors, Artificial Intelligence and Mobile Robots. MIT/AAAI Press, Cambridge, MA, 1998.
18. A. C.-C. Yao. Probabilistic computations: towards a unified measure of complexity. Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.