Linear optimal shortest path search method

Abstract

The invention relates to a linear optimal shortest path search method. In the method, the shortest path distance between a marked temporary node and a source node and the linear distance between the temporary node and a target node are used as the basis for selecting a permanent marker node from a temporary node set under the conditions that a researched network can be seen as a planar network. The provided shortest path search method reduces the number of traversing nodes in search, thereby increasing the searching speed.

Description

technical field [0001] The invention relates to the field of path search, in particular to a straight line optimization shortest path search method. Background technique [0002] The most famous solution of the shortest path method is the Dijkstra search method. The original Dijkstra search method divides network nodes into three types: unmarked nodes, temporary marked nodes and permanent marked nodes. All nodes in the network are first initialized as unmarked nodes, and the nodes connected to the shortest path nodes during the search process are temporary marked nodes, and each cycle searches for the path length from the source point from the temporary marked nodes The shortest node is used as a permanent marker node, and the search process is not ended until the target node is found or all nodes become permanent marker nodes. [0003] In the original Dijkstra search process, since the temporary marked nodes are stored out of order, all temporary marked nodes must be trav...

AI Technical Summary

Problems solved by technology

[0004] from figure 2 It can be seen that the original Dijkstra search method can be approximated as a series of concentric circles with the source node as the center. The search process does not consider the direction or position of the target node. During the search process starting from the source node, other nodes The probability of being searched is the same as that of the target node

Images