Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding

  title={Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding},
  author={Thayne T. Walker and David Chan and Nathan R Sturtevant},
Recent work in multi-agent path planning has provided a number of optimal and suboptimal solvers that can efficiently find solutions to problems of growing complexity. Solvers based on Conflict-Based Search (CBS) combine single-agent solvers with shared constraints between agents to find feasible solutions. Suboptimal variants of CBS introduce alternate heuristics to avoid conflicts. In this paper we study the multi-agent planning problem in the context of non-holonomic vehicles planning on… 

Figures and Tables from this paper

Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search

Bipartite reduction converts the constraint generation step of CBS to a surrogate bipartite graph problem, which guarantees completeness and optimality for CBS and yields significant speedups over the previous state-of-the-art for both optimal and suboptimal search.

Multi-agent pathfinding with continuous time

Multi-Agent Pathfinding (MAPF) with Continuous Time

This work proposes a MAPF algorithm that do not assume any of these assumptions, is complete, and provides provably optimal solutions, based on a novel combination of SIPP, a continuous time single agent planning algorithms, and CBS, a state of the art multi-agent pathfinding algorithm.

Optimal and Bounded-Suboptimal Multi-Agent Motion Planning

This paper develops MAMP solvers that obviate these simplifying as- sumptions and yet generalize the core ideas of state-of-the-art MAPF solvers, and justifies the completeness, optimality and bounded-suboptimality of these solvers.

Extended Increasing Cost Tree Search for Non-Unit Cost Domains

An extended version of the increasing cost tree search algorithm (ICTS) for non-unit costs, with two new sub-optimal variants of ICTS: epsilon-ICTS and w-ICS, and higher quality sub-Optimal solutions are achievable in domains with finely discretized movement models.

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

A new grid-based benchmark for MAPF is introduced, and it is demonstrated experimentally that it poses a challenge to contemporary MAPF algorithms.

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers

This paper develops simple rapid randomized restart (RRR) strategies with the intuition that, given a hard instance, multiple short runs have a better chance of solving it compared to one long run, and shows that these strategies boost the performance of state-of-the-art MAPF solvers.

Negotiated Path Planning for Non-Cooperative Multi-Robot Systems

This paper designs an auction mechanism that allows a group of agents to reach their goals whilst minimising the total cost of the system, and aims to design a mechanism such that rational agents are incentivised to participate.

Decentralized Multi-Agent Path Finding for UAV Traffic Management

A novel MAPF model that supports the decentralized resolution of conflicts, whereby different ‘agents’, here UASSPs, manage their UAV operations is proposed, and a simple yet practical pairwise negotiation approach is presented.

Multi-agent pathfinding for unmanned aerial vehicles

This thesis is to present one possible approach to UAV contingency planning using online multi-agent pathfinding algorithms, which can be used as a baseline for future research and development.



Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem

This work proposes several ways to relax the optimality conditions of CBS trading solution quality for runtime as well as bounded-suboptimal variants, where the returned solution is guaranteed to be within a constant factor from optimal solution cost.

Fast and Memory-Efficient Multi-Agent Pathfinding

FAR (Flow Annotation Replanning), a method for multi-agent path planning on grid maps, is introduced and is shown to run significantly faster, use much less memory, and scale up to problems with more mobile units.

The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding

A number of optional pruning techniques that can significantly speed up the goal test of ICTS, the novel two-level search algorithm framework for multiple agents, are introduced.

A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding

Experimental results showed that T ASS can find solutions to the multi-agent pathfinding problem on a highly crowded tree with 1000 nodes and 996 agents in less than 8 seconds, suggesting that TASS is a productive line of study for multi- agent pathfinding.

Bounded Suboptimal Multi-Agent Path Finding Using Highways

Bounded-suboptimal MAPF approaches, such as EnhancedCBS (ECBS) and inflated-rM* [Wagner and Choset, 2015], find solutions quickly when the MAPF instances are not tightly-coupled, but in many application domains this is not the case, and the runtime of these approaches degrades severely.

Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding

Bounded-suboptimal MAPF algorithms are developed that exploit the problem structure of a given MAPF instance by finding paths for the agent that include edges from user-provided highways, which encourages a global behavior of the agents that avoids collisions.

ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding

ICBS is introduced, an improved version of CBS that incorporates three orthogonal improvements to CBS which are systematically described and studied and reduces the runtime over basic CBS by up to 20x in many cases.

Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs

The NP-hardness proof for the time optimal versions of the discrete multi-robot path planning problem shows that these problems remain NP- hard even when there are only two groups of robots (i.e. robots within each group are interchangeable).

Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding

An improved version of CBS is presented that bypasses conflicts thereby reducing the CBS search tree, and experimental results show that this improvement reduces the runtime by an order of magnitude in many cases.