Sector Optimization Dijkstra Algorithm
HU Shu-wei · Computer Technology and Development · 2006
All temporary marked nodes are searched many times in Dijkstra algorithm.It becomes bottleneck obviously.An optimization algorithm is presented in this paper based on the analysis of Dijkstra's algorithm.It searches the shortest path within the sector limit because searching area and searching direction are limited.In the course of the optimization algorithm running,these nodes away from the shortest path are abandoned and those nodes close to goal from direction or position are processed.It finds a shortest path according to start node,goal node and angle of searching sector given by user.So the number of processed nodes is largely reduced in the optimization algorithm.Speed and efficiency of the optimization algorithm are improved.