Finding available parking spaces made easy
- Additional Document Info
- View All
We discuss the problem of predicting the number of available parking spaces in a parking lot. The parking lot is modeled by a continuous-time Markov chain, following Caliskan, Barthels, Scheuermann, and Mauve. The parking lot regularly communicates the number of occupied spaces, capacity, arrival and parking rate through a vehicular network. The navigation system in the vehicle has to compute from these data the probability of an available parking space upon arrival. We derive a structural result that considerably simplifies the computation of the transition probabilities in the navigation system of the vehicle. 2013 Elsevier B.V. All rights reserved.
author list (cited authors)
Klappenecker, A., Lee, H., & Welch, J. L.
complete list of authors
Klappenecker, Andreas||Lee, Hyunyoung||Welch, Jennifer L