arXiv AI By Kiran Ravish, Ankita Kushwaha, Preeti, Pawan Kumar

MA-SafeDiffuser: Safe Multi-Agent Planning with Diffusion Probabilistic Models

Read the original on arXiv AI →

MA‑SafeDiffuser is a multi‑agent extension of SafeDiffuser that incorporates diffusion‑based trajectory planners with finite‑time diffusion invariance guarantees for joint‑agent safety specifications. It formalizes joint safe sets as intersections of per‑agent and pairwise barrier sets, and derives both centralized and decentralized constrained denoising procedures that maintain invariance under mild assumptions. The approach also tackles local‑trap and deadlock issues using time‑varying specifications and liveness CBFs, and introduces a lightweight benchmarking suite including a multi‑agent Maze2D domain, showing reduced violation counts compared to unconstrained diffusion baselines while preserving planning quality.

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 AI.

arXiv AI
Oct 9

BridgeGuard: Explicit Safety Drift for Diffusion-based Autonomous Driving

BridgeGuard is a safety‑constrained diffusion planning method for autonomous driving that progressively strengthens a constraint term during denoising, guiding intermediate trajectories toward a scene‑dependent safety domain. It operates in a low‑dimensional curve space and uses a learned DistanceFieldNet to predict a time‑dependent distance field from bird’s‑eye‑view features, providing safety injection while keeping the perception backbone and planner frozen. Experiments on Bench2Drive show that BridgeGuard improves driving scores and success rates across two diffusion‑based models, demonstrating cross‑model generalization.

By Zhenjun Qiu, Jianing Huang, Dongang Liu, Baiyu Du, Yixun Niu, Hao Yang, Xinyu Huang, Chuan Hu, Shu Liu
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