摘要
众所周知,停车诱导系统(PGIS)可以十分高效的帮助有停车需求的用户快速找到合适的停车场,它最便捷的方式就是直接把诱导信息发送给用户。但是,在现实生活中用户可能会受到各种因素的影响而选择不服从系统的诱导。针对此类现象,基于Stackelberg多轮博弈的原理,构造了一个PGIS与用户之间的博弈模型。其目的是为了找到一种策略能让用户容易去接受且系统还能获得较高的整体收益。对博弈双方的策略集、博弈模型及模型中一些关键的要素,比如收益函数,博弈树,均衡条件都进行了详细的介绍。同时对均衡解的求解过程也有一个详细的分析。最后,VISSIM的仿真结果表明,所提方法可以有效地诱导车辆进入停车场,同时能很好地兼顾停车诱导系统的有效性和公平性。
As we know,parking guidance information system(PGIS)can help vehicles find appropriate parking lot more efficiently.Real-time guidance information is deliverd to vehicles,however,the guidance cannot always be followed due to various reasons in reality.This paper focuses this phenomenon and models the PGIS in view of multi-round Stackelberg game,aiming to find the guiding strategy which is most possible accepted by vehicles.In this paper,we had a detailed introduction for the strategy set of both sides of the game and some key elements of the mod el,such as the income function,the game tree and equilibrium condition.Meanwhile,the solution of the equilibrium condition also has a detailed analysis.Finally,the simulation based on VISSIM shows that the proposed strategy guides the vehicles effectively,highly taking in account the efficiency and fairness of parking.
作者
刘建明
朱宏伟
彭磊
LIU Jian-ming;ZHU Hong-wei;PENG Lei(School of Computer Science and Information Security,Guilin University of Electronic Technology,Guilin Guangxi 541004,China;Shenzhen Institutes of Advanced Technology,Chinese Academy of Sciences,Shenzhen Guangdong 518055,China)
出处
《计算机仿真》
北大核心
2019年第6期166-170,共5页
Computer Simulation
基金
国家自然科学基金(61262074)
桂林电子科技大学研究生创新项目(YJCXS201542)
桂林电子科技大学计算机软件创新团队项目(桂电科2012(04))
关键词
博弈
停车诱导
二部图
网络最大流
Game
Parking guidance
Bipartite graph
Network maximum flow
