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, 2D cellular automata 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.
Published in:
Electronics Letters
(Volume:28
,
Issue:
17
)
Date of Publication: 13 Aug. 1992