Adaptive Workspace Biasing for Sampling Based Planners - Robotics Institute Carnegie Mellon University

Adaptive Workspace Biasing for Sampling Based Planners

Conference Paper, Proceedings of (ICRA) International Conference on Robotics and Automation, pp. 3757 - 3762, May, 2008

Abstract

The widespread success of sampling-based planning algorithms stems from their ability to rapidly discover the connectivity of a configuration space. Past research has found that non-uniform sampling in the configuration space can significantly outperform uniform sampling; one important strategy is to bias the sampling distribution based on features present in the underlying workspace. In this paper, we unite several previous approaches to workspace biasing into a general framework for automatically discovering useful sampling distributions. We present a novel algorithm, based on the REINFORCE family of stochastic policy gradient algorithms, which automatically discovers a locally-optimal weighting of workspace features to produce a distribution which performs well for a given class of sampling-based motion planning queries. We present as well a novel set of workspace features that our adaptive algorithm can leverage for improved configuration space sampling. Experimental results show our algorithm to be effective across a variety of robotic platforms and high-dimensional configuration spaces.

BibTeX

@conference{Zucker-2008-9935,
author = {Matthew Zucker and James Kuffner and J. Andrew (Drew) Bagnell},
title = {Adaptive Workspace Biasing for Sampling Based Planners},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {2008},
month = {May},
pages = {3757 - 3762},
keywords = {Motion and Path Planning, Learning and Adaptive Systems, Nonholonomic Motion Planning},
}