DeepAI AI Chat
Log In Sign Up

Searching with Consistent Prioritization for Multi-Agent Path Finding

12/15/2018
by   Hang Ma, et al.
University of Southern California
Monash University
6

We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed total priority ordering of all agents a priori. We instead explore the space of all possible partial priority orderings as part of a novel systematic and conflict-driven combinatorial search framework. In a variety of empirical comparisons, we demonstrate state-of-the-art solution qualities and success rates, often with similar runtimes to existing algorithms. We also develop new theoretical results that explore the limitations of prioritized planning, in terms of completeness and optimality, for the first time.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/05/2020

Conflict-Based Search for Connected Multi-Agent Path Finding

We study a variant of the multi-agent path finding problem (MAPF) in whi...
09/22/2020

Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming

We study a dynamic version of multi-agent path finding problem (called D...
01/31/2019

Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding

The Multi-agent Path Finding (MAPF) problem consists of all agents havin...
12/10/2020

Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search

Conflict-Based Search (CBS) is a state-of-the-art algorithm for multi-ag...
08/06/2019

Multi-Robot Path Deconfliction through Prioritization by Path Prospects

This work deals with the problem of planning conflict-free paths for mob...
05/24/2019

winPIBT: Expanded Prioritized Algorithm for Iterative Multi-agent Path Finding

Providing agents with efficient paths so as not to collide with each oth...
05/24/2019

winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding

Providing agents with efficient paths so as not to collide with each oth...