Computation of configuration-space obstacles using the fast Fourier transform

作者: L.E. Kavraki

DOI: 10.1109/70.388783

关键词:

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

参考文章(36)
Jean-Claude Latombe, Robot Motion Planning ,(1990)
Jean-Claude Latombe, A fast path planner for a car-like indoor mobile robot national conference on artificial intelligence. pp. 659- 665 ,(1991)
Bernard Roth, Madhusudan Raghaven, Kinematic analysis of the 6R manipulator of general geometry international symposium on robotics. pp. 263- 269 ,(1991)
Robert W. Ramirez, The Fft, Fundamentals and Concepts ,(1984)
Donald L Peiper, THE KINEMATICS OF MANIPULATORS UNDER COMPUTER CONTROL Reproduced by the Clearinghouse for Federal Scentific & Technical Information. ,(1968)
Linda G. Shapiro, Robert M. Haralock, Computer and Robot Vision Addison-Wesley Longman Publishing Co., Inc.. ,(1991)
D. Manocha, J.F. Canny, Real time inverse kinematics for general 6R manipulators international conference on robotics and automation. pp. 383- 389 ,(1992) , 10.1109/ROBOT.1992.220309
Francis Avnaim, Jean Daniel Boissonnat, Polygon Placement Under Translation and Rotation symposium on theoretical aspects of computer science. pp. 322- 333 ,(1988) , 10.1007/BFB0035856
Jérôme Barraquand, Jean-Claude Latombe, Robot motion planning: a distributed representation approach The International Journal of Robotics Research. ,vol. 10, pp. 628- 649 ,(1991) , 10.1177/027836499101000604