Learning Sampling Distributions for Robot Motion Planning
Preprint
Abstract
A defining feature of sampling-based motion planning is the reliance on an implicit representation of the state space, which is enabled by a set of probing samples. Traditionally, these samples are drawn either probabilistically or deterministically to uniformly cover the state space. Yet, the motion of many robotic systems is often restricted to "small" regions of the state space, due to, for example, differential constraints or collision-avoidance constraints. To accelerate the planning process, it is thus desirable to devise non-uniform sampling strategies that favor sampling in those regions where an optimal solution might lie. This paper proposes a methodology for non-uniform sampling, whereby a sampling distribution is learned from demonstrations, and then used to bias sampling. The sampling distribution is computed through a conditional variational autoencoder, allowing sample generation from the latent space conditioned on the specific planning problem. This methodology is general, can be used in combination with any sampling-based planner, and can effectively exploit the underlying structure of a planning problem while maintaining the theoretical guarantees of sampling-based approaches. Specifically, on several planning problems, the proposed methodology is shown to effectively learn representations for the relevant regions of the state space, resulting in an order of magnitude improvement in terms of success rate and convergence to the optimal cost.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Generalizing Informed Sampling for Asymptotically-Optimal Sampling-Based Kinodynamic Planning via Markov Chain Monte Carlo2018
- Regionally accelerated batch informed trees (RABIT*): A framework to integrate local information into optimal path planning2016
- Hierarchical rejection sampling for informed kinodynamic planning in high-dimensional spaces2016
- Optimal sampling-based motion planning under differential constraints: The driftless case2015
- Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs2015
- Semantic mapping for mobile robotics tasks: A surveyRobotics and Autonomous Systems, 2015
- A robot path planning framework that learns from experience2012
- Learning approximate cost-to-go metrics to improve sampling-based motion planning2011
- Anytime Motion Planning using the RRT*2011
- Adaptive sampling for generalized sampling based motion planners2010