A Survey on the Integration of Machine Learning with Sampling-based Motion Planning
Troy McMahon, Aravind Sivaramakrishnan, Edgar Granados, Kostas E., Bekris

TL;DR
This survey reviews how machine learning techniques are integrated into sampling-based motion planning to improve efficiency, adaptability, and performance, highlighting various approaches, their advantages, limitations, and future research directions.
Contribution
It provides a comprehensive classification and analysis of machine learning applications in sampling-based motion planning, covering key components, adaptive strategies, and complete ML pipelines.
Findings
Learning improves sampling efficiency and collision detection.
Adaptive methods select optimal primitives based on problem features.
ML-based models enhance robot simulation and planning accuracy.
Abstract
Sampling-based methods are widely adopted solutions for robot motion planning. The methods are straightforward to implement, effective in practice for many robotic systems. It is often possible to prove that they have desirable properties, such as probabilistic completeness and asymptotic optimality. Nevertheless, they still face challenges as the complexity of the underlying planning problem increases, especially under tight computation time constraints, which impact the quality of returned solutions or given inaccurate models. This has motivated machine learning to improve the computational efficiency and applicability of Sampling-Based Motion Planners (SBMPs). This survey reviews such integrative efforts and aims to provide a classification of the alternative directions that have been explored in the literature. It first discusses how learning has been used to enhance key components…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
