By Topic

A Sampling-Based Tree Planner for Systems With Complex Dynamics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ioan A. ┼×ucan ; Department of Computer Science , Rice University, Houston, USA ; Lydia E. Kavraki

This paper presents a kinodynamic motion planner, i.e., Kinodynamic Motion Planning by Interior-Exterior Cell Exploration (KPIECE), which is specifically designed for systems with complex dynamics, where integration backward in time is not possible, and speed of computation is important. A grid-based discretization is used to estimate the coverage of the state space. The coverage estimates help the planner detect the less-explored areas of the state space. An important characteristic of this discretization is that it keeps track of the boundary of the explored region of the state space and focuses exploration on the less covered parts of this boundary. Extensive experiments show that KPIECE provides significant computational gain over existing state-of-the-art methods and allows us to solve some harder, previously unsolvable problems. For some problems, KPIECE is shown to be up to two orders of magnitude faster than existing methods and use up to 40 times less memory. A shared memory parallel implementation is presented as well. This implementation provides better speedup than an embarrassingly parallel implementation by taking advantage of the evolving multicore technology.

Published in:

IEEE Transactions on Robotics  (Volume:28 ,  Issue: 1 )