A parallel formulation of informed randomized search for robot motion planning problems
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (10504729), 709-714
- https://doi.org/10.1109/robot.1995.525367
Abstract
We show how paths for articulated robots with many degrees of freedom can be generated in a few seconds or less using nonsystematic parallel search. We present experimental results obtained on a multicomputer for an accurate model of a 7-jointed manipulator arm operating in realistic 3D workspaces. We then present and discuss a fast method for smoothing the paths delivered by the parallel algorithm.Keywords
This publication has 11 references indexed in Scilit:
- SANDROS: a motion planner with performance proportional to task difficultyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Parallel search algorithms for robot motion planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reflexive collision avoidance: a generalized approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The "Ariadne's clew" algorithm: global planning with local methodsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient algorithms for the trajectory planning of redundant manipulators with obstacle avoidancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel robot motion planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Gross motion planning—a surveyACM Computing Surveys, 1992
- Systematic and Nonsystematic Search StrategiesPublished by Elsevier ,1992
- Robot Motion Planning: A Distributed Representation ApproachThe International Journal of Robotics Research, 1991
- Robot Motion PlanningPublished by Springer Nature ,1991