Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree

by   Yimin Tang, et al.

Combined Target-Assignment and Path-Finding problem (TAPF) requires simultaneously assigning targets to agents and planning collision-free paths for agents from their start locations to their assigned targets. As a leading approach to address TAPF, Conflict-Based Search with Target Assignment (CBS-TA) leverages both K-best target assignments to create multiple search trees and Conflict-Based Search (CBS) to resolve collisions in each search tree. While being able to find an optimal solution, CBS-TA suffers from scalability due to the duplicated collision resolution in multiple trees and the expensive computation of K-best assignments. We therefore develop Incremental Target Assignment CBS (ITA-CBS) to bypass these two computational bottlenecks. ITA-CBS generates only a single search tree and avoids computing K-best assignments by incrementally computing new 1-best assignments during the search. We show that, in theory, ITA-CBS is guaranteed to find an optimal solution and, in practice, is computationally efficient.


page 1

page 2

page 3

page 4


Optimal Target Assignment and Path Finding for Teams of Agents

We study the TAPF (combined target-assignment and path-finding) problem ...

Rotational Diversity in Multi-Cycle Assignment Problems

In multi-cycle assignment problems with rotational diversity, a set of t...

Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial probl...

Multi-goal path planning using multiple random trees

In this paper, we propose a novel sampling-based planner for multi-goal ...

Dynamic multi-agent assignment via discrete optimal transport

We propose an optimal solution to a deterministic dynamic assignment pro...

A New Algorithm for Finding MAP Assignments to Belief Networks

We present a new algorithm for finding maximum a-posterior) (MAP) assign...

Please sign up or login with your details

Forgot password? Click here to reset