DocumentCode :
2680643
Title :
Adaptive node sampling method for probabilistic roadmap planners
Author :
Park, Byungjae ; Chung, Wan Kyun
Author_Institution :
Robot. Lab., Pohang Univ. of Sci. & Technol. (POSTECH), Pohang, South Korea
fYear :
2009
fDate :
10-15 Oct. 2009
Firstpage :
4399
Lastpage :
4405
Abstract :
This paper proposes an adaptive node sampling method for the probabilistic roadmap (PRM) planner. The proposed method substitutes the random sampling in the learning phase of the PRM planner and improves the configuration of the roadmap. This method uses two phase to determine nodes in order to construct the roadmap. First, the proposed method extracts initial nodes using the approximated cell decomposition and the Harris corner detector. Second, the positions of these nodes are optimized using a construction process of the centroidal voronoi tessellation (CVT). The proposed method determines the adequate number and positions of the nodes to represent the entire free space, and the PRM planner based on the proposed method finds out efficient paths even in narrow passages. These properties have been verified though experiments.
Keywords :
learning systems; mobile robots; path planning; probability; Harris corner detector; PRM planner; adaptive node sampling; approximated cell decomposition; centroidal Voronoi tessellation; learning phase; probabilistic roadmap planners; random sampling; Computational efficiency; Detectors; Intelligent robots; Mechanical engineering; Mobile robots; Path planning; Road accidents; Sampling methods; Space technology; USA Councils;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on
Conference_Location :
St. Louis, MO
Print_ISBN :
978-1-4244-3803-7
Electronic_ISBN :
978-1-4244-3804-4
Type :
conf
DOI :
10.1109/IROS.2009.5354185
Filename :
5354185
Link To Document :
بازگشت