Share Email Print

Proceedings Paper

A Minimum Path Algorithm Among 3D-Polyhedral Objects
Author(s): Aysin Yeltekin
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this work we introduce a minimum path theorem for 3D case. We also develop an algorithm based on the theorem we prove. The algorithm will be implemented on the software package we develop using C language. The theorem we introduce states that; "Given the initial point I, final point F and S be the set of finite number of static obstacles then an optimal path P from I to F, such that PA S = 0 is composed of straight line segments which are perpendicular to the edge segments of the objects." We prove the theorem as well as we develop the following algorithm depending on the theorem to find the minimum path among 3D-polyhedral objects. The algorithm generates the point Qi on edge ei such that at Qi one can find the line which is perpendicular to the edge and the IF line. The algorithm iteratively provides a new set of initial points from Qi and exploits all possible paths. Then the algorithm chooses the minimum path among the possible ones. The flowchart of the program as well as the examination of its numerical properties are included.

Paper Details

Date Published: 10 March 1989
PDF: 8 pages
Proc. SPIE 1007, Mobile Robots III, (10 March 1989); doi: 10.1117/12.949080
Show Author Affiliations
Aysin Yeltekin, Northrop University (United States)

Published in SPIE Proceedings Vol. 1007:
Mobile Robots III
William J. Wolfe, Editor(s)

© SPIE. Terms of Use
Back to Top