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

@article{Kuffner2000RRTconnectAE,
  title={RRT-connect: An efficient approach to single-query path planning},
  author={James J. Kuffner and Steven M. 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}
}
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

Citations

Publications citing this paper.
SHOWING 1-10 OF 1,639 CITATIONS

Continuous-time Gaussian process motion planning via probabilistic inference

VIEW 11 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FaSTrack: A modular framework for fast and guaranteed safe motion planning

VIEW 13 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Heuristically initialized motion planning in a low cost consumer robot

VIEW 9 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Performance study of single-query motion planning for grasp execution using various manipulators

VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Unobservable Monte Carlo planning for nonprehensile rearrangement tasks

VIEW 9 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Scaling sampling-based motion planning to humanoid robots

VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A hierarchical and adaptive mobile manipulator planner with base pose uncertainty

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1999
2020

CITATION STATISTICS

  • 234 Highly Influenced Citations

  • Averaged 164 Citations per year from 2017 through 2019

  • 1% Increase in citations per year in 2019 over 2018

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Randomized pre - processing of configuration space for fast path planning

  • J. Kuffner, J.-C. Latombe
  • 1993

Randomized kin - odynamic planning Efficient algorithms for incremental distance computation

  • J. M. Ahuactzin E. Mazer, P. Bessikre
  • 1991

Complexity of the mover ’ s problem and generalizations

  • M. Sharir
  • 1979