The Path Optimization Algorithm of Car Navigation System considering Node Attributes under Time-Invariant Network

Vehicle path planning plays a key role in the car navigation system. In actual urban traffic, the time spent at intersections accounts for a large proportion of the total time and cannot be ignored. Therefore, studying the shortest path planning problem considering node attributes has important prac...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mobile information systems Jg. 2021; S. 1 - 20
Hauptverfasser: Zhu, Dan-dan, Sun, Jun-qing
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Hindawi 04.01.2021
John Wiley & Sons, Inc
Schlagworte:
Artificial intelligence
Collaboration
Communication
Dijkstra's algorithm
Efficiency
Genetic algorithms
Global positioning systems
GPS
Intersections
Invariants
Navigation systems
Network management systems
Nodes
Optimization
Optimization algorithms
Roads & highways
Shortest path planning
Traffic accidents & safety
Traffic congestion
Transportation planning
Travel
Travel time
Traveling salesman problem
Vehicles
United States > US
Europe
Japan
ISSN:1574-017X, 1875-905X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Vehicle path planning plays a key role in the car navigation system. In actual urban traffic, the time spent at intersections accounts for a large proportion of the total time and cannot be ignored. Therefore, studying the shortest path planning problem considering node attributes has important practical significance. In this article, we study the vehicle path planning problem in time-invariant networks, with the minimum travel time from the starting node to the destination node as the optimization goal (including node time cost). Based on the characteristics of the problem, we construct the mathematical model. We propose a Reverse Order Labeling Algorithm (ROLA) based on the traditional Dijkstra algorithm to solve the problem; the correctness of the proposed algorithm is proved theoretically, and we analyse and give the time complexity of the ROLA and design a calculation example to verify the effectiveness of the algorithm. Finally, through extensive simulation experiments, we compare the performance of the proposed ROLA with several other existing algorithms. The experimental results show that the proposed algorithm has good stability and high efficiency.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1574-017X
1875-905X
DOI:10.1155/2021/2963092