Cellular automata based minimum cost path estimation on binary maps
Panagiotis G. Tzionas, Ph. Tsalides, A. Thanailakis · Electronics Letters · 1992
A new algorithm for the calculation of the minimum cost path between a pair of points on a binary map and its VLSI implementation using a new, multistate, 2-D cellular automata (CA) architecture, are presented. The main advantages of the proposed architecture are that storage requirements are reduced to a minimum and the speed of operation is very high.