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

Wang Yuanzhi

Modern Applied Science, 2010, vol. 4, issue 5, 196

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.

Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/5348/4878 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/5348 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:4:y:2010:i:5:p:196

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().