An algorithm for shortest-path motion in three dimensions (Q1082820): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90029-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024693023 / rank | |||
Normal rank | |||
Revision as of 23:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for shortest-path motion in three dimensions |
scientific article |
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
