Computation of configuration-space obstacles using the fast Fourier transform

This paper presents a new method for computing the configuration-space map of obstacles that is used in motion-planning algorithms. The method derives from the observation that, when the robot is a rigid object that can only translate, the configuration space is a convolution of the workspace and the robot. This convolution is computed with the use of the fast Fourier transform (FFT) algorithm. The method is particularly promising for workspaces with many and/or complicated obstacles, or when the shape of the robot is not simple. It is an inherently parallel method that can significantly benefit from existing experience and hardware on the FFT. >

[1]  Wyatt S. Newman,et al.  What is This? Downloaded from , 1991 .

[2]  Dinesh Manocha,et al.  Real time inverse kinematics for general 6R manipulators , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[3]  Bernard Roth,et al.  Kinematic analysis of the 6R manipulator of general geometry , 1991 .

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

[5]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[6]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[7]  S. Lennart Johnsson,et al.  Cooley-Tukey FFT on the Connection Machine , 1992, Parallel Comput..

[8]  Jörg-Rüdiger Sack,et al.  Computing the configuration space for a robot on a mesh-of-processors , 1989, Parallel Comput..

[9]  Bruce Randall Donald,et al.  Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.

[10]  Jean-Daniel Boissonnat,et al.  Polygon Placement Under Translation and Rotation , 1988, RAIRO Theor. Informatics Appl..

[11]  Harvey Lipkin,et al.  A new method of robotic rate control near singularities , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[12]  Denis Laurendeau,et al.  Tracking a moving object with a 6-dof manipulator , 1993, Defense, Security, and Sensing.

[13]  Linda G. Shapiro,et al.  Computer and Robot Vision , 1991 .

[14]  Jean-Claude Latombe.  A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.

[15]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[16]  Leonidas J. Guibas,et al.  Computing convolutions by reciprocal search , 1986, SCG '86.

[17]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[18]  Emanuele Trucco,et al.  Computer and Robot Vision , 1995 .

[19]  Harvey Lipkin,et al.  Kinematics of complex joint angles in robotics , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[20]  Majid Sarrafzadeh,et al.  Optimal VLSI architectures for multidimensional DFT , 1989, ACM Symposium on Parallelism in Algorithms and Architectures.

[21]  Jean-Claude Latombe,et al.  New heuristic algorithms for efficient hierarchical path planning , 1991, IEEE Trans. Robotics Autom..

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

[23]  Micha Sharir,et al.  Efficient algorithms for planning purely translational collision-free motion in two and three dimensions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[24]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[25]  Anthony P. Reeves,et al.  Parallel computer architectures for image processing , 1984, Comput. Vis. Graph. Image Process..

[26]  Robert W. Ramirez,et al.  The Fft, Fundamentals and Concepts , 1984 .

[27]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[28]  K. C. Gupta,et al.  Improved numerical solutions of inverse kinematics of robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

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

[30]  A. Morgan,et al.  Solving the Kinematics of the Most General Six- and Five-Degree-of-Freedom Manipulators by Continuation Methods , 1985 .

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

[32]  Paul N. Swarztrauber,et al.  Ordered Fast Fourier Transforms on a Massively Parallel Hypercube Multiprocessor , 1991, J. Parallel Distributed Comput..

[33]  Clément Gosselin,et al.  Inverse kinematic functions for approach and catching operations , 1993, IEEE Trans. Syst. Man Cybern..

[34]  Tomás Lozano-Pérez,et al.  Parallel robot motion planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[35]  Jean-Paul Laumond,et al.  Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..

[36]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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