A framework for global planning for redundant manipulators

By dividing the path planning problem into two subproblems (local and global planning), we obtain a planner for redundant manipulators that is fast, effective and versatile. Local planning is achieved within a potential field paradigm, modelling a rigid linked manipulator with slightly flexible links. The planner can either be used within advanced tele-operated systems, or as path refinement within an autonomous planner. We use a geometric construction which we call the skeleton to provide a concise connection between the global and local planners. The global planner acquires critical geometric information from the skeleton and end-effector paths are extracted and used to direct the local planner as a first step to a geometric reasoning planner.<<ETX>>

[1]  Stephen Cameron,et al.  Snake-based path planning for redundant manipulators , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[2]  Narendra Ahuja,et al.  Path planning using a potential field representation , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[3]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[4]  Vladimir J. Lumelsky,et al.  Motion planning for a whole-sensitive robot arm manipulator , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[5]  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.

[6]  Andrew Blake,et al.  Parallel Implementation of Lagrangian Dynamics for real-time snakes , 1991 .

[7]  Oussama Khatib,et al.  Elastic bands: connecting path planning and control , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.