Reachability-guided sampling for planning under differential constraints
- 1 May 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 2859-2865
- https://doi.org/10.1109/robot.2009.5152874
Abstract
Rapidly-exploring random trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency of these algorithms can be severely compromised in the presence of certain kinodynamics constraints. Obstacle fields with tunnels, or tubes are notoriously difficult, as are systems with differential constraints, because the tree grows inefficiently at the boundaries. Here we present a new sampling strategy for the RRT algorithm, based on an estimated feasibility set, which affords a dramatic improvement in performance in these severely constrained systems. We demonstrate the algorithm with a detailed look at the expansion of an RRT in a swing up task, and on path planning for a nonholonomic car.Keywords
This publication has 7 references indexed in Scilit:
- Planning AlgorithmsPublished by Cambridge University Press (CUP) ,2006
- An RRT-Based Algorithm for Testing and Validating Multi-Robot ControllersPublished by Robotics: Science and Systems Foundation ,2005
- Sampling-based planning for discrete spacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Swing up control of the AcrobotPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Swing up control of inverted pendulumPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- RRT-connect: An efficient approach to single-query path planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Real-Time Motion Planning for Agile Autonomous VehiclesJournal of Guidance, Control, and Dynamics, 2002