Jonas Neutzner

Coordinated motion planning: Multi-agent path finding in a densely packed, bounded domain

Abstract We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a simply connected domain: Given a unique start and target position for each agent, the goal is to find a sequence of parallel, collision-free agent motions that minimizes the overall...