Using Local Experiences for Global Motion Planning
arXiv:1903.08693 · doi:10.1109/ICRA.2019.8794317
Abstract
Sampling-based planners are effective in many real-world applications such as robotics manipulation, navigation, and even protein modeling. However, it is often challenging to generate a collision-free path in environments where key areas are hard to sample. In the absence of any prior information, sampling-based planners are forced to explore uniformly or heuristically, which can lead to degraded performance. One way to improve performance is to use prior knowledge of environments to adapt the sampling strategy to the problem at hand. In this work, we decompose the workspace into local primitives, memorizing local experiences by these primitives in the form of local samplers, and store them in a database. We synthesize an efficient global sampler by retrieving local experiences relevant to the given situation. Our method transfers knowledge effectively between diverse environments that share local primitives and speeds up the performance dramatically. Our results show, in terms of solution time, an improvement of multiple orders of magnitude in two traditionally challenging high-dimensional problems compared to state-of-the-art approaches.
6 pages, to appear in International Conference on Robotics and Automation (ICRA), 2019
Cited by in corpus (13)
- Path Planning for Manipulation using Experience-driven Random Trees
- A Survey on the Integration of Machine Learning with Sampling-based Motion Planning
- Speeding Up Optimization-based Motion Planning through Deep Learning
- Motion Memory: Leveraging Past Experiences to Accelerate Future Motion Planning
- Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning
- cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope
- PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithms
- Learning Sampling Distributions Using Local 3D Workspace Decompositions for Motion Planning in High Dimensions
- Self-Imitation Learning by Planning
- CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning
- Waypoint Planning Networks
- Exploring How Non-Prehensile Manipulation Expands Capability in Robots Experiencing Multi-Joint Failure
- Designing Human-Robot Coexistence Space