Traffic induced by parking-spot seekers is a growing challenge and constitutes a considerable portion of the traffic in city centers. New opportunities to solve this problem are emerging by connected vehicles and infrastructure. For instance, ultrasonic and magnetic sensors are already mounted on the ceiling of many parking lots to detect the availability of a parking spot. These sensors can provide parking spot availability information in real-time. Further, traffic-aware smart sensors which can detect the movement of individual vehicles are also available in many city and highway areas. This report suggests an algorithm for a cloud-based parking service that exploits these streams of data to choose the best parking lot in a given parking area.
The parking seeking problem is subject to a range of criteria that may include user, municipality and parking operator preferences. Users may have some preferences with respect to walking distance to destination. Municipalities prefer to spread the traffic to reduce congestion in the urban core. Parking operators seek to maximize parking lot utilization in order to increase the revenue on real-estate investments. To solve this problem, an optimization algorithm based on multicriteria decision making process is used.
The proposed SmartPark algorithm employs a discrete Markov-chain model to demystify the future state of a parking lot. The algorithm features three modular sections:
• First, a search process is triggered to identify the expected arrival time periods to all parking lots in the targeted parking area. This process utilizes smart pole data streams reporting congestion rates across the targeted parking area.
• Then, a predictive analytics phase uses consolidated historical data about past parking dynamics to infer a state transition matrix, showing the transformation of available spots in a parking lot over short periods of time.
• Finally, this matrix is projected against similar future seasonal periods to predict the actual vacancy of a parking lot at the arrival time.