Experience-Based Planning with Sparse Roadmap Spanners
Not on the map. Why?
Abstract (arXiv)
We present an experienced-based planning framework called Thunder that learns to reduce computation time required to solve high-dimensional planning problems in varying environments. The approach is especially suited for large configuration spaces that include many invariant constraints, such as those found with whole body humanoid motion planning. Experiences are generated using probabilistic sampling and stored in a sparse roadmap spanner (SPARS), which provides asymptotically near-optimal coverage of the configuration space, making storing, retrieving, and repairing past experiences very efficient with respect to memory and time. The Thunder framework improves upon past experience-based planners by storing experiences in a graph rather than in individual paths, eliminating redundant information, providing more opportunities for path reuse, and providing a theoretical limit to the size of the experience graph. These properties also lead to improved handling of dynamically changing environments, reasoning about optimal paths, and reducing query resolution time. The approach is demonstrated on a 30 degrees of freedom humanoid robot and compared with the Lightning framework, an experience-based planner that uses individual paths to store past experiences. In environments with variable obstacles and stability constraints, experiments show that Thunder is on average an order of magnitude faster than Lightning and planning from scratch. Thunder also uses 98.8% less memory to store its experiences after 10,000 trials when compared to Lightning. Our framework is implemented and freely available in the Open Motion Planning Library.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Oct 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 4; 2023: 2; 2024: 3; 2025: 1.
10 papers.
- 2022Accelerating Integrated Task and Motion Planning with Neural Feasibility Checkingcited by 10
- 2022A Survey on the Integration of Machine Learning with Sampling-based Motion Planningcited by 6
- 2023Reinforcement Learning in Robotic Motion Planning by Combined Experience-based Planning and Self-Imitation Learningcited by 4
- 2023Constant-time Motion Planning with Anytime Refinement for Manipulationcited by 4
- 2022Leveraging Experience in Lifelong Multi-Agent Pathfindingcited by 3
- 2022L4KDE: Learning for KinoDynamic Tree Expansioncited by 2
- 2024A Framework for Guided Motion Planningcited by 1
- 2024CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planningcited by 1
- 2024BOMP: Bin-Optimized Motion Planningcited by 1
- 2025Path Database Guidance for Motion Planningcited by 0
- 2025Path Database Guidance for Motion Planning7 Apr 2025
- 2024BOMP: Bin-Optimized Motion Planning31 Oct 2024
- 2024CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning5 May 2024
- 2024A Framework for Guided Motion Planning4 Apr 2024
- 2023Constant-time Motion Planning with Anytime Refinement for Manipulation1 Nov 2023
- 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
- 2022Accelerating Integrated Task and Motion Planning with Neural Feasibility Checking20 Mar 2022
- 2022L4KDE: Learning for KinoDynamic Tree Expansion2 Mar 2022
- 2022Leveraging Experience in Lifelong Multi-Agent Pathfinding9 Feb 2022