Optimization of a Park Spot Route based on the A* Algorithm

Finding a free parking spot in crowded cities is a big challenge in today's daily life. Cruising for a free on-street parking lot raises emissions, causes a lot of stress for the driver and congests the city. This paper presents an approach to optimize the way of finding a free spot, while saving in-vehicle and walking time for the user. A park spot routing (PSR) algorithm, using on-street parking information, is presented and evaluated. It is based on the A* algorithm, a shortest path algorithm developed from the Dijkstra algorithm. The A* algorithm has the advantage that it can easily be adapted and implemented. For the PSR the cost function and heuristic of the A* is adapted so that it takes the travel time on a road segment, the expected walking distance and the parking probability into account. Simulation results in the city of Munich and Cologne showed that the PSR can help the driver to find a free on-street parking spot in a very efficient way, which makes random cruising for a free spot unnecessary. Finally, a short outlook on possible further developments will be given.

[1]  Gordon Isaac,et al.  Split Routing as a Part of the Urban Navigation , 2012 .

[2]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[3]  Jian Pei,et al.  Probabilistic path queries in road networks: traffic uncertainty aware path selection , 2010, EDBT '10.

[4]  Graham Morgan,et al.  Smart Routing: A Novel Application of Collaborative Path-Finding to Smart Parking Systems , 2014, 2014 IEEE 16th Conference on Business Informatics.

[5]  Martin Margreiter,et al.  A Concept for Crowdsourcing of In-Vehicle Data to Improve Urban On-Street Parking , 2015 .

[6]  Chen Hong,et al.  Coorporative Parking Negotiation and Guidance Based on Intelligent Agents , 2009, 2009 International Conference on Computational Intelligence and Natural Computing.

[7]  Tobias Friedrich,et al.  Probabilistic Routing for On-Street Parking Search , 2016, ESA.

[8]  Klaus Bogenberger,et al.  Adapting the A* algorithm for park spot routing , 2017 .

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10]  Matthias Schubert,et al.  Probabilistic Resource Route Queries with Reappearance , 2015, EDBT.

[11]  Slobodan Vucetic,et al.  ParkAssistant: An Algorithm for Guiding a Car to a Parking Spot , 2016 .

[12]  Elena Deza,et al.  Encyclopedia of Distances , 2014 .

[13]  Klaus Bogenberger,et al.  A New Algorithm for Park Spot Routing Including On-Street Parking and Parking Garages , 2018 .