Three-dimensional minimum-cost path planning using cellular automata architectures

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.

[1]  李幼升,et al.  Ph , 1989 .

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

[3]  Dave Hightower,et al.  The interconnection problem: A tutorial , 1973, Computer.

[4]  Ravi Nair,et al.  Global wiring on a wire routing machine , 1982, DAC.

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

[6]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

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

[8]  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.

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