Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Makespan Optimal Solving of Cooperative Path-Finding via Reductions to
  Propositional Satisfiability   The problem of makespan optimal solving of cooperative path finding (CPF) is
addressed in this paper. The task in CPF is to relocate a group of agents in a
non-colliding way so that each agent eventually reaches its goal location from
the given initial location. The abstraction adopted in this work assumes that
agents are discrete items moving in an undirected graph by traversing edges.
Makespan optimal solving of CPF means to generate solutions that are as short
as possi-ble in terms of the total number of time steps required for the
execution of the solution.
  We show that reducing CPF to propositional satisfiability (SAT) represents a
viable option for obtaining makespan optimal solutions. Several encodings of
CPF into propositional formulae are suggested and experimentally evaluated. The
evaluation indicates that SAT based CPF solving outperforms other makespan
optimal methods significantly in highly constrained situations (environments
that are densely occupied by agents).

36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
24
The categories of this paper are: dg-ga
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
17
The categories of this paper are: q-fin
16
The categories of this paper are: stat
35
The categories of this paper are: mtrl-th
11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org