Year: 2024
Type: conference-paper
Abstract: The purpose of path planning algorithms is to study the shortest path between two points in a topological network.Many scholars at domestic and overseas have conducted in-depth research on this topic, and there are many mature algorithms available.However, the application of path planning in-vehicle navigation systems often focuses on classical static path planning, which cannot cope with large-scale and dynamically changing traffic networks.This paper takes Geographic Information Systems (GIS) as the starting point and uses the ArcGIS traffic network model as the theoretical basis to implement various classical path planning algorithms such as PSP, Dijkstra, DBFS, L-dequeue, L-2queue, improved Dijkstra, A*, and A* bidirectional search.Experimental results show that the algorithm can provide dynamic path planning results based on realtime traffic flow changes, with a running speed nearly an order of magnitude faster than the A* bidirectional search algorithm and nearly five times faster than the ArcGIS path planning algorithm.This is of great significance for optimizing the allocation of road network resources and solving the increasingly serious urban traffic problems.
Institutions: Tsinghua University, Peking University
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4405384342