SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS (Q3462275)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6526397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS |
scientific article; zbMATH DE number 6526397 |
Statements
SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS (English)
0 references
5 January 2016
0 references
cooperative path-finding
0 references
multirobot path-planning
0 references
motion coordination
0 references
\((N^2-1)\)-puzzle
0 references
\(N\times N\)-puzzle
0 references
15-puzzle
0 references
sliding puzzle
0 references
domain dependent planning
0 references
makespan optimization
0 references
BIBOX
0 references
BIBOX-\(\theta\)
0 references
0.8686539
0 references
0.8685209
0 references
0.8681377
0 references
