Urban K shortest path acquisition method based on SPFA algorithm

Abstract

The invention discloses an urban K-rule shortest path acquisition method based on an SPFA algorithm. The method comprises the following steps: 1, acquiring a real-time urban road network map; 2, initializing a variable list label for each intersection node; 3, completing the forward updating of the kth short path through the intersection node in the Qkt, and carrying out the insertion sorting in the variable list label; 4, performing proper pruning on intersection nodes without follow-up effects; and 5, finding a plurality of distance values and the shortest path from the starting point intersection node vs to the terminal point intersection node ve, and backtracking and outputting the distance values and the shortest path. According to the method, pruning operation can be performed on other intersection nodes according to the distance value of the intersection node ve at the terminal point at the current moment so as to reduce the effective updating range, redundant calculation is avoided, information in the relaxation process of the shortest path algorithm is fully utilized to solve the K shortest path, and therefore the actual requirement of multi-path navigation selection is met.

Description

technical field [0001] The invention belongs to the field of vehicle navigation path optimization, in particular to a method for obtaining the shortest path of city K based on SPFA algorithm. Background technique [0002] With the continuous expansion of the urban road network, there can be many different routes for a journey between a pair of origins and destinations, and as the current navigation user usage increases, and the navigation effect is closely related to the timeliness of real-time traffic information, People have higher and higher requirements for algorithms. [0003] The algorithm used in common navigation to obtain the shortest path, its calculation process involves a very large range in large-scale urban road networks, and the time-consuming and resource occupation will increase accordingly. Therefore, the method of exchanging the number of resources for efficiency and quality It is a common solution; to further solve the K-then shortest path problem, diffe...

AI Technical Summary

Problems solved by technology

[0003] The algorithm used in common navigation to obtain the shortest path, its calculation process involves a very large range in large-scale urban road networks, and the time-consuming and resource occupation will increase accordingly. Therefore, the method of exchanging the number of resources for efficiency and quality It is a common solution; to further solve the K-then shortest path problem, different scholars have designed different algorithms such as "reconstruction network" and "edge deletion method" to deal with it. However, the application of these methods on computer processors undoubtedly makes the work The load is huge, and it is not suitable for the concept of real-time navigation that has high requirements for efficiency

Images