Abstract
It is not perfect in view of the fact that the information guidance system of parking spaces in large and medium-sized parking lots at present, it is difficult to find a empty parking spaces in parking lots. One of the problems is large amount of calculation in traditional Dijkstra algorithm. In this paper, the improved Dijkstra algorithm is presented and optimized to find the best parking path with the purpose of looking for the nearest free parking space based on the layout model in parking lot parking guidance. The experiments show that it can find the optimal parking space and the optimal parking path by the improved Dijkstra algorithm, and improve the parking efficiency.
Highlights
With the continuous expansion of the scale of cities, the problem of parking difficulties has become increasingly prominent and traffic accidents frequently occur
The main reasons for the problem of “difficult parking” are as follows: the current urban parking spaces are in short supply; more importantly, in the process of searching for parking spaces, people can get less valuable parking space information; and there is a lack in parking space information management platform to guide vehicle drivers to park reasonably [1]
When the car owners arrives at the destination parking lot, they need to rely on the guidance of the managers in the parking lot or drive blindly to find the parking space, which wastes time and energy and brings new problems: parade parking, resulting in congestion in the parking lot
Summary
With the continuous expansion of the scale of cities, the problem of parking difficulties has become increasingly prominent and traffic accidents frequently occur. When the car owners arrives at the destination parking lot, they need to rely on the guidance of the managers in the parking lot or drive blindly to find the parking space, which wastes time and energy and brings new problems: parade parking, resulting in congestion in the parking lot. It is an urgent problem that the guidance of parking spaces is imperfect and needs to be solved [5] To address this challenge, we established an abstract data model of parking guidance based on the layout model in parking lot parking guidance, optimized this data model by using Dijkstra’s improved algorithm, and found an optimal parking path with the lowest cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have