Study for seeking the shortest path on the irregular surface with cellular automata method

For the path optimization problem on the irregular surface of three-dimension, three-dimensional surface is discretized with grid. Based on the parallel character of cellular automata in the cellular space, with the dynamic cellular neighbors, the time evolution interval is defined as the minimum remaining weight. The new shortest path algorithm is structured, based on cellular automaton model. That is to say, through the simple rules of evolution of cellular state, the shortest path is got. And a new way of application of the Cellular Automata model is provided.