Trajectory Planning without Trajectory Data: A Manifold-Guided Approach
cs.RO
Submitted: 2026-10-05
Updated: 2026-10-05
Comments: Accepted at NeurIPS 2026. Code can be found in https://github.com/SilongYong/Ariadne/
Code: https://github.com/SilongYong/Ariadne
License: http://creativecommons.org/licenses/by/4.0/
The gist: A common way for trajectory planning is to leverage generative models trained on large collections of expert trajectories.
Abstract
A common way for trajectory planning is to leverage generative models trained on large collections of expert trajectories. At inference time, the model generates executable trajectories by conditioning on task goal constraints. However, trajectory-based methods rely on costly supervision, scale poorly with sequence length, and often generalize poorly to unseen constraints such as novel start-goal pairs. We propose an alternative to learn the underlying state-space manifold and use the geometry of the manifold for trajectory planning. This approach requires only state observations and enables generalization to unseen constraints by con- structing trajectories on the learned manifold of the state space. Experiments on Maze2D and robotic motion-planning benchmarks show that Ariadne constructs feasible paths from state-only supervision and generalizes to unseen start-goal combinations. On high-dimensional dual-arm planning, it remains competitive with trajectory-supervised and classical planners, while requiring no trajectory data for training.
Sources
- GPT-4 Technical Report
- Follow the Energy, Find the Path: Riemannian Metrics from Energy-Based Models
- Flow Matching on General Geometries
- CFG++: Manifold-constrained Classifier Free Guidance for Diffusion Models
- Neural MP: A Generalist Neural Motion Planner
- Manifold Preserving Guided Diffusion
- Planning with Diffusion for Flexible Behavior Synthesis
- Generative Trajectory Stitching through Diffusion Composition
- Potential Based Diffusion Motion Planning
- Probing the Geometry of Diffusion Models with the String Method
- Score-Based Generative Modeling through Stochastic Differential Equations
Related papers
- FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
- MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
- RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
- ARC: A Reasoning Recipe for Robot Foundation Models
- HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
- APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies