Study for solving the path on the three-dimensional surface based on Cellular Automata method

wang yuanzhi

Abstract


 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. The method can achieve the efficiency of ant colony algorithm, and a new way of application of the Cellular Automata model is provided.


Full Text: PDF DOI: 10.5539/mas.v4n5p196

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Modern Applied Science   ISSN 1913-1844 (Print)   ISSN 1913-1852 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.