ICRA'09 Paper Abstract


Paper FrD4.4

Shkolnik, Alexander (MIT), Walter, Matthew (MIT), Tedrake, Russ (Massachusetts Institute of Technology)

Reachability-Guided Sampling for Planning under Differential Constraints

Scheduled for presentation during the Regular Sessions "Motion and Path Planning - IV" (FrD4), Friday, May 15, 2009, 16:30−16:50, Room: 402

2009 IEEE International Conference on Robotics and Automation, May 12 - 17, 2009, Kobe, Japan

This information is tentative and subject to change. Compiled on January 24, 2022

Keywords Nonholonomic Motion Planning, Motion and Path Planning


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.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2022 PaperCept, Inc.
Page generated 2022-01-24  05:52:02 PST  Terms of use