A Shortest Path Algorithm Under Specified Nodes Constraint

Routing problem under the Specified Nodes Constraint is very common in the path planning field. The traditional Dijkstra algorithm can solve the shortest path problem of the single source, but it is no longer applicable under the Specified Nodes Constraint. This paper put forward an improved Dijkstra algorithm: First, piecewise calculate path lengths, Secondly, by comparing rerouting cost, get the local best path which is the most favorable to the global optimal, and then get the target path. The simulation result showed that this algorithm has relatively high accuracy of seeking path and low complexity, compared with related algorithms such as the NIR algorithm, the optimized NIR algorithm, the KSP algorithm; The implementation of the algorithm is relatively fast, but it can approximate or even find global optimal solution.