A Coarse-to-Fine Approach for Fast Path Finding for Mobile Robots

被引:13
作者
Lee, Jae-Yeong [1 ]
Yu, Wonpil [1 ]
机构
[1] Elect & Telecommun Res Inst ETRI, Robot Res Dept, Taejon, South Korea
来源
2009 IEEE-RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS | 2009年
关键词
ANYTIME;
D O I
10.1109/IROS.2009.5354686
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A simple but effective method for fast path finding for mobile robots in grid-based search space is presented. The paper presents a systematic way to reduce the resolution of a grid map preserving the occupancy structure of the original map. Paths are found in two steps with varying quantization levels of the space in coarse-to-fine manner. The resulting paths are practically optimal and experimental results show a great reduction of the searching time, making it possible to implement a real-time global path planner in a very large environment.
引用
收藏
页码:5414 / 5419
页数:6
相关论文
共 18 条
[1]  
[Anonymous], ADV NEURAL INFORM PR
[2]  
[Anonymous], 1980, Principles of artificial intelligence
[3]  
Botea A., 2004, Journal of game development, V1, P1
[4]  
CHEN DZ, 1995, IROS '95 - 1995 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS: HUMAN ROBOT INTERACTION AND COOPERATIVE ROBOTS, PROCEEDINGS, VOL 3, P33, DOI 10.1109/IROS.1995.525858
[5]  
Ferguson D., 2006, P IEEE INT C INT ROB
[6]  
FERGUSON D, 2006, P IEEE INT C ROB AUT
[7]   Anytime, dynamic planning in high-dimensional search spaces [J].
Ferguson, Dave ;
Stentz, Anthony .
PROCEEDINGS OF THE 2007 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-10, 2007, :1310-+
[8]  
Hansen E., 1996, AAAI 96 FALL S FLEX, P55
[9]   Anytime heuristic search [J].
Hansen, Eric A. ;
Zhou, Rong .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2007, 28 :267-297
[10]  
Holte RC, 1996, PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, P530