By Topic

Incrementally reducing dispersion by increasing Voronoi bias in RRTs

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
$31 $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)
Lindemann, S.R. ; Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA ; LaValle, S.M.

We discuss theoretical and practical issues related to using Rapidly-Exploring Random Trees (RRTs) to incrementally reduce dispersion in the configuration space. The original RRT planners use randomization to create Voronoi bias, which causes the search trees to rapidly explore the state space. We introduce RRT-like planners based on exact Voronoi diagram computation, as well as sampling-based algorithms which approximate their behavior. We give experimental results illustrating how the new algorithms explore the configuration space and how they compare with existing RRT algorithms. Initial results show that our algorithms are advantageous compared to existing RRTs, especially with respect to the number of collision checks and nodes in the search tree.

Published in:

Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 IEEE International Conference on  (Volume:4 )

Date of Conference:

April 26-May 1, 2004