Motion planning with many degrees of freedom-random reflections at C-space obstacles

This paper describes a motion planner that automatically avoids collisions with obstacles. A transformation of obstacles into configuration space (C-space) is not necessary. Given a polyhedral description of robot, load and environment the algorithm first computes (off-line) a graph which roughly represents the skeleton of the freespace. Due to the way of its computation this graph does not preserve connectivity, although the freespace is a connected set, which is assumed throughout this paper. Reflecting randomly at C-space obstacles a connection between subgraphs is generated. In a second step (online) a connection between a start and a goal configuration to the graph is searched for. The impact of this algorithm concerning movable obstacles is discussed. This method is general and four examples are presented to demonstrate its feasibility by applying it to different kinematic structures with 3, 6 and 12 degrees of freedom.<<ETX>>

[1]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[2]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[3]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[4]  Elmer G. Gilbert,et al.  A new algorithm for detecting the collision of moving objects , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[5]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[6]  J. Michael McCarthy,et al.  Introduction to theoretical kinematics , 1990 .

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

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

[9]  Ming C. Lin,et al.  A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[10]  Thomas Horsch,et al.  Local motion planning avoiding obstacles with dual quaternions , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.