DeepAI AI Chat
Log In Sign Up

Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding

by   Xinyi Zhong, et al.
University of Southern California
Simon Fraser University

We formalize and study the multi-goal task assignment and path finding (MG-TAPF) problem from theoretical and algorithmic perspectives. The MG-TAPF problem is to compute an assignment of tasks to agents, where each task consists of a sequence of goal locations, and collision-free paths for the agents that visit all goal locations of their assigned tasks in sequence. Theoretically, we prove that the MG-TAPF problem is NP-hard to solve optimally. We present algorithms that build upon algorithmic techniques for the multi-agent path finding problem and solve the MG-TAPF problem optimally and bounded-suboptimally. We experimentally compare these algorithms on a variety of different benchmark domains.


page 1

page 2

page 3

page 4


Lifelong Multi-Agent Path Finding in Large-Scale Warehouses

Multi-Agent Path Finding (MAPF) is the problem of moving a team of agent...

A Competitive Analysis of Online Multi-Agent Path Finding

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

Multi-Agent Path Finding with Deadlines

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The obje...

Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers

In this paper, we study the one-shot and lifelong versions of the Target...

Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search

Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem t...

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

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

On Pole-Zero Assignment of Vibratory Systems by Multi-Input Feedback Control

In this paper, we consider the pole-zero assignment problem for vibrator...