A coarse-to-fine approach for fast path finding for mobile robots

2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2009

Volumn , Issue , 2009, Pages 5414-5419

  Lee, Jae Yeong ^a   Yu, Wonpil ^a  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COARSE-TO-FINE; FAST PATH; GRID MAP; GRID-BASED; PATH PLANNERS; QUANTIZATION LEVELS; SEARCH SPACES; SEARCHING TIME;

INTELLIGENT ROBOTS;

MOBILE ROBOTS;

EID: 76249129509     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2009.5354686     Document Type: Conference Paper

References (18)

1. N. Nilsson, Principles of Artificial Intelligence, Tioga Publishing Company, 1980.
2. * Method," In Proc. IEEE International Conference on Robotics and Automation (ICRA), pp. 662-667, 1993.
3. E. Hansen and S. Zilberstein, "Anytime heuristic search: Preliminary report," In AAAI-96 Fall Symposium on Flexible Computation in Intelligent Systems: Results, Issues, and Opportunities, pp. 55-59. 1996.
4. *," in Proc. of the National Conference on Artificial Intelligence (AAAI), 2002, Student abstract.
5. E. Hansen and R. Zhou, "Anytime Heuristic Search," Journal of Artificial Intelligence Research, Vol. 28, pp. 267-297, 2007.
6. *: An Anytime, Replanning Algorithm," in Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2005.
7. * with provable bounds on sub-optimality," in Advances in Neural Information Processing Systems, MIT Press, 2003.
8. S. M. LaValle and J. J. Kuffner, "Randomized kinodynamic planning," International Journal of Robotics Research, Vol. 20, No. 5, pp. 378-400, May 2001.
9. D. Ferguson and A. Stentz, "Anytime RRTs," in Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 2006.
10. D. Ferguson, N. Kalra, and A. Stentz, "Replanning with RRTs," in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2006.
11. D. Ferguson and A. Stentz, "Anytime, Dynamic Planning in High-dimensional Search Space," in Proc. IEEE International Conference on Robotics and Automation, pp. 1310-1315, 2007.
12. S. Kambhampati and L. Davis, "Multiresolution Path Planning for Mobile Robots," IEEE Journal of Robotics and Automation, Vol. RA-2, No. 3, pp. 135-145, September 1986.
13. D. Z. Chen, R. J. Szczerba, and J. J. Uhran Jr., "Planning Conditional Shortest Paths Through an Unknown Environment: A Framed-Quadtree Approach," in Proc. the 1995 IEEE/RSJ Int. Conf. Intelligent Robots and System Human Interaction and Cooperation, Vol. 3, pp. 33-38, 1995.
14. *: Searching Abstraction Hierarchies Efficiently," in Proceedings AAAI-96, pp. 530-535, 1996.
15. * aesthetic optimizations," In Mark Deloura, editor, Game Programming Gems, pp. 264-271, Charles River Media, 2000.
16. A. Botea, M. Muller, and J. Schaeffer, "Near optimal hierarchical path-finding," Journal of Game Development, Vol. 1, No. 1, pp. 7-28, 2004.
17. N. Sturtevant and M. Buro, "Partial pathfinding using map abstraction and refinement," AAAI-05, pp. 1392-1397, 2005.
18. I. Ulrich and J. Borenstein, "VFH+: Reliable Obstacle Avoidance for Fast Mobile Robots," in Proc. of the IEEE Int. Conf. on Robotics and Automation (ICRA), pp. 1572-1577, May 1998.