Path planning using a Jacobian-based freespace generation algorithm

A simple and efficient algorithm is developed to generate a 2"-tree (generalized quad-tree) representation of the free configuration space for a manipulator moving in a workspace with obstacles. The algorithm is based on the existence of uniform bounds on the Jacobians relating the differential motions of points on the manipulator to differential joint motions. This representation can be searched to generate a collision-free path and optimized with dynamic constraints to produce an executable trajectory.

[1]  Steven Dubowsky,et al.  Global time optimal motions of robotic manipulators in the presence of obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[2]  Vincent Hayward,et al.  Fast collision detection scheme by recursive decomposition of a manipulator workspace , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[3]  Bruce Randall Donald,et al.  On motion planning with six degrees of freedom: Solving the intersection problems in configuration space , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[4]  Hiroshi Noborio,et al.  A feasible approach to automatic planning of collision-free robot motions , 1988 .

[5]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[6]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

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

[8]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

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

[10]  J. Schwartz,et al.  On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

[11]  Martin Herman,et al.  Fast, three-dimensional, collision-free motion planning , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[13]  Karl G. Kempf,et al.  A collision detection algorithm based on velocity and distance bounds , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.