Path planning in expansive configuration spaces

International Journal of Computational Geometry and Applications

Volumn 9, Issue 4-5, 1999, Pages 495-512

  Hsu, David ^a   Latombe, Jean Claude ^a   Motwani, Rajeev ^a  

^a Stanford University   (United States)

Author keywords

Configuration space; Motion planning; Path planning; Probabilistic roadmap; Random sampling

Indexed keywords

EID: 0033430455     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195999000285     Document Type: Article

References (18)

1. N. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 113-120, 1996.
2. J. Barraquand, L. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, and P. Raghavan. A random sampling scheme for path planning. In G. Giralt and G. Hirzinger, editors, Proc. Int. Symp. on Robotics Research, pages 249-264, 1996.
3. J. Barraquand and J.-C. Latombe. Robot motion planning: A distributed representation approach. International Journal of Robotics Research, 10(6):628-649, 1991.
4. D. Challou and M. Gini. Parallel robot motion planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 46-51, 1993.
5. H. Chang and T.-Y. Li. Assembly maintainability study with motion planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 1012-1019, 1995.
6. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing distance between objects in three-dimensional space. IEEE Trans. on Robotics and Automation, 4(2), 1988.
7. S. Gottschalk, M. Lin, and D. Manocha. OBB-Tree: A hierarchical structure for rapid interference detection. In Computer Grajphics (SIGGRAPH '96 Proceedings), pages 171-180, 1996.
8. T. Horsch, F. Schwarz, and H. Tolle. Motion planning for many degrees of freedom - random reflections at c-space obstacles. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 3318-3323, 1994.
9. L. Kavraki and J.-C. Latombe. Randomized preprocessing of configurations space for fast path planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 2138-2139, 1994.
10. L. Kavraki, J.-C. Latombe, R. Motwani, and P. Raghavan. Randomized query processing in robot path planning. In A CM Symp. on Theory of Computing, pages 353-362, 1995.
11. L. Kavraki, P. Švestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration space. IEEE Trans. on Robotics and Automation, 12(4):566-580, 1996.
12. L. E. Kavraki. Random Networks in Configuration space for fast path planning. PhD thesis, Stanford Univerity, 1995.
13. F. Lamiraux and J. P. Laumond. On the expected complexity of random path planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 3014-3019, 1996.
14. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991.
15. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
16. S. Quinlan. Efficient distance computation between non-convex objects. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 3324-3329, 1994.
17. J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. IEEE Symp. on Foundations of Computer Science, pages 421-427, 1979.
18. K. Shoemake. Animàting rotation with quaternion curves. In Computer Graphics (SIGGRAPH '85 Proceedings), volume 19, pages 245-254, 1985.