An Improved Dijkstras Algorithm Based on Search Strategy
Yi Zhen Huang, Qing Ming Yi, Min Shi · Applied Mechanics and Materials · 2013
An improved Dijkstras shortest path algorithm based on search strategy is proposed in this paper. In order to solve the defects of the conventional algorithm, such as large redundancy of space and time, the proposed algorithm introduces a constraint function with weighted value ω for searching each position in the state space to guide the search forward to expected direction. Meanwhile, according to different complexity of map information, the weighted value ω can be flexibly changed to make the constraint function more reasonable to effectively improve the search efficiency. Experimental result shows that the number of nodes on search path and computation time is obviously reduced, and the improved algorithm can be fast to search out the goal nodes.