4 May 1993 Three-dimensional minimum-cost path planning using cellular automata architectures
Author Affiliations +
Proceedings Volume 1831, Mobile Robots VII; (1993) https://doi.org/10.1117/12.143799
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
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.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Panagiotis G. Tzionas, Panagiotis G. Tzionas, Phillippos G. Tsalides, Phillippos G. Tsalides, Adonios Thanailakis, Adonios Thanailakis, "Three-dimensional minimum-cost path planning using cellular automata architectures", Proc. SPIE 1831, Mobile Robots VII, (4 May 1993); doi: 10.1117/12.143799; https://doi.org/10.1117/12.143799

Back to Top