Multi-Goal Multi-Agent Pickup and Delivery
Qinghong Xu,Jiaoyang Li,Sven Koenig,Hang Ma,Qinghong Xu,Jiaoyang Li,Sven Koenig,Hang Ma
In this work, we consider the Multi-Agent Pickup-and-Delivery (MAPD) problem, where agents constantly engage with new tasks and need to plan collision-free paths to execute them. To execute a task, an agent needs to visit a pair of goal locations, consisting of a pickup location and a delivery location. We propose two variants of an algorithm that assigns a sequence of tasks to each agent using th...
