Planning collision free trajectories by a configuration space approach

This paper addresses the motion planning problem. We present a simple and efficient algorithm for generating a approximate representation of the free Configuration Space for a robot moving in a workspace with obstacles. The algorithms presented in this paper have been implemented and can deal with all robots made of revolute or prismatic joints. We present an exemple of collision-free trajectories computed by the system for a manipulator with 4 degrees of freedom.

[1]  L. Gouzenes.  Strategies for Solving Collision-free Trajectories Problems for Mobile and Manipulator Robots , 1984 .

[2]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.

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

[4]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Christian Laugier.  Raisonnement géométrique et méthodes de décision en robotique : application à la programmation automatique des robots. (Geometric reasoning and decision making technics in robotics. Application to automatic robot programming) , 1987 .

[6]  Bernard Faverjon.  Object level programming of industrial robots , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[8]  Thierry Siméon,et al.  Trajectory planning and motion control for mobile robots , 1988, Geometry and Robotics.

[9]  Emmanuel Mazer.  Handey‎ : un modèle de planificateur pour la programmation automatique des robots. (Handey : a planner for automatic robot programming) , 1987 .

[10]  V. Lumelsky,et al.  Continuous Robot Motion Planning In Unknown Environment , 1986 .

[11]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[12]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three space , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.