A randomized roadmap method for path and manipulation planning
Top Cited Papers
- 23 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 113-120
- https://doi.org/10.1109/robot.1996.503582
Abstract
This paper presents a new randomized roadmap method for motion planning for many dof robots that can be used to obtain high quality roadmaps even when C-space is crowded. The main novelty in our approach is that roadmap candidate points are chosen on C-obstacle surfaces. As a consequence, the roadmap is likely to contain difficult paths, such as those traversing long, narrow passages in C-space. The approach can be used for both collision-free path planning and for manipulation planning of contact tasks. Experimental results with a planar articulated 6 dof robot show that, after preprocessing, difficult path planni ng operations can often be carried out in less than a second.Keywords
This publication has 6 references indexed in Scilit:
- Parallel search algorithms for robot motion planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Gross motion planning—a surveyACM Computing Surveys, 1992
- Numerical potential field techniques for robot path planningIEEE Transactions on Systems, Man, and Cybernetics, 1992
- Robot Motion Planning: A Distributed Representation ApproachThe International Journal of Robotics Research, 1991
- Robot Motion PlanningPublished by Springer Nature ,1991
- A search algorithm for motion planning with six degrees of freedomArtificial Intelligence, 1987