Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search

03/12/2021
by   Jiaoyang Li, et al.
20

Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks us to plan collision-free paths for a team of cooperative agents. In this work, we show that one of the reasons why MAPF is so hard to solve is due to a phenomenon called pairwise symmetry, which occurs when two agents have many different paths to their target locations, all of which appear promising, but every combination of them results in a collision. We identify several classes of pairwise symmetries and show that each one arises commonly in practice and can produce an exponential explosion in the space of possible collision resolutions, leading to unacceptable runtimes for current state-of-the-art (bounded-sub)optimal MAPF algorithms. We propose a variety of reasoning techniques that detect the symmetries efficiently as they arise and resolve them by using specialized constraints to eliminate all permutations of pairwise colliding paths in a single branching step. We implement these ideas in the context of the leading optimal MAPF algorithm CBS and show that the addition of the symmetry reasoning techniques can have a dramatic positive effect on its performance - we report a reduction in the number of node expansions by up to four orders of magnitude and an increase in scalability by up to thirty times. These gains allow us to solve to optimality a variety of challenging MAPF instances previously considered out of reach for CBS.

READ FULL TEXT

Authors

page 23

page 40

page 42

02/17/2021

Symmetry Breaking for k-Robust Multi-Agent Path Finding

During Multi-Agent Path Finding (MAPF) problems, agents can be delayed b...
12/17/2016

Optimal Target Assignment and Path Finding for Teams of Agents

We study the TAPF (combined target-assignment and path-finding) problem ...
02/14/2014

Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment

Avoiding collisions is one of the vital tasks for systems of autonomous ...
10/03/2020

EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for ...
06/22/2021

A Competitive Analysis of Online Multi-Agent Path Finding

We study online Multi-Agent Path Finding (MAPF), where new agents are co...
05/31/2022

CBS-Budget (CBSB): A Complete and Bounded Suboptimal Search for Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) is the problem of finding a collection o...
08/08/2020

Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming

The multi-agent path finding (MAPF) problem is a combinatorial search pr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.