AI RESEARCH
Discrete Diffusion for Complex and Congested Multi-Agent Path Finding with Sparse Social Attention
arXiv CS.AI
•
ArXi:2605.13296v1 Announce Type: new 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 environments, suboptimal initial plans induce compound conflicts that hinder feasible repair. For repair-based solvers like LNS2, initial plan quality critically affects downstream repair, yet this factor remains underexplored.