Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard (Q6487587)
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 7651018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard |
scientific article; zbMATH DE number 7651018 |
Statements
Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard (English)
0 references
7 February 2023
0 references
disc-robot motion planning
0 references
algorithmic complexity
0 references
PSPACE-hardness
0 references
0.7402775883674622
0 references
0.736675500869751
0 references
0.7366750836372375
0 references
0.7279137969017029
0 references
0.7261552214622498
0 references
