Rapidly-Exploring Random Trees: Progress and Prospects (2000)

by Steven M. Lavalle , James J. Kuffner , Jr.
Venue:Algorithmic and Computational Robotics: New Directions
Citations:233 - 25 self

Active Bibliography

Sampling and Searching Methods for Practical Motion PLANNING ALGORITHMS – - 2008
14 From dynamic programming to RRTs: Algorithmic design of feasible trajectories – - 2002
19 RRT-Connect: An efficient approach to single-query path planning – - 2000
6 Using Randomization to Find and Optimize Feasible Trajectories for Nonlinear Systems – - 2000
41 Dynamically-stable Motion Planning for Humanoid Robots – - 2000
Collaborative Research: Geometric and Algorithmic Techniques for Design and Verification of Hybrid Control Systems
13 Robot motion planning: A game-theoretic foundation – - 1996
191 Randomized Kinodynamic Motion Planning with Moving Obstacles – - 2000
18 Sampling-Based Motion Planning with Differential Constraints – - 2005
14 A framework for planning feedback motion strategies based on a random neighborhood graph – - 2000
17 Nonlinear and Hybrid Control Via RRTs – - 2002
86 Choosing Good Distance Metrics and Local Planners for Probabilistic Roadmap Methods – - 1998
57 Motion planning: A journey of robots, molecules, digital actors, and other artifacts – - 1999
66 On Delaying Collision Checking in PRM Planning -- Application To Multi-Robot Coordination – - 2002
3 DIFFERENTIALLY CONSTRAINED MOTION PLANNING WITH STATE LATTICE MOTION PRIMITIVES – - 2012
SMOOTH FEEDBACK PLANNING – - 2008
8 Exploiting group symmetries to improve precision in kinodynamic and nonholonomic planning – - 2003
4 Robotics – - 1997
9 Deterministic vs. Probabilistic Roadmaps – - 2002