A single-exponential upper bound for finding shortest paths in three dimensions (Q4323732)
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 724771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A single-exponential upper bound for finding shortest paths in three dimensions |
scientific article; zbMATH DE number 724771 |
Statements
A single-exponential upper bound for finding shortest paths in three dimensions (English)
0 references
20 February 1995
0 references
minimal movement problem
0 references
motion planning
0 references
robotics
0 references
shortest path
0 references
0.8572848439216614
0 references
0.8502487540245056
0 references
0.8485184907913208
0 references
0.825847327709198
0 references
