Reducing Multiple Object Motion Planning to Graph Searching (Q3728030)
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 3959472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing Multiple Object Motion Planning to Graph Searching |
scientific article; zbMATH DE number 3959472 |
Statements
Reducing Multiple Object Motion Planning to Graph Searching (English)
0 references
1986
0 references
robotics
0 references
polynomial space
0 references
computational complexity
0 references
algorithm
0 references
motion planning problem
0 references
graph searching problem
0 references
0.88152814
0 references
0.8611735
0 references
0.85782814
0 references
0.85003924
0 references
0.8471205
0 references
0.84538597
0 references
0 references
