Abstract
An algorithm to find the shortest path between two specified points in three-dimensional space in the presence of polyhedral obstacles is described. The proposed method iterates for the precise location of the minimum length path on a given sequence of edges on the obstacles. The iteration procedure requires solving a tridiagonal matrix at each step. Both the computer storage and the number of computations are proportional to n, the number of edges in the sequence. The algorithm is stable and converges for the general case of any set of lines, intersecting, parallel or skew.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 161-165 |
| Number of pages | 5 |
| Journal | Proceedings of the American Control Conference |
| State | Published - Dec 1 1987 |