… In the first, called Multi Agent Path Finding (MAPF), we are given a graph G = (V, E) … Multi-Agent
Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem…

… for multiple robots is important for real-world multi-robot systems and has been studied
as an optimization problem on graphs, called multi-agent path finding (MAPF). This review …

… , with a focus on the simplified Multi-Agent Path Finding (MAPF) problem [2]. In MAPF, …
Multiagent path finding with payload transfers and the package-exchange robot-routing problem…

… Multi-agent path finding with payload transfers and the package-exchange robot-routing
problem. In AAAI, 3166–3173. Ma, H.; Yang, J.; Cohen, L.; Kumar, TKS; and Koenig, S. …

… MAPF is an idealized abstraction of multi-agent navigation problems in many real-world ap-
… This issue can be addressed by (1) adding a post-processing step that transfers discrete …

… We study the offline Multi-Agent Pickup-and-Delivery (MAPD) problem, where a … Multi-Agent
Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem…

… For example, a transported payload might be so large that it is an obstacle after being … In
so far, the problem has some similarity to the package-exchange robot-routing problem (Ma et al…

… Knowing that mutex propagation alleviates this dilemma in AI planning, we seek to
transfer this technique to MAPF, particularly in the CBS- and SAT-based frameworks. …

… In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must
reach their own respective destinations without inter-agent collisions. In practical MAPF …

… : (1) Make existing (even optimal) multi-agent pathfinding algorithms more general by …
Multi-agent path finding with payload transfers and the package-exchange robot-routing problem…