Robot path planning with penetration growth distance

An algorithmic approach to path finding is considered for a general class of robotic systems. The basic idea is to formulate an optimization problem over a family of continuous paths which satisfy the specified end conditions and possess robot-obstacle collisions. The cost to be minimized depends on the penetration growth distance, a new measure for the depth of intersection between a pair of object models. The growth distance and its derivatives with respect to configuration variables describing the orientation and position of the objects can be computed quickly. This is a key factor in attaining acceptable computational times. Variations of the initial strategy, which improve computational efficiency and reliability, are discussed. Significant reductions in computational time are easily obtained by parallel processing.<<ETX>>

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

[2]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

[3]  Steven Dubowsky,et al.  On computing the global time-optimal motions of robotic manipulators in the presence of obstacles , 1991, IEEE Trans. Robotics Autom..

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

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

[6]  S. A. Cameron,et al.  Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[7]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[8]  John Canny,et al.  The complexity of robot motion planning , 1988 .

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

[10]  J. Bobrow,et al.  Time-Optimal Control of Robotic Manipulators Along Specified Paths , 1985 .

[11]  K Sridharan,et al.  Measures of intensity of collision between convex objects and their efficient computation , 1991 .

[12]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[13]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

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

[15]  W. E. Red,et al.  Configuration Maps for Robot Path Planning in Two Dimensions , 1985 .

[16]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[17]  Elmer G. Gilbert,et al.  New distances for the separation and penetration of objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.