arXiv Machine Learning By Qian Zhang, Shanqing Liu, Jerome Darbon, George Karniadakis

A Transformer-based Approach for Real-time Multi-agent Path Planning with Varying Initial/Final Conditions

Read the original on arXiv Machine Learning →

The paper introduces OCFormer, a transformer-based neural network for real‑time multi‑agent path planning. It maps a simple latent space where agents evolve independently to the physical space of interacting agents, using a physics‑informed loss that incorporates the Hamiltonian ODE residual and boundary matching. Trained on a distribution of boundary conditions, OCFormer produces near‑optimal trajectories for unseen configurations in about 220 ms and can be adapted to out‑of‑distribution scenarios via lightweight transfer learning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 3

Training-Free Diffusion Planning with Analytical Local Scores

The paper presents a training-free diffusion-based motion planner that replaces learned global trajectory scores with analytical local scores derived from obstacle, smoothness, velocity, and inter-agent feasibility terms. By reconstructing trajectory scores through local interactions between neighboring waypoints and nearby constraints, the method decomposes the denoising process while preserving the optimization structure of classical trajectory methods. Experiments demonstrate that this approach generates smooth, feasible trajectories for large multi-agent tasks in complex environments quickly, outperforming learning-based and optimization baselines without requiring training data.

By Michael Y. Fatemi, Jinhao Liang, Ferdinando Fioretto
arXiv AI
Oct 31

AegisFlow: Training-Free Non-Myopic Path-Safe Guided Flow Matching

AegisFlow is a training‑free framework that guides generative models, such as diffusion and flow matching, along safe paths by formulating the problem as a global optimal control task. It incorporates a time‑varying barrier function into the cost functional, enabling non‑myopic enforcement of constraints throughout the entire generative trajectory. Experiments show that AegisFlow outperforms existing methods in text‑guided image manipulation and robotic planning, achieving a better balance between target alignment and constraint satisfaction.

By Kunpeng Liu, Boshi Zhang, Keyou You
arXiv Machine Learning
Jul 1

Flow-Opt: Scalable Centralized Multi-Robot Trajectory Optimization with Flow Matching and Differentiable Optimization

arXiv:2510. 09204v4 Announce Type: replace-cross Abstract: Centralized trajectory optimization in the joint space of multiple robots allows access to a larger feasible space that can result in smoother trajectories, especially while planning in tight spaces.

By Simon Idoko, Prajyot Jadhav, Arun Kumar Singh
arXiv AI
Oct 12

UniConFlow: A Unified Constrained Flow-Matching Framework for Certified Motion Planning

UniConFlow is a unified constrained flow‑matching framework that generates robot trajectories while systematically handling both equality and inequality constraints such as collision avoidance, actuation limits, and dynamic consistency. It introduces a prescribed‑time zeroing function to shape a time‑varying guidance field during inference, and employs a violation‑segment extraction protocol and trajectory compression to address computational challenges in long‑horizon, high‑dimensional planning. Experiments on a double inverted pendulum, a real‑to‑sim car racing task, and a sim‑to‑real manipulation task show that UniConFlow outperforms state‑of‑the‑art generative planners and conventional optimization baselines on certified motion planning metrics like safety, kinodynamic consistency, and action feasibility.

By Zewen Yang, Xiaobing Dai, Dian Yu, Zhijun Li, Majid Khadiv, Sandra Hirche, Sami Haddadin