GPD: Guided Polynomial Diffusion for Motion Planning

Diffusion-based motion planners are becoming popular due to their well-established performance improvements, stemming from sample diversity and the ease of incorporating new constraints directly during inference. However, a primary limitation of the diffusion process is the requirement for a substantial number of denoising steps, especially when the denoising process is coupled with gradient-based guidance. In this paper, we introduce, diffusion in the parametric space of trajectories, where the parameters are represented as Bernstein coefficients. We show that this representation greatly improves the effectiveness of the cost-function guidance and the inference speed. We also introduce a novel stitching algorithm that leverages the diversity in diffusion-generated trajectories to produce collision-free trajectories with just a single cost function-guided model. We demonstrate that our approaches outperform current SOTA diffusion-based motion planners for manipulators and provide an ablation study on key components.

Authors

Institutions

Publication Details

Published
2025-08-17
DOI
https://doi.org/10.1109/case58245.2025.11163733
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GPD: Guided Polynomial Diffusion for Motion Planning

Vishal Mandadi, Kallol Saha, Ajit Srikanth, Parth Mahajan et al.
Robotic Path Planning Algorithms
article

GPD: Guided Polynomial Diffusion for Motion Planning

Vishal Mandadi, Kallol Saha, Ajit Srikanth, Parth Mahajan, Brojeshwar Bhowmick, Arun Kumar Singh, Pranjal Paul, Madhava Krishna, Pawan Wadhwani
article en

Abstract

Diffusion-based motion planners are becoming popular due to their well-established performance improvements, stemming from sample diversity and the ease of incorporating new constraints directly during inference. However, a primary limitation of the diffusion process is the requirement for a substantial number of denoising steps, especially when the denoising process is coupled with gradient-based guidance. In this paper, we introduce, diffusion in the parametric space of trajectories, where the parameters are represented as Bernstein coefficients. We show that this representation greatly improves the effectiveness of the cost-function guidance and the inference speed. We also introduce a novel stitching algorithm that leverages the diversity in diffusion-generated trajectories to produce collision-free trajectories with just a single cost function-guided model. We demonstrate that our approaches outperform current SOTA diffusion-based motion planners for manipulators and provide an ablation study on key components.

Tennessee Cancer Specialists (US), Robotic Research (United States) (US), University of Tartu (EE), Indian Institute of Technology Hyderabad (IN)
Openalex Percentile: Top 74%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

GPD: Guided Polynomial Diffusion for Motion Planning — Vishal Mandadi, Kallol Saha, et al. · (2025) | TGRS Research Map | TGRS