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

@article{Kuffner2000RRTconnectAE,
  title={RRT-connect: An efficient approach to single-query path planning},
  author={J. Kuffner and S. LaValle},
  journal={Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)},
  year={2000},
  volume={2},
  pages={995-1001 vol.2}
}
  • J. Kuffner, S. LaValle
  • Published 2000
  • Computer Science
  • Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
  • A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementally building two rapidly-exploring random trees (RRTs) rooted at the start and the goal configurations. The trees each explore space around them and also advance towards each other through, the use of a simple greedy heuristic. Although originally designed to plan motions for a human arm (modeled as a 7-DOF kinematic… CONTINUE READING
    2,422 Citations

    Figures and Topics from this paper

    A simple path optimization method for motion planning
    • 7
    • PDF
    A gradient-based path optimization method for motion planning
    • 9
    • PDF
    Workspace-Guided Rapidly-Exploring Random Tree Method for a Robot Arm
    • PDF
    RDT+: A parameter-free algorithm for exact motion planning
    • 10
    • PDF
    A multi-RRTs framework for robot path planning in high-dimensional configuration space with narrow passages
    • W. Wang, Y. Li
    • Computer Science
    • 2009 International Conference on Mechatronics and Automation
    • 2009
    • 12
    Improved C-Space Exploration and Path Planning for Robotic Manipulators Using Distance Information
    • 2
    Robotic path planning using rapidly-exploring random trees
    • 1
    • PDF
    Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning
    Sampling-based Motion Planning: Analysis and Path Quality
    • 37
    • PDF
    Single-Query Motion Planning with Utility-Guided Random Trees
    • B. Burns, O. Brock
    • Mathematics, Computer Science
    • Proceedings 2007 IEEE International Conference on Robotics and Automation
    • 2007
    • 66
    • PDF

    References

    SHOWING 1-10 OF 33 REFERENCES
    Randomized preprocessing of configuration for fast path planning
    • L. Kavraki, J. Latombe
    • Computer Science
    • Proceedings of the 1994 IEEE International Conference on Robotics and Automation
    • 1994
    • 446
    • PDF
    Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • 1,685
    • Highly Influential
    • PDF
    A randomized roadmap method for path and manipulation planning
    • N. Amato, Yan Wu
    • Engineering, Computer Science
    • Proceedings of IEEE International Conference on Robotics and Automation
    • 1996
    • 380
    • PDF
    Motion planning with many degrees of freedom-random reflections at C-space obstacles
    • T. Horsch, F. Schwarz, H. Tolle
    • Mathematics, Computer Science
    • Proceedings of the 1994 IEEE International Conference on Robotics and Automation
    • 1994
    • 101
    The complexity of robot motion planning
    • 1,574
    The Ariadne's Clew Algorithm
    • 160
    • PDF
    Path Planning in Expansive Configuration Spaces
    • 354
    Parallel robot motion planning
    • 79
    • PDF
    Planning motions with intentions
    • 340
    • PDF