基于网络-物理-社会动机的智能网联车辆协同排长选择

Siru Chen, Pengfei Zhu, W. Yan, Konglin Zhu, Lin Zhang
{"title":"基于网络-物理-社会动机的智能网联车辆协同排长选择","authors":"Siru Chen, Pengfei Zhu, W. Yan, Konglin Zhu, Lin Zhang","doi":"10.1109/ITSC.2019.8917372","DOIUrl":null,"url":null,"abstract":"Vehicle platoon service is considered as a promising framework for Intelligent Transportation System (ITS) to reduce energy cost, and meanwhile enhance driving safety and comfortability. In platoon service, platoon head takes the crucial role for the quality of service. The secure and trustworthy platoon heads with good driving skills will provide a better service than untrusted ones. How to motivate secure platoon heads for the platoon service becomes an interesting problem. In this paper, we formulate the trust platoon heads selection as a platoon utility maximization (PUM) problem. Then we employ game-theoretical approach showing that the PUM game is a potential game, and thus exists a Nash Equilibrium. Furthermore, we propose a cyber-physical-social approach to motivate vehicles to become platoon heads and at the same time maximize the platoon utility by seeking for the Nash Equilibrium. The extensive evaluation results show that the proposed platoon heads selection approach effectively stimulate more trustworthy users to be platoon heads and gains up to 60% more platoon utility compared with baseline methods.","PeriodicalId":6717,"journal":{"name":"2019 IEEE Intelligent Transportation Systems Conference (ITSC)","volume":"1 1","pages":"1173-1177"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cyber-Physical-Social Motivated Collaborative Platoon Heads Selection for Intelligent and Connected Vehicles\",\"authors\":\"Siru Chen, Pengfei Zhu, W. Yan, Konglin Zhu, Lin Zhang\",\"doi\":\"10.1109/ITSC.2019.8917372\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle platoon service is considered as a promising framework for Intelligent Transportation System (ITS) to reduce energy cost, and meanwhile enhance driving safety and comfortability. In platoon service, platoon head takes the crucial role for the quality of service. The secure and trustworthy platoon heads with good driving skills will provide a better service than untrusted ones. How to motivate secure platoon heads for the platoon service becomes an interesting problem. In this paper, we formulate the trust platoon heads selection as a platoon utility maximization (PUM) problem. Then we employ game-theoretical approach showing that the PUM game is a potential game, and thus exists a Nash Equilibrium. Furthermore, we propose a cyber-physical-social approach to motivate vehicles to become platoon heads and at the same time maximize the platoon utility by seeking for the Nash Equilibrium. The extensive evaluation results show that the proposed platoon heads selection approach effectively stimulate more trustworthy users to be platoon heads and gains up to 60% more platoon utility compared with baseline methods.\",\"PeriodicalId\":6717,\"journal\":{\"name\":\"2019 IEEE Intelligent Transportation Systems Conference (ITSC)\",\"volume\":\"1 1\",\"pages\":\"1173-1177\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Intelligent Transportation Systems Conference (ITSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2019.8917372\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Intelligent Transportation Systems Conference (ITSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2019.8917372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

车辆队列服务被认为是智能交通系统(ITS)中一个很有前途的框架,可以降低能源成本,同时提高驾驶安全性和舒适性。在排长服务中,排长对服务质量起着至关重要的作用。安全可靠、驾驶技术好的排长比不可信的排长提供更好的服务。如何为队列服务激励安全的排长成为一个有趣的问题。本文将信任排长选择问题表述为一个排效用最大化问题。然后运用博弈论方法证明了PUM博弈是一个潜在博弈,因此存在纳什均衡。此外,我们提出了一种网络-物理-社会方法来激励车辆成为排长,同时通过寻求纳什均衡来最大化排效用。广泛的评估结果表明,所提出的排长选择方法有效地激励了更多值得信赖的用户成为排长,与基线方法相比,排效用提高了60%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cyber-Physical-Social Motivated Collaborative Platoon Heads Selection for Intelligent and Connected Vehicles
Vehicle platoon service is considered as a promising framework for Intelligent Transportation System (ITS) to reduce energy cost, and meanwhile enhance driving safety and comfortability. In platoon service, platoon head takes the crucial role for the quality of service. The secure and trustworthy platoon heads with good driving skills will provide a better service than untrusted ones. How to motivate secure platoon heads for the platoon service becomes an interesting problem. In this paper, we formulate the trust platoon heads selection as a platoon utility maximization (PUM) problem. Then we employ game-theoretical approach showing that the PUM game is a potential game, and thus exists a Nash Equilibrium. Furthermore, we propose a cyber-physical-social approach to motivate vehicles to become platoon heads and at the same time maximize the platoon utility by seeking for the Nash Equilibrium. The extensive evaluation results show that the proposed platoon heads selection approach effectively stimulate more trustworthy users to be platoon heads and gains up to 60% more platoon utility compared with baseline methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信