On the Complexity of Optimal Parallel Cooperative Path-Finding (Q2805441)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Optimal Parallel Cooperative Path-Finding |
scientific article |
Statements
On the Complexity of Optimal Parallel Cooperative Path-Finding (English)
0 references
11 May 2016
0 references
cooperative path-finding (CPF)
0 references
parallelism
0 references
multi-agent system
0 references
sliding puzzle
0 references
\((N^2 - 1)\)-puzzle
0 references
\(N\times N\)-puzzle
0 references
15-puzzle
0 references
domain-dependent planning
0 references
complexity
0 references
NP-completeness
0 references
