Decentralized discovery of free parking places
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
An interactive approach to route search
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A cooperative reservation protocol for parking spaces in vehicular ad hoc networks
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Computing a k-route over uncertain geographical data
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
T-drive: driving directions based on taxi trajectories
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
MARiO: multi-attribute routing in open street map
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Reaching Available Public Parking Spaces in Urban Environments Using Ad Hoc Networking
MDM '11 Proceedings of the 2011 IEEE 12th International Conference on Mobile Data Management - Volume 01
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
PhonePark: Street Parking Using Mobile Phones
MDM '12 Proceedings of the 2012 IEEE 13th International Conference on Mobile Data Management (mdm 2012)
| Hi-index | 0.00 |
Ordinary navigation systems compute the cost-optimal way to a given destination. However, it is often not possible to directly park the car at the destination of a route. Since parking possibilities are often limited, drivers have to locate a free parking spot when getting close to their destination. This often proves rather problematic in unknown environments. Recent advances in car sensoring techniques and vehicle ad-hoc networks allow the construction of real-time maps of currently unoccupied parking spots. In this paper, we examine the problem of guiding a driver to an unoccupied parking spot given such an ad-hoc map. The major problem of this task is the volatility of parking spot vacancy, especially in urban residential areas. Thus, we model the availability as a probability distribution decreasing over time and compute routes maximizing the likelihood of finding a parking spot. Formally, this task can be considered as a variant of the time-dependent traveling salesman problem (TSP). Due to the exponential time complexity, we propose an efficient greedy algorithm to find a good approximation. In our experimental evaluation, we compare the greedy approach to a time-capped complete search.