DocumentCode
2943136
Title
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
Author
Hsu, David ; Sanchez-Ante, Gildardo ; Sun, Zheng
fYear
2005
fDate
18-22 April 2005
Firstpage
3874
Lastpage
3880
Abstract
A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strategies all have unique strengths, but none of them solves the problem completely. In this paper, we present a general and systematic approach for adaptively combining multiple sampling strategies so that their individual strengths are preserved. We have performed experiments with this approach on robots with up to 12 degrees of freedom in complex 3-D environments. Experiments show that although the performance of individual sampling strategies varies across different environments, the adaptive hybrid sampling strategies constructed with this approach perform consistently well in all environments. Further, we show that, under reasonable assumptions, the adaptive strategies are provably competitive against all individual strategies used.
Keywords
motion planning; probabilistic roadmap planners; randomized al gorithms; robotics; Animation; Application software; Computer aided manufacturing; Computer science; Motion planning; Orbital robotics; Robots; Sampling methods; Strategic planning; Sun; motion planning; probabilistic roadmap planners; randomized al gorithms; robotics;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 2005. ICRA 2005. Proceedings of the 2005 IEEE International Conference on
Print_ISBN
0-7803-8914-X
Type
conf
DOI
10.1109/ROBOT.2005.1570712
Filename
1570712
Link To Document