Showing cs.MAShow all
3 papers · 1 filter
cs.MA2026
The Cost of Classical Multi-Agent Path Finding
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
Multi-Agent Path Finding (MAPF) is the problem of planning conflict-free paths for multiple agents in a shared space, each from its start to its goal. Classical MAPF has been the d…
cs.MA2026
AOC-CBS: Anytime-Optimal Continuous-time Conflict-Based Search for Generalised Multi-Agent Path Finding
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
Many research fields share a common structure: a set of agents, each pursuing its own goal, whose actions must be coordinated so that no two of them conflict. Multi-Agent Path Find…
cs.MA2025
Optimal Multi-Agent Path Finding in Continuous Time
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
Continuous-time Conflict Based Search (CCBS) has been widely used as an exact baseline for Continuous-time Multi-Agent Path Finding (MAPFR), and its correctness guarantees underpin…