Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality
Chenning Yu,Qingbiao Li,Sicun Gao,Amanda Prorok,Chenning Yu,Qingbiao Li,Sicun Gao,Amanda Prorok
Conflict-Based Search is one of the most popular methods for multi-agent path finding. Though it is complete and optimal, it does not scale well. Recent works have been proposed to accelerate it by introducing various heuristics. However, whether these heuristics can apply to non-grid-based problem settings while maintaining their effectiveness remains an open question. In this work, we find that ...
