@inproceedings{3a76d13a40804b80abeb513ab6990308,
title = "3D shortest path planning in the presence of polyhedral obstacles",
abstract = "Presented is an approach for shortest path planning in three dimensional space in the presence of convex polyhedra. It is based on visibility graph which is extended from two dimensional space into three dimensional one. A collineation is introduced for identification of visible edges in the three dimensional visibility graph. Then optimization schemes are used for finding a set of shortest paths via different edges, and the global shortest path is selected from them. Result of a computer simulation is given showing the versatility and efficiency of this approach.",
author = "K. Jiang and Seneviratne, \{L. D.\} and Earles, \{S. W.E.\}",
year = "1993",
language = "British English",
isbn = "0780309111",
series = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",
pages = "206--211",
editor = "Anon",
booktitle = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",
note = "Proceedings of 1993 International Conference on Systems, Man and Cybernetics ; Conference date: 17-10-1993 Through 20-10-1993",
}