A Parking Guidance Algorithm Based on Time-Optimal Dynamic Sorting for Underground Parking

In recent years, more and more large underground parking lots have been constructed. Under the influence of many factors like the poor lighting of parking lots, and the complex distribution of parking spaces, it is hard to park in the underground parking lots. Considering this fact, it is substantially important to choose for users an good parking space with the best comprehensive performance. U sing the structure of underground garage as the modeling background, and based on the Dijkstra algorithm, a parking space guidance algorithm based on time-optimal has been proposed in this paper. The simulation experiment results show that when using the proposed approach, the required time for the users to park is about half the time saved based on the shortest distance scheme. Moreover, this algorithm can also guarantee to provide the shortest path navigation for each user, which could reduce the issues of waiting for queuing and traffic congestion in parking lot to a large extent, and then improve the efficiency of the parking lot management and enhance user's experience.