Finding available parking spaces made easy Conference Paper uri icon

abstract

  • 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 ad-hoc network. The navigation system in the vehicle has to compute from this 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. 2010 ACM.

name of conference

  • Proceedings of the 6th International Workshop on Foundations of Mobile Computing

published proceedings

  • Proceedings of the 6th International Workshop on Foundations of Mobile Computing

author list (cited authors)

  • Klappenecker, A., Lee, H., & Welch, J. L.

citation count

  • 13

complete list of authors

  • Klappenecker, Andreas||Lee, Hyunyoung||Welch, Jennifer L

editor list (cited editors)

  • Richa, A. W., & Moscibroda, T.

publication date

  • January 2010