Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Multi-Agent Path Finding with Deadlines   We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective
is to maximize the number of agents that can reach their given goal vertices
from their given start vertices within the deadline, without colliding with
each other. We first show that MAPF-DL is NP-hard to solve optimally. We then
present two classes of optimal algorithms, one based on a reduction of MAPF-DL
to a flow problem and a subsequent compact integer linear programming
formulation of the resulting reduced abstracted multi-commodity flow network
and the other one based on novel combinatorial search algorithms. Our empirical
results demonstrate that these MAPF-DL solvers scale well and each one
dominates the other ones in different scenarios.

9
The categories of this paper are: nlin
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
35
The categories of this paper are: mtrl-th
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc