DocumentCode
624596
Title
Improved reversely a star path search algorithm based on the comparison in valuation of shared neighbor nodes
Author
Zhou Weiteng ; Han Baoming ; Li Dewei ; Zheng Bin
Author_Institution
Sch. of Traffic & Transp., Beijing Jiaotong Univ., Beijing, China
fYear
2013
fDate
9-11 June 2013
Firstpage
161
Lastpage
164
Abstract
A new A star path finding algorithm(named SNA star) was proposed to solve the problem of path finding and optimization by comparing the valuation of shared neighbor nodes, which is based on the reverse improved A star path search algorithm. The characteristics of this algorithm in the paper take the use of the valuation of shared neighbor nodes to verify the search direction, and reversely search from the target to starting, which used the way of local evaluation instead of the way of global evaluation. Taking two simulation experiments as examples to show that the algorithm is effective both on speed and applicability in complex environment. The validity of the algorithm was demonstrated from the comparison and results of the simulation experiment. The evaluation function of this algorithm in the multi-obstacles environment was optimized and evaluation speed was increased at the same time.
Keywords
optimisation; search problems; SNA star; multiobstacles environment; optimization; search direction; shared neighbor nodes; star path finding algorithm; star path search algorithm; Algorithm design and analysis; Artificial intelligence; Complexity theory; Cost accounting; Heuristic algorithms; Optimization; Search problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Information Processing (ICICIP), 2013 Fourth International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4673-6248-1
Type
conf
DOI
10.1109/ICICIP.2013.6568060
Filename
6568060
Link To Document