DocumentCode
527637
Title
Study for seeking the shortest path on the irregular surface with cellular automata method
Author
Wang, Yuanzhi
Author_Institution
Geographic Dept., Dezhou Univ., Dezhou, China
Volume
5
fYear
2010
fDate
10-12 Aug. 2010
Firstpage
2481
Lastpage
2484
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. And a new way of application of the Cellular Automata model is provided.
Keywords
cellular automata; graph theory; optimisation; cellular automata method; graph theory; irregular surface; path optimization problem; shortest path algorithm; three-dimensional surface; time evolution interval; Algorithm design and analysis; Automata; Data structures; Mathematical model; Optimization; Roads; Three dimensional displays; Cellular Automata; path optimization; the path on three-dimensional surface;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2010 Sixth International Conference on
Conference_Location
Yantai, Shandong
Print_ISBN
978-1-4244-5958-2
Type
conf
DOI
10.1109/ICNC.2010.5583484
Filename
5583484
Link To Document