Incrementally reducing dispersion by increasing voronoi bias in RRTs

Stephen R. Lindemann, Steven M. La Valle

Research output: Contribution to journalConference article

Abstract

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 (heir 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.

Original languageEnglish (US)
Pages (from-to)3251-3257
Number of pages7
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume2004
Issue number4
DOIs
StatePublished - 2004
EventProceedings- 2004 IEEE International Conference on Robotics and Automation - New Orleans, LA, United States
Duration: Apr 26 2004May 1 2004

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Incrementally reducing dispersion by increasing voronoi bias in RRTs'. Together they form a unique fingerprint.

  • Cite this