MA-SafeDiffuser: Safe Multi-Agent Planning with Diffusion Probabilistic Models
Organizations: IIIT Hyderabad, Hyderabad, India
Abstract
We propose MA-SafeDiffuser, a multi-agent extension of SafeDiffuser that equips diffusion-based trajectory planners with finite-time diffusion invariance guarantees for joint-agent safety specifications. Building on the single-agent construction that embeds control barrier function (CBF) constraints into reverse-diffusion updates, we: (i) formalize joint safe sets as intersections of per-agent and pairwise barrier sets; (ii) derive centralized and decentralized (communication-aware) constrained denoising procedures with provable invariance under mild assumptions; (iii) address local-trap and deadlock phenomena via time-varying specifications and liveness CBFs; and (iv) develop a lightweight benchmarking suite including a multi-agent Maze2D domain. Empirically, MA-SafeDiffuser reduces violation counts relative to unconstrained diffusion baselines, while retaining planning quality. We provide algorithms, proofs, and reference implementations.
Figures & tables
| Setting | Agents (M) | Success | ||||
|---|---|---|---|---|---|---|
| Centralized | 2 | 33.76 | 33.98 | 9 | 23.66 | True |
| 4 | 66.62 | 66.73 | 11.33 | 42.66 | True | |
| 8 | 133.04 | 133.16 | 40 | 87.33 | True | |
| Decentralized | 2 | 33.74 | 33.80 | 16 | 22.66 | True |
| 4 | 66.70 | 66.71 | 45 | 73.66 | True | |
| 8 | 135.29 | 135.35 | 70.66 | 88.66 | True |
| Mode | Reward | Violations | Success |
|---|---|---|---|
| Safe | True | ||
| Unsafe (no CBF) | True |
| Method | Success Rate | Reward | Violations |
|---|---|---|---|
| MAPPO-Lag | 0% | -0.82 | 532.3 |
| Centralized | 100% | 66.62 | 11.33 |
| Decentralized | 100% | 66.70 | 45.00 |
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
Multi-Agent Planning
Multi-Agent Planning coordinates multiple decision-makers to assign tasks, plan actions and paths, and resolve conflicts under shared constraints.
See all 127 papers