Adapting RRT growth for heterogeneous environments

Jory Denny, Marco Morales, Samuel Rodriguez, Nancy M. Amato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

Abstract

Rapidly-exploring Random Trees (RRTs) are effective for a wide range of applications ranging from kinodynamic planning to motion planning under uncertainty. However, RRTs are not as efficient when exploring heterogeneous environments and do not adapt to the space. For example, in difficult areas an expensive RRT growth method might be appropriate, while in open areas inexpensive growth methods should be chosen. In this paper, we present a novel algorithm, Adaptive RRT, that adapts RRT growth to the current exploration area using a two level growth selection mechanism. At the first level, we select groups of expansion methods according to the visibility of the node being expanded. Second, we use a cost-sensitive learning approach to select a sampler from the group of expansion methods chosen. Also, we propose a novel definition of visibility for RRT nodes which can be computed in an online manner and used by Adaptive RRT to select an appropriate expansion method. We present the algorithm and experimental analysis on a broad range of problems showing not only its adaptability, but efficiency gains achieved by adapting exploration methods appropriately. © 2013 IEEE.
Original languageEnglish (US)
Title of host publication2013 IEEE/RSJ International Conference on Intelligent Robots and Systems
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1772-1778
Number of pages7
ISBN (Print)9781467363587
DOIs
StatePublished - Nov 2013
Externally publishedYes

Fingerprint

Dive into the research topics of 'Adapting RRT growth for heterogeneous environments'. Together they form a unique fingerprint.

Cite this