Using Local Experiences for Global Motion Planning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 1; 2024: 1.
8 papers.
- 2021Self-Imitation Learning by Planningcited by 25
- 2022A Survey on the Integration of Machine Learning with Sampling-based Motion Planningcited by 6
- 2021PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithmscited by 5
- 2021Waypoint Planning Networkscited by 4
- 2023Reinforcement Learning in Robotic Motion Planning by Combined Experience-based Planning and Self-Imitation Learningcited by 4
- 2022Leveraging Experience in Lifelong Multi-Agent Pathfindingcited by 3
- 2024CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planningcited by 1
- 2022Systematic Comparison of Path Planning Algorithms using PathBenchcited by 0
- 2024CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning5 May 2024
- 2023Reinforcement Learning in Robotic Motion Planning by Combined Experience-based Planning and Self-Imitation Learning11 Jun 2023
- 2022A Survey on the Integration of Machine Learning with Sampling-based Motion Planning15 Nov 2022
- 2022Systematic Comparison of Path Planning Algorithms using PathBench7 Mar 2022
- 2022Leveraging Experience in Lifelong Multi-Agent Pathfinding9 Feb 2022
- 2021PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithms4 May 2021
- 2021Waypoint Planning Networks1 May 2021
- 2021Self-Imitation Learning by Planning25 Mar 2021