Artificial Intelligence #unassigned agents#compilation-based
Unassigned Agents in Multi-Agent Path Finding Addressed by Compilation-Based Solvers
A new research paper presents adaptations of compilation-based solvers SMT-CBS and NRF-SAT to handle unassigned agents in multi-agent path finding (UA-MAPF). This variant requires some agents to yield to others without having a goal destination, a challenge relevant to logistics automation and robotics.
Jun 16, 2026 1 source