Optimal Route Planning of Parking Lot Based on Dijkstra Algorithm

摘要

In this paper, we propose a novel method based on Dijkstra algorithm for parking lot to find an optimal route and solve the difficulties in finding parking spaces and traffic congestion nowadays. Firstly, by means of the traditional Dijkstra algorithm, which is a common way to solve the shortest path problem, we combine it with the impedance function model to obtain the dynamic time of the route. Secondly, the balance function between distance and time is adopted as the weight matrix of the algorithm for optimal path planning. Finally, the verification of the proposed method was conducted by using the numerical simulation. Experimental results validated that the proposed approach was able to provide an optimal personal navigation path effectively, thereby it enhancing the user experience in the parking lot.