Choosing good distance metrics and local planners for probabilistic roadmap methods
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (10504729) , 630-637
- https://doi.org/10.1109/robot.1998.677043
Abstract
This paper presents a comparative evaluation of different distance metrics and local planners within the content of probabilistic roadmap methods for motion planning. Both C-space and workspace distance metrics and local planners are considered. The study concentrates on cluttered 3D workspaces, typical of mechanical designs. Our results include recommendations for selecting appropriate combinations of distance metrics and local planners for use in motion planning methods, particularly probabilistic roadmap methods. We find that each local planner makes some connections than none of the others do ndicating that better connected roadmaps will be constructed using multiple local planners. We propose a new local planning method, we call rotate-at-s, that outperforms the common straight-line in C-space method in crowded environments.Keywords
This publication has 28 references indexed in Scilit:
- Computing rotation distance between contacting polyhedraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Implementation of a fast path planner on an industrial manipulatorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Motion planning with many degrees of freedom-random reflections at C-space obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast swept-volume distance for robust collision detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Path planning in expansive configuration spacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Path planning for everyday robotics with SANDROSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A heuristic and complete planner for the classical mover's problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Motion planning for many degrees of freedom: sequential search with backtrackingIEEE Transactions on Robotics and Automation, 1995
- Gross motion planning—a surveyACM Computing Surveys, 1992
- A potential field approach to path planningIEEE Transactions on Robotics and Automation, 1992