Share Email Print

Proceedings Paper

Three-dimensional minimum-cost path planning using cellular automata architectures
Author(s): Panagiotis G. Tzionas; Phillippos G. Tsalides; Adonios Thanailakis
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A new algorithm for the estimation of the minimum cost path between a pair of points in the 3-D space and it''s proposed VLSI implementation using a 3-D Cellular Automata (CA) architecture, are being presented in this paper. The proposed algorithm guarantees to find the minimum cost path in 3-D space, if such a path exists. The proposed algorithm is especially suitable for real-time 3-D applications, such as 3-D automated navigation, target tracking in 3- D, 3-D path planning, etc.

Paper Details

Date Published: 4 May 1993
PDF: 10 pages
Proc. SPIE 1831, Mobile Robots VII, (4 May 1993);
Show Author Affiliations
Panagiotis G. Tzionas, Democritus Univ. of Thrace (Greece)
Phillippos G. Tsalides, Democritus Univ. of Thrace (Greece)
Adonios Thanailakis, Democritus Univ. of Thrace (Greece)

Published in SPIE Proceedings Vol. 1831:
Mobile Robots VII
William J. Wolfe; Wendell H. Chun, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?