This work proposes Function-Space Diffusion for Motion Planning (FSD-MP), a diffusion-based motion planner that models trajectories as continuous functions and performs diffusion directly in function space, achieving discretization-invariant trajectory generation.
Abstract
Diffusion-based motion planners have demonstrated strong performance in generating diverse and high-quality robot trajectories in cluttered environments with multiple feasible solutions. However, existing approaches typically operate on fixed-length waypoint sequences, making the learned model resolution-dependent, thereby preventing zero-shot generalization across resolutions. In this work, we propose Function-Space Diffusion for Motion Planning (FSD-MP), a diffusion-based motion planner that models trajectories as continuous functions and performs diffusion directly in function space, achieving discretization-invariant trajectory generation. We define a mode-wise forward process in the spectral domain, driven by Gaussian noise with a Mat\'ern-type covariance, and parameterize the reverse process with a boundary-compatible Discrete Sine Transform-based Fourier Neural Operator (DST-FNO) that preserves start-goal constraints across resolutions. We evaluate FSD-MP on 2D point robot and 7-DoF Franka manipulator planning benchmarks. Our method achieves competitive planning performance at the training resolution and generalizes zero-shot across resolutions up to 16$\times$ higher, preserving consistent planning behavior without retraining. These results demonstrate that function-space diffusion provides an effective framework for discretization-invariant motion planning.
This work introduces Model-Based Diffusion Optimal Control (MDOC), a model-based diffusion planner that efficiently produces dynamically feasible trajectories without relying on data, and shows that MDOC's safety mechanism naturally scales to multi-robot planning settings through Conflict-Based Search.
Spectral-linear representation is introduced as a compact joint-space representation that combines an endpoint-conditioned linear reference path with a small set of globally supported eigenmodes derived from a conditioned temporal kernel that is more predictive of bottleneck success than latent width alone.
Zongjian Chen, Zichao Zou, Rongqian Yang et al.· Machines· 0 citations
This work introduces Model-Based Diffusion via Constraint Optimization and Adaptive Scheduling (MD-COAS) for SRMP that unifies the inexact Augmented Lagrangian Method (iALM) soft diffusion prior with a Convex Feasible Set (CFS)-based hard projection operator, and adaptively schedules and co-optimizes safety enforcement...
This work replaces the costly convex relaxation step required by nominal GCS with a single forward pass through a Graph Attention Network that predicts a set of highly probable candidate paths through the graph, and generates a lightweight ranking network that orders these candidates by their estimated trajectory cost.
Ananya Trivedi, Sarvesh Prajapati, M. K. M. Jaffar et al.· 0 citations
This research proposes a constrained motion planning framework for robot manipulators in human-robot interaction (HRI). For a non-redundant manipulator with a fully specified end-effector pose, additional requirements such as collision avoidance and self-collision avoidance are difficult to handle as simple null-space...
Byeong-Il Ham, Hyunbin Kim, Kyung-Soo Kim· 0 citations
The deployment of Artificial Intelligence (AI)-based autonomous mobile robots in high-stakes environments, such as defense swarms and large-scale warehouse logistics, demands path planners that are not only theoretically optimal but scalable. While traditional search-based methods like A* guarantee resolution optimalit...