Parallel robot motion planning

A fast, parallel method for computing configuration space maps is presented. The method is made possible by recognizing that one can compute a family of primitive maps which can be combined by superposition based on the distribution of real obstacles. This motion planner has been implemented for the first three degrees-of-freedom of a Puma robot in *Lisp on a Connection Machine with 8 K processors. A six degree-of-freedom version of the algorithm which performs a sequential search of the six-dimensional configuration space, building three-dimensional cross sections in parallel, has also been implemented.<<ETX>>

[1]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[2]  Bernard Faverjon,et al.  Obstacle avoidance using an octree in the configuration space of a manipulator , 1984, ICRA.

[3]  Tomas Lozano-Perez.  A simple motion-planning algorithm for general robot manipulators , 1986, IEEE J. Robotics Autom..

[4]  B. Faverjon,et al.  A local based approach for path planning of manipulators with a high number of degrees of freedom , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[5]  J. Michael McCarthy,et al.  Parameterized descriptions of the joint space obstacles for a 5R closed chain robot , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[6]  J. Michael McCarthy,et al.  An algebraic formulation of configuration-space obstacles for spatial robots , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[7]  Wyatt S. Newman,et al.  Rapid computation of configuration space obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[8]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.