RRT-connect: an efficient approach to single-query path planning

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2, Issue , 2000, Pages 995-1001

  Kuffner Jr , James J ^a   La Valle, Steven M ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC GRAPHIC ANIMATION; COLLISION FREE MOTION; HUMAN ARM; RAPIDLY EXPLORING RANDOM TREES; SINGLE QUERY PATH PLANNING;

ALGORITHMS; ANIMATION; COMPUTER GRAPHICS; CONSTRAINT THEORY; DEGREES OF FREEDOM (MECHANICS); END EFFECTORS; KINEMATICS; STATE SPACE METHODS;

MOTION PLANNING;

EID: 0033726628     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. N. M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In IEEE Int. Conf. Robot. & Autom., pages 113-120, 1996.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891-923, 1998
3. J. Barraquand, L.E. Kavraki, J.C. Latombe, T.Y. Li, R. Motwani, and P. Raghavan. A random samplin scheme for path planning. Int. J. Robot. Res., 16(6):759-774, 1997.
4. J. Barraquand and J.-C. Latombe Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles. In IEEE Int. Conf. Robot. & Autom., pages 2328-2335, 1991.
5. V. Boor, M. Overmars, and A.F. van der Stappen. The Gaussian sampling strategy for probabilistic roadmap planners. In Proc. of IEEE Int. Conf. Robotics and Automation, Detroit, MI, 1999.
6. J.,F. Canny. The Complexity of Robot Motion Plannzng. MIT Press, Cambridge, MA, 1988.
7. D. Chalou and M. Gini. Parallel robot motion planning. In Proc. of IEEE Int. Conf. Robotics and Automation, pages 24-51, Atlanta, GA, 1993.
8. S. Gottschalk, M. C. Lin, and D. Manocha. Obbtree: A hierarchical structure for rapid interference detection. In SIGGRAPH '96 Proc., 1996. ACM, 45:891-923, 1998.
9. L. J. Guibas, D. Hsu, and L. Zhang. H-Walk: Hierarchical distance computation for moving convex bodies. In Proc. ACM Symposium on Computational Geometry, pages 265-273, 1999.
10. T. Horsch, F. Schwarz, and H. Tolle. Motion planning for many degrees of freedom : Random reflections at c-space obstacles. In Proc. of the IEEE Int. Conf. on Robotics and Automation (ICRA'94), pages 3318-3323, San Diego, CA, April 1994.
11. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In Int. J. of Computational Geometry and Applications, 1997.
12. Y. K. Hwang and N. Ahuja.. A potential field approach to path planning. IEEE Trans. Robot. & Autom., 8(1):23-32, February 1992.
13. P. Indyk and R. Motwani Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998.
14. J. J. Kuffner Jr. Autonomous Agents for Real-time Animation. PhD thesis, Stanford University, 1999.
15. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. & Autom., 12(4):566-580, June 1996.
16. L.E. Kavraki and J.-C. Latombe. Randomized preprocessing of configuration space for fast path planning. Technical report, Dept. of Computer Science, Stanford University, September 1993.
17. Y. Koga, K. Kondo, J. Kuffner, and J.-C. Latombe. Planning motions with intentions. In Proc. SIGGRAPH '94, pages 395-408, 1994.
18. S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State Univ. 〈 http://janowec.cs.iastate.edu/papers/rrt.ps 〉, Oct. 1998.
19. S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. In Proc. IEEE Int'Z Conf. on Robotics and Automation, 1999.
20. M. C. Lin and J. F. Canny. Efficient algorithms for incremental distance computation. In IEEE Int. Conf. Robot. & Autom., 1991.
21. E. Mazer, J. M. Ahuactzin, and P. Bessikre. The Ariadne's clew algorithm. J. Artificial Intell. Res., 9:295-316, November 1998.
22. B. Mirtich. V-Clip: Fast and robust polyhedral collision detection. Technical Report TR97-05, Mitsubishi Electronics Research Laboratory, 1997.
23. M. Overmars. A random approach to motion planning. Technical report, Dept. Computer Science, Utrect University, The Netherlands, October 1992.
24. J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. of IEEE Symp. on Foundat. of Comp. Sci., pages 421-427, 1979.
25. J. T. Schwartz and M. Sharir. On the piano movers' problem: Coordinating the motion of several independent bodies. Int. J. Robot. Res., 2(3):97-140, 1983.
26. P. Svestka. A probabilistic approach to motion planning for car-like robots. Technical report, Dept. Computer Science, Utrect Univ., April 1993.