With the development of wireless communication and artificial intelligence technology, online parking reservation system can effectively save drivers’ searching time for vacant spaces. However, in the environment with multiple candidate parking lots around the destination, how to coordinate and maximize parking space resources to reduce the travel time is still a practical issue for urban drivers. In order to solve this problem, a collaborative reservation mechanism based on dynamic vehicle path planning is proposed in this paper. By the aid of the dedicated backbone network with a clear division of work responsibilities, the information of traffic and parking lots is collected in real time, based on which the travel time prediction and empty spaces evaluation are executed separately, and then the optimal decision of path planning and parking lot selection can be made and adjusted dynamically by a step-by-step acknowledgement mechanism. The simulation results show that, based on collaborative working and overall planning, our proposed reservation mechanism can effectively raise the utilization rate of the parking lots resources and significantly reduce the travel time for drivers under different traffic environments. Compared to current mechanisms, the collaborative parking reservation mechanism reveals higher feasibility and applicability. It can assist in design and operation of urban traffic management and space resource utilization.
A Collaborative Reservation Mechanism of Multiple Parking Lots Based on Dynamic Vehicle Path Planning
2021
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
A simple reservation and allocation model of shared parking lots
Online Contents | 2016
|Turning Standard Line (TSL) Based Path Planning Algorithm for Narrow Parking Lots
SAE Technical Papers | 2015
|A simple reservation and allocation model of shared parking lots
Elsevier | 2016
|Path planning and path following for vehicles at intersections and in parking lots
TIBKAT | 2023
|