Jan Matyáš Křištan

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology

In the Multiagent Path Finding (MAPF for short) problem, we focus on efficiently finding non-colliding paths for a set of k agents on a given graph G, where each agent seeks a path from its source vertex to a target. An important measure of the quality of the solution is the length of the proposed s…