分布式双深 Q 网络计算卸载方法,用于具有车对基础设施通信功能的互联车辆排队行驶

IF 2.3 4区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Yanjun Shi, Jinlong Chu, Xueyan Sun, Shiduo Ning
{"title":"分布式双深 Q 网络计算卸载方法,用于具有车对基础设施通信功能的互联车辆排队行驶","authors":"Yanjun Shi,&nbsp;Jinlong Chu,&nbsp;Xueyan Sun,&nbsp;Shiduo Ning","doi":"10.1049/itr2.12479","DOIUrl":null,"url":null,"abstract":"<p>Current connected vehicle applications, such as platooning require heavy-load computing capability. Although mobile edge computing (MEC) servers connected to the roadside intelligence facility can assist such separable applications from vehicles, it is a challenge to coordinate the allocation of subtasks among vehicles and MEC servers on the premise of ensuring communication quality. Therefore, an offloading algorithm is proposed based on a double deep Q-network to solve the placement of subtasks for vehicle to infrastructure and vehicle to vehicle cases. This algorithm considers the randomness of task generation and is model-free. The MEC server can assist the vehicle in training the neural network and storing relevant state transitions. To improve the performance of the algorithm, the decaying <span></span><math>\n <semantics>\n <mrow>\n <mi>ε</mi>\n <mo>−</mo>\n </mrow>\n <annotation>$\\varepsilon - $</annotation>\n </semantics></math>greedy policy is incorporated for faster convergence. The simulation results showed that this algorithm performed well in reducing the dropped subtask rate, average time delay, and total energy consumption.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":null,"pages":null},"PeriodicalIF":2.3000,"publicationDate":"2023-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.12479","citationCount":"0","resultStr":"{\"title\":\"A computation offloading method with distributed double deep Q-network for connected vehicle platooning with vehicle-to-infrastructure communications\",\"authors\":\"Yanjun Shi,&nbsp;Jinlong Chu,&nbsp;Xueyan Sun,&nbsp;Shiduo Ning\",\"doi\":\"10.1049/itr2.12479\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Current connected vehicle applications, such as platooning require heavy-load computing capability. Although mobile edge computing (MEC) servers connected to the roadside intelligence facility can assist such separable applications from vehicles, it is a challenge to coordinate the allocation of subtasks among vehicles and MEC servers on the premise of ensuring communication quality. Therefore, an offloading algorithm is proposed based on a double deep Q-network to solve the placement of subtasks for vehicle to infrastructure and vehicle to vehicle cases. This algorithm considers the randomness of task generation and is model-free. The MEC server can assist the vehicle in training the neural network and storing relevant state transitions. To improve the performance of the algorithm, the decaying <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>ε</mi>\\n <mo>−</mo>\\n </mrow>\\n <annotation>$\\\\varepsilon - $</annotation>\\n </semantics></math>greedy policy is incorporated for faster convergence. The simulation results showed that this algorithm performed well in reducing the dropped subtask rate, average time delay, and total energy consumption.</p>\",\"PeriodicalId\":50381,\"journal\":{\"name\":\"IET Intelligent Transport Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.3000,\"publicationDate\":\"2023-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.12479\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Intelligent Transport Systems\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/itr2.12479\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Intelligent Transport Systems","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/itr2.12479","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

目前的联网车辆应用(如排队)需要重载计算能力。虽然连接到路边智能设施的移动边缘计算(MEC)服务器可以协助这类与车辆分离的应用,但在保证通信质量的前提下,如何协调车辆和 MEC 服务器之间的子任务分配是一个难题。因此,本文提出了一种基于双深 Q 网络的卸载算法,以解决车辆到基础设施和车辆到车辆情况下的子任务分配问题。该算法考虑了任务生成的随机性,并且不需要模型。MEC 服务器可协助车辆训练神经网络并存储相关的状态转换。为了提高算法的性能,采用了衰减ε-$\varepsilon - $greedy策略,以加快收敛速度。仿真结果表明,该算法在降低子任务丢弃率、平均时延和总能耗方面表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A computation offloading method with distributed double deep Q-network for connected vehicle platooning with vehicle-to-infrastructure communications

A computation offloading method with distributed double deep Q-network for connected vehicle platooning with vehicle-to-infrastructure communications

A computation offloading method with distributed double deep Q-network for connected vehicle platooning with vehicle-to-infrastructure communications

Current connected vehicle applications, such as platooning require heavy-load computing capability. Although mobile edge computing (MEC) servers connected to the roadside intelligence facility can assist such separable applications from vehicles, it is a challenge to coordinate the allocation of subtasks among vehicles and MEC servers on the premise of ensuring communication quality. Therefore, an offloading algorithm is proposed based on a double deep Q-network to solve the placement of subtasks for vehicle to infrastructure and vehicle to vehicle cases. This algorithm considers the randomness of task generation and is model-free. The MEC server can assist the vehicle in training the neural network and storing relevant state transitions. To improve the performance of the algorithm, the decaying ε $\varepsilon - $ greedy policy is incorporated for faster convergence. The simulation results showed that this algorithm performed well in reducing the dropped subtask rate, average time delay, and total energy consumption.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Intelligent Transport Systems
IET Intelligent Transport Systems 工程技术-运输科技
CiteScore
6.50
自引率
7.40%
发文量
159
审稿时长
3 months
期刊介绍: IET Intelligent Transport Systems is an interdisciplinary journal devoted to research into the practical applications of ITS and infrastructures. The scope of the journal includes the following: Sustainable traffic solutions Deployments with enabling technologies Pervasive monitoring Applications; demonstrations and evaluation Economic and behavioural analyses of ITS services and scenario Data Integration and analytics Information collection and processing; image processing applications in ITS ITS aspects of electric vehicles Autonomous vehicles; connected vehicle systems; In-vehicle ITS, safety and vulnerable road user aspects Mobility as a service systems Traffic management and control Public transport systems technologies Fleet and public transport logistics Emergency and incident management Demand management and electronic payment systems Traffic related air pollution management Policy and institutional issues Interoperability, standards and architectures Funding scenarios Enforcement Human machine interaction Education, training and outreach Current Special Issue Call for papers: Intelligent Transportation Systems in Smart Cities for Sustainable Environment - https://digital-library.theiet.org/files/IET_ITS_CFP_ITSSCSE.pdf Sustainably Intelligent Mobility (SIM) - https://digital-library.theiet.org/files/IET_ITS_CFP_SIM.pdf Traffic Theory and Modelling in the Era of Artificial Intelligence and Big Data (in collaboration with World Congress for Transport Research, WCTR 2019) - https://digital-library.theiet.org/files/IET_ITS_CFP_WCTR.pdf
×
引用
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学术官方微信