Motion Planning Diffusion: Learning and Adapting Robot Motion Planning with Diffusion Models
J. Carvalho, A. Le, P. Kicki, D. Koert, J. Peters

TL;DR
This paper introduces Motion Planning Diffusion (MPD), a novel approach that leverages diffusion models to learn and adapt trajectory priors for robot motion planning, improving efficiency and smoothness in complex scenarios.
Contribution
The work presents a diffusion-based method for learning trajectory priors using low-dimensional B-spline representations, enabling more efficient and smooth robot motion planning.
Findings
Effective in 2D and complex 7-DOF tasks
Utilizes human demonstrations for real-world adaptation
Produces smooth, high-frequency interpolated trajectories
Abstract
The performance of optimization-based robot motion planning algorithms is highly dependent on the initial solutions, commonly obtained by running a sampling-based planner to obtain a collision-free path. However, these methods can be slow in high-dimensional and complex scenes and produce non-smooth solutions. Given previously solved path-planning problems, it is highly desirable to learn their distribution and use it as a prior for new similar problems. Several works propose utilizing this prior to bootstrap the motion planning problem, either by sampling initial solutions from it, or using its distribution in a maximum-a-posterior formulation for trajectory optimization. In this work, we introduce Motion Planning Diffusion (MPD), an algorithm that learns trajectory distribution priors with diffusion models. These generative models have shown increasing success in encoding multimodal…
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
Taxonomy
TopicsRobotic Mechanisms and Dynamics · Robot Manipulation and Learning · Robotic Path Planning Algorithms
