Cellular automata based minimum cost path estimation on binary maps

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.

[1]  Mansur R. Kabuka,et al.  A fault-tolerant architecture for an automatic vision-guided vehicle , 1990, IEEE Trans. Syst. Man Cybern..

[2]  Majid Sarrafzadeh,et al.  Wirability of knock-knee layouts with 45 degrees wires , 1991 .

[3]  Maria L. Gini,et al.  Path tracking through uncharted moving obstacles , 1990, IEEE Trans. Syst. Man Cybern..

[4]  Sartaj Sahni,et al.  A Hardware Accelerator for Maze Routing , 1987, 24th ACM/IEEE Design Automation Conference.

[5]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[6]  Alexander Iosupovici,et al.  A Class of Array Architectures for Hardware Grid Routers , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Sheldon B. Akers,et al.  A Modification of Lee's Path Connection Algorithm , 1967, IEEE Trans. Electron. Comput..