Discrete Diffusion for Complex and Congested Multi-Agent Path Finding with Sparse Social Attention

arXiv:2605.13296v1 Announce Type: new Abstract: Multi-Agent Path Finding (MAPF) is a coordination problem that requires computing globally consistent, collision-free trajectories from individual start positions to assigned goal positions under combinatorial planning complexity. In dense...