Urban K shortest path acquisition method based on SPFA algorithm

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: FAN YINCHAO, ZENG JIAHAN, DING JIANXUN, HUANG LINXUAN, XU XIAOMING, YAN JIANGNAN, FAN ZHEYAN, YIN HUIJUAN, LONG JIANCHENG
Format: Patent
Sprache:chi ; eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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