An efficient algorithm for shortest path in three dimensions with polyhedral obstacles

J. Khouri, K. A. Stelson

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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 languageEnglish (US)
Pages (from-to)433-436
Number of pages4
JournalJournal of Dynamic Systems, Measurement and Control, Transactions of the ASME
Volume111
Issue number3
DOIs
StatePublished - Sep 1989

Fingerprint Dive into the research topics of 'An efficient algorithm for shortest path in three dimensions with polyhedral obstacles'. Together they form a unique fingerprint.

Cite this