Hierarchical multi-agent motion planning in a static environment

Abstract

This hierarchical approach to motion planning has good asymptotic complexity and, when the assumptions are met, gives near-optimal solutions. We address adaptations of our heuristics (a clear method encapsulating an arbitrary set of points) to handle situations where our assumptions do not quite hold.