Multiagent Path Finding: Structural Properties for Efficient Algorithms
Speakers Nikolaos Melissinos
This presentation explores how network structure influences the complexity of finding collision-free, time-efficient schedules in Multi-Agent Path Finding (MAPF). We demonstrate that while dense networks simplify exact solutions, specific structural properties can be leveraged to design efficient algorithms for sparse or centralized topologies.