Computation of configuration-space obstacles using the fast Fourier transform
暂无分享,去创建一个
[1] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[2] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[3] Bruce Randall Donald,et al. Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.
[4] Anthony P. Reeves,et al. Parallel computer architectures for image processing , 1984, Comput. Vis. Graph. Image Process..
[5] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[6] Paul N. Swarztrauber,et al. Multiprocessor FFTs , 1987, Parallel Comput..
[7] Jean-Daniel Boissonnat,et al. Polygon Placement Under Translation and Rotation , 1988, RAIRO Theor. Informatics Appl..
[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] Jean-Paul Laumond,et al. Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..
[10] Leonidas J. Guibas,et al. A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[11] Robert W. Ramirez,et al. The Fft, Fundamentals and Concepts , 1984 .
[12] Wyatt S. Newman,et al. What is This? Downloaded from , 1991 .
[13] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[14] S. Lennart Johnsson,et al. Cooley-Tukey FFT on the Connection Machine , 1992, Parallel Comput..
[15] Jörg-Rüdiger Sack,et al. Computing the configuration space for a robot on a mesh-of-processors , 1989, Parallel Comput..
[16] Paul N. Swarztrauber,et al. Ordered Fast Fourier Transforms on a Massively Parallel Hypercube Multiprocessor , 1991, J. Parallel Distributed Comput..
[17] Majid Sarrafzadeh,et al. Optimal VLSI architectures for multidimensional DFT , 1989, ACM Symposium on Parallelism in Algorithms and Architectures.