Design of Parking Guidance System Based on Stackelberg Game

DOI

10.2991/itim-17.2017.25How to use a DOI?

Keywords

PGS, Stackelberg game, Bipartite graph, Network maximum flow

Abstract

As we know, parking guidance system (PGS) can help vehicles find appropriate parking lot more efficiently. Real-time guidance information delivers to vehicles; however, vehicles don't always follow the guidance due to various reasons in reality. This paper focuses this phenomenon and design the PGS in the view of multi-round Stackelberg game, aiming to recommend the target parking lot most possible be accepted by vehicles and help them complete parking. The static architecture of PGS is established and essential components such as front-end application and back-end web server are structured according to the needs of users. In dynamic procedure, the model of game between PGS and vehicles is also established and analyzed. Finally, the performance of PGS shows it can guide vehicles effectively, highly taking in account the efficiency and fairness of parking.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hongwei Zhu
AU  - Lei Peng
AU  - Huiyun Li
AU  - Jianming Liu
AU  - Xinling Zhou
AU  - Shi Dong
PY  - 2017/08
DA  - 2017/08
TI  - Design of Parking Guidance System Based on Stackelberg Game
BT  - Proceedings of the 2017 International Conference on Information Technology and Intelligent Manufacturing (ITIM 2017)
PB  - Atlantis Press
SP  - 99
EP  - 102
SN  - 1951-6851
UR  - https://doi.org/10.2991/itim-17.2017.25
DO  - 10.2991/itim-17.2017.25
ID  - Zhu2017/08
ER  -