Title :
Adaptive workspace biasing for sampling-based planners
Author :
Zucker, Matt ; Kuffner, James ; Bagnell, J. Andrew
Author_Institution :
Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA
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.
Keywords :
gradient methods; learning (artificial intelligence); mobile robots; path planning; sampling methods; statistical distributions; stochastic processes; adaptive workspace biasing; machine learning; mobile robot; motion planning; sampling distribution; stochastic policy gradient algorithm; Adaptive algorithm; Machine learning; Motion planning; Orbital robotics; Probability distribution; Robotics and automation; Sampling methods; Stochastic processes; Strategic planning; USA Councils;
Conference_Titel :
Robotics and Automation, 2008. ICRA 2008. IEEE International Conference on
Conference_Location :
Pasadena, CA
Print_ISBN :
978-1-4244-1646-2
Electronic_ISBN :
1050-4729
DOI :
10.1109/ROBOT.2008.4543787