Reachability-guided sampling for planning under differential constraints

Authors:
Alexander Shkolnik;Matthew Walter;Russ Tedrake
Affiliations:
Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA;Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA;Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA
Venue:
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Year:
2009

Citing 3
Cited 3

Sampling-based motion planning with differential constraints

Sampling-based motion planning with differential constraints
Planning Algorithms

Planning Algorithms
Toward more efficient motion planning with differential constraints

Toward more efficient motion planning with differential constraints

Motion planning with dynamics by a synergistic combination of layers of planning

IEEE Transactions on Robotics
Bounding on rough terrain with the LittleDog robot

International Journal of Robotics Research
Goal-oriented stimulus generation for analog circuits

Proceedings of the 49th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

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 swingup task, and on path planning for a nonholonomic car.