Should Multi-Agent Path Finding Algorithms Coordinate Target Arrival Times?

Abstract

Multi-Agent Path Finding (MAPF) deals with finding conflict-free paths for a set of agents from an initial configuration to a given target configuration. The Lifelong MAPF (LMAPF) problem is a well-studied online version of MAPF in which an agent receives a new target when it reaches its current target. The common approach for solving LMAPF is to treat it as a sequence of MAPF problems, periodically replanning from the agents’ current configurations to their current targets. A significant drawback of this approach is that in MAPF the agents must reach a configuration in which all agents are at their targets simultaneously. Coordinating the agents’ paths such that they occupy their targets at the same time is needlessly restrictive for LMAPF. Techniques have been proposed to indirectly mitigate this drawback. In this position paper, we describe cases where these mitigation techniques fail. As an alternative, we propose to solve LMAPF problems by solving a sequence of modified MAPF problems, in which the objective is for each agent to eventually visit its target, but not necessarily for all agents to do so simultaneously. We refer to this MAPF variant as MAPF for Lifelong (MAPF4L) and propose how to solve it by modifying several existing MAPF algorithms. A limited experimental evaluation identifies some cases where using a MAPF4L algorithm can improve the system throughput significantly.