An algorithm for shortest-path motion in three dimensions (Q1082820): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
scientific article | scientific article; zbMATH DE number 3974319 | ||
Latest revision as of 13:20, 15 July 2025
scientific article; zbMATH DE number 3974319
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for shortest-path motion in three dimensions |
scientific article; zbMATH DE number 3974319 |
Statements
An algorithm for shortest-path motion in three dimensions (English)
0 references
1985
0 references
We describe a fully polynomial approximation scheme for the problem of finding the shortest distance between two points in three-dimensional space in the presence of polyhedral obstacles. The fastest algorithm known for the exact solution of this problem is doubly exponential.
0 references
path planning
0 references
fully polynomial approximation scheme
0 references
polyhedral obstacles
0 references
