Shortest path labeling algorithm considering intersection turning

Abstract

The invention discloses a shortest path labeling algorithm considering intersection turning, which relates to improvement of a network representation method of the shortest path of a road. The algorithm comprises the following steps: generating a star-type data structure according to information on road section cost and intersection turning cost first; and establishing corresponding connections among a node, a road section and a turning according to the hierarchy of the data structure for the convenience of retrieving road network information by the shortest path algorithm. The steps of the shortest path labeling algorithm are basically same as that of the prior labeling algorithm, but during labeling in each step, the summation of a current node label, the downstream road section cost and the downstream node turning cost are calculated aiming to each turning behavior of a downstream node of the current node respectively, and the summation is compared with a shortest path label of a corresponding downstream node so as to update the label and finally generate a shortest path tree, thus the shortest path between a known starting point and a destination point is solved on the basis. The shortest path labeling algorithm occupies a small memory space, is convenient to update network information and makes clear about the difference among different turning movements.

Description

technical field [0001] The invention relates to a shortest path labeling algorithm considering intersection turning in the improvement of road shortest path network representation method. Background technique [0002] The shortest path labeling algorithm (such as Dijkstra's algorithm) is to solve the network shortest path problem by generating the shortest path tree from the starting point of the path, which is suitable for solving the situation of one starting point and multiple ending points. [0003] At present, whether it is using the shortest path to allocate traffic in traffic planning, or solving the shortest driving route in the navigation system, the commonly used shortest path algorithm is based on the premise of unconstrained network conditions. In unconstrained road networks, delays caused by vehicles passing through intersections or no-turn restrictions at intersections are ignored. However, the actual road network is a network with restrictions, mainly in: ...

AI Technical Summary

Problems solved by technology

However, this method has major disadvantages such as large space occupation, complex modification, and high redundancy. For example, only for ordinary four-way intersections, it will be expanded into a sub-network containing 8 nodes and 16 paths.

Images