Simulation-Informed Diffusion for Decentralized Multi-robot Motion Planning
About
Decentralized multi-robot motion planning requires each robot to generate collision-free trajectories from local observations, without global sensing or reliable communication. However, most existing planners, whether classical or learning-based, generate trajectories from a static snapshot of the local observation, which limits their ability to anticipate the future behavior of neighboring robots. This limitation is critical as the number of robots increases and the environment becomes more cluttered. To overcome this challenge, this paper introduces Simulation-Informed Diffusion (SID), a decentralized framework built on constraint-aware diffusion models (CADM). SID first uses CADM to simulate the future trajectories of neighboring robots from their currently observed states, and then uses the same CADM to plan each robot's own trajectory under safety constraints informed by these simulations. Crucially, the accurate simulation of neighbors enables a minimal communication scheme that triggers coordination only when necessary in highly congested scenarios. Experiments across diverse environments show that SID consistently outperforms baseline methods in terms of planning effectiveness and constraint satisfaction, and scales to scenarios with 108 robots and 160 obstacles.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Multi-agent Navigation | Basic Map | Success Rate100 | 12 | |
| Multi-agent Navigation | Dense Map | Success Rate96 | 12 | |
| Multi-robot coordination | Basic Map | Success Rate100 | 12 | |
| Multi-robot coordination | Dense Map | Success Rate100 | 12 | |
| Multi-robot coordination | Room Map | Success Rate100 | 12 | |
| Multi-robot coordination | Shelf Map | Success Rate100 | 12 | |
| Multi-robot path planning | Original Benchmark Room map | Running Time67.58 | 11 | |
| Multi-robot path planning | Original Benchmark Shelf map | Running Time94.24 | 11 | |
| Multi-robot path planning | Original Benchmark Basic map | Running Time76.01 | 9 | |
| Multi-robot path planning | Original Benchmark Dense map | Running Time140 | 8 |