Finding available parking spaces made easy Academic Article

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 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.

authors

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

published proceedings

• AD HOC NETWORKS

altmetric score

• 3

author list (cited authors)

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

citation count

• 78

complete list of authors

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

publication date

• January 2014

publisher

• Elsevier  Publisher

published in

• Ad Hoc Networks  Journal

keywords

• Continuous-time Markov Chains
• Matrix Exponentials
• Parking Availability
• Vehicular Ad Hoc Networks

Digital Object Identifier (DOI)

• 10.1016/j.adhoc.2012.03.002

start page

• 243

end page

• 249

volume

• 12

issue

• 1

URL

• http://dx.doi.org/10.1016/j.adhoc.2012.03.002