Local exploration: Online algorithms and a probabilistic framework

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2, Issue , 2003, Pages 1913-1920

  Isler, Volkan ^a   Kannan, Sampath ^a   Daniilidis, Kostas ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECISION THEORY; HEURISTIC METHODS; IMAGE SENSORS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; RANGE FINDING;

HEURISTIC PLANNING; MARKOV DECISION PROCESS; ONLINE ALGORITHMS; RANGE ACQUISITION; ROBOT EXPLORATION;

MOTION PLANNING;

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

References (19)

1. S. Albers and K. Kursawe. Exploring unknown environments with obstacles. In In Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, 1998. 13, 1998.
2. G. J. W. Amos Fiat. Online algorithms: the state of the art. Berlin; New York: Springer, 1998.
3. D. P. Bertsekas. Dynamic Programming and Optimal Control: 2nd Edition. Athena Scientific, 2000.
4. A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. SIAM Journal on Computing, 26(1):110-137, 1997.
5. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press New York, NY, USA, 1998.
6. W. Burgard, D. Fox, M. Moors, R. Simmons, and S. Thurn. Collaborative multi-robot exploration. In Proc. of International Conference on Robotics and Automation, San Francisco, 2000.
7. H. Choset and J. Burdick. Sensor-based exploration: The hierarchical generalized voronoi graph. The International Journal of Robotics Research, 19(2):96-125, 2000.
8. X. Deng, T. Kameda, and C. Papadimitriou. How to learn an unknown environment i: The rectilinear case. Journal of the ACM, 45:215-245, 1998.
9. X. Deng and A. Mirzaian. Competitive robot mapping with homogeneous markers. IEEE Trans. on Robotics and Automation, 12(4):532-542, 1996.
10. H. Gonzalez-Banos, A. Efrat, J. C. Latombe, E. Mato, and T. M. Murali. Planning robot motion strategies for efficient model construction. In Proc. 9th International Symposium of Robotics Research, Victoria, Australia, 2001.
11. F. Hoffmann, C. Icking, R. Klein, and K. Kriegel. The polygon exploration problem. SIAM Journal on Computing, 31(2):577-600, 2002.
12. C. Icking, R. Klein, and L. Ma. How to look around a corner. Proc. of the 5th Canadian Information Processing Society Congress, pages 443-448, 1993.
13. S. Koenig, C. Tovey, and W. Halliburton. Greedy mapping of terrain. In Proc. of International Conference on Robotics and Automation, pages 3594-3599, 2001.
14. I. M. Rekleitis, G. Dudek, and E. E. Milios. Multi-robot collaboration for robust exploration. Annals of Mathematics and Artificial Intelligence, 31(1-4):7-40, 2001.
15. I. Stamos and P. K. Allen. Integration of range and image sensing for photorealistic 3d modeling. In Proc. of International Conference on Robotics and Automation, pages 1435-1440, San Francisco, 2000.
16. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. The MIT Press, 1998.
17. C. Taylor and D. Kriegman. Vision-based motion planning and exploration algorithms for mobile robots. IEEE Trans. On Robotics and Automation, 14(3):147-427, 1998.
18. S. Thrun. Robotic mapping: A survey. Technical Report CMU-CS-02-111, Dept. of Comp. Science, Carnigie Melon University, 2002.
19. R. M. Zlot, A. T. Stentz, M. B. Dias, and S. Thayer. Multi-robot exploration controlled by a market economy. In IEEE International Conference on Robotics and Automation, May 2002.