Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain

@article{Yershova2005DynamicDomainRE,
  title={Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain},
  author={A. Yershova and L. Jaillet and T. Sim{\'e}on and S. LaValle},
  journal={Proceedings of the 2005 IEEE International Conference on Robotics and Automation},
  year={2005},
  pages={3856-3861}
}
  • A. Yershova, L. Jaillet, +1 author S. LaValle
  • Published 2005
  • Computer Science
  • Proceedings of the 2005 IEEE International Conference on Robotics and Automation
  • Sampling-based planners have solved difficult problems in many applications of motion planning in recent years. In particular, techniques based on the Rapidly-exploring Random Trees (RRTs) have generated highly successful single-query planners. Even though RRTs work well on many problems, they have weaknesses which cause them to explore slowly when the sampling domain is not well adapted to the problem. In this paper we characterize these issues and propose a general framework for minimizing… CONTINUE READING
    253 Citations

    Figures and Topics from this paper

    Adaptive tuning of the sampling domain for dynamic-domain RRTs
    • 122
    • PDF
    Learning Implicit Sampling Distributions for Motion Planning
    • C. Zhang, Jinwook Huh, D. Lee
    • Computer Science, Engineering
    • 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
    • 2018
    • 22
    • PDF
    Sampling heuristics for optimal motion planning in high dimensions
    • Baris Akgün, M. Stilman
    • Computer Science
    • 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
    • 2011
    • 122
    • PDF
    Costmap planning in high dimensional configuration spaces
    • 10
    • 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
    Learned Sampling Distributions for Efficient Planning in Hybrid Geometric and Object-Level Representations
    • 1
    • PDF
    Toward Optimal Configuration Space Sampling
    • 124
    • PDF
    Sampling-based algorithms for optimal path planning problems
    • 4
    • PDF
    Balancing Exploration and Exploitation in Sampling-Based Motion Planning
    • 54
    • PDF

    References

    SHOWING 1-10 OF 75 REFERENCES
    A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
    • 323
    • PDF
    RRT-connect: An efficient approach to single-query path planning
    • J. Kuffner, S. LaValle
    • Computer Science
    • Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
    • 2000
    • 2,423
    • PDF
    A framework for using the workspace medial axis in PRM planners
    • Christopher Holleman, L. Kavraki
    • Computer Science, Mathematics
    • Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
    • 2000
    • 156
    • PDF
    The Gaussian sampling strategy for probabilistic roadmap planners
    • V. Boor, M. Overmars, A. Stappen
    • Computer Science
    • Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C)
    • 1999
    • 568
    • PDF
    MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space
    • 368
    • PDF
    Motion planning a aerial robot using rapidly-exploring random trees with dynamic constraints
    • J. Kim, J. Ostrowski
    • Engineering, Computer Science
    • 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
    • 2003
    • 93
    Incrementally reducing dispersion by increasing Voronoi bias in RRTs
    • S. Lindemann, S. LaValle
    • Mathematics, Computer Science
    • IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004
    • 2004
    • 110
    • PDF
    Kinodynamic motion planning: connecting exploration trees using trajectory optimization Methods
    • F. Lamiraux, E. Ferre, Erwan Vallee
    • Mathematics, Computer Science
    • IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004
    • 2004
    • 58
    • PDF
    Manipulation Planning with Probabilistic Roadmaps
    • 263
    • PDF
    Path planning using lazy PRM
    • R. Bohlin, L. Kavraki
    • Computer Science
    • Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
    • 2000
    • 733
    • PDF