Routing for on-street parking search using probabilistic data

Article type: Research Article

Authors: Friedrich, Tobias^{; *} | Krejca, Martin S. | Rothenberger, Ralf | Arndt, Tobias | Hafner, Danijar | Kellermeier, Thomas | Krogmann, Simon | Razmjou, Armin

Affiliations: Hasso Plattner Institute, University of Potsdam, Potsdam, Germany. E-mails: [email protected], [email protected], [email protected]

Correspondence: [*] Corresponding author. E-mail: [email protected].

Abstract: A significant percentage of urban traffic is caused by the search for parking spots. One possible approach to improve this situation is to guide drivers along routes which are likely to have free parking spots. The task of finding such a route can be modeled as a probabilistic graph problem which is NP-complete. Thus, we propose heuristic approaches for solving this problem and evaluate them experimentally. For this, we use probabilities of finding a parking spot, which are based on publicly available empirical data from TomTom International B.V. Additionally, we propose a heuristic that relies exclusively on conventional road attributes. Our experiments show that this algorithm comes close to the baseline by a factor of 1.3 in our cost measure. Last, we complement our experiments with results from a field study, comparing the success rates of our algorithms against real human drivers.

Keywords: Parking search, probabilistic routing, constrained optimization, field study

DOI: 10.3233/AIC-180574

Journal: AI Communications, vol. 32, no. 2, pp. 113-124, 2019