Three-dimensional minimum-cost path planning using cellular automata architectures
Panagiotis G. Tzionas, Phillippos G. Tsalides, Adonios Thanailakis · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1993
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.