A hierarchical-orthogonal-space approach to collision-free path planning

We present a methodology for 3-D collision-free path planning in which planning is done in the 3-orthogonal 2-D projections of a 3-D environment. Suboptimal path searching is done in each of the 3 orthogonal 2-D subspaces using primitive path segments. A hierarchical path searching method is introduced to speed up the search process. This approach lends applications to spatial planning in environments where no a priori knowledge is assumed. The three orthogonal 2-D projections can be readily obtained from 3 orthogonal cameras in simple environments.

[1]  R. Brooks Planning Collision- Free Motions for Pick-and-Place Operations , 1983 .

[2]  Donald Lee Pieper The kinematics of manipulators under computer control , 1968 .

[3]  J. S. Luh,et al.  Collision-free path planning for industrial robots , 1982, 1982 21st IEEE Conference on Decision and Control.

[4]  B. Aldefeld,et al.  On automatic recognition of 3D structures from 2D representations , 1983 .

[5]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[7]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..

[8]  Olivier D. Faugeras,et al.  Polyhedral approximation of 3-D objects without holes , 1984, Comput. Vis. Graph. Image Process..

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

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

[11]  J. Y. S. Luh,et al.  Minimum distance collision-free path planning for industrial robots with a prismatic joint , 1984 .

[12]  G. M. Hunter,et al.  Linear transformation of pictures represented by quad trees , 1979 .

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  R. Brooks Solving the Find-Path Problem by Representing Free Space as Generalized Cones , 1982 .

[15]  J. Y. S. Luh A Scheme for Collision Avoidance with Minimum Distance Traveling for Industrial Robots , 1984, J. Field Robotics.