On the complexity of optimal parallel cooperative path-finding (Q2805441)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of optimal parallel cooperative path-finding |
scientific article; zbMATH DE number 6579354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of optimal parallel cooperative path-finding |
scientific article; zbMATH DE number 6579354 |
Statements
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
0.8986678
0 references
0.88006604
0 references
0.87667465
0 references
0.87657905
0 references
0.87282693
0 references
0.87251604
0 references
0.8711707
0 references
On the complexity of optimal parallel cooperative path-finding (English)
0 references
