MPSO:自动驾驶云边缘聚合计算场景中任务卸载的优化算法

Xuanyan Liu, Rui Yan, Jung Yoon Kim, Xiaolong Xu
{"title":"MPSO:自动驾驶云边缘聚合计算场景中任务卸载的优化算法","authors":"Xuanyan Liu, Rui Yan, Jung Yoon Kim, Xiaolong Xu","doi":"10.1007/s11036-024-02310-2","DOIUrl":null,"url":null,"abstract":"<p>With the development of cloud computing and edge computing technologies, these technologies have come to play a crucial role in the field of autonomous driving. The autonomous driving sector faces unresolved issues, with one key problem being the handling of latency-sensitive applications within vehicles. Cloud computing and edge computing provide a solution by segmenting unresolved computing tasks and offloading them to different computing nodes, effectively addressing the challenges of high concurrency through distributed computing. While the academic literature addresses computation offloading issues, it often focuses on static scenarios and does not fully leverage the advantages of cloud computing and edge computing. To address these challenges, a multivariate particle swarm optimization (MPSO) algorithm tailored for the cloud-edge aggregated computing environment in the autonomous driving domain is proposed. The algorithm, grounded in real-world scenarios, considers factors that may impact computation latency, abstracts them into quantifiable attributes, and determines the priority of each task. Tasks are then assigned to optimal computing nodes to achieve a balance between computation time and waiting time, resulting in the shortest total average weighted computation latency time for all tasks. To validate the effectiveness of the algorithm, experiments were conducted using the self-designed CETO-Sim simulation platform. The algorithm’s results were compared with those of simulated annealing, traditional particle swarm optimization, purely local computation, and purely cloud-based computation. Additionally, comparisons with traditional algorithms were considered in terms of iteration count and result stability. The results indicate that the MPSO algorithm not only achieves optimal computation offloading strategies within specified time constraints when addressing computation offloading issues in the autonomous driving domain but also exhibits high stability. Furthermore, the algorithm determines the processing location for each computing task, demonstrating significant practical value.</p>","PeriodicalId":501103,"journal":{"name":"Mobile Networks and Applications","volume":"34 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MPSO: An Optimization Algorithm for Task Offloading in Cloud-Edge Aggregated Computing Scenarios for Autonomous Driving\",\"authors\":\"Xuanyan Liu, Rui Yan, Jung Yoon Kim, Xiaolong Xu\",\"doi\":\"10.1007/s11036-024-02310-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>With the development of cloud computing and edge computing technologies, these technologies have come to play a crucial role in the field of autonomous driving. The autonomous driving sector faces unresolved issues, with one key problem being the handling of latency-sensitive applications within vehicles. Cloud computing and edge computing provide a solution by segmenting unresolved computing tasks and offloading them to different computing nodes, effectively addressing the challenges of high concurrency through distributed computing. While the academic literature addresses computation offloading issues, it often focuses on static scenarios and does not fully leverage the advantages of cloud computing and edge computing. To address these challenges, a multivariate particle swarm optimization (MPSO) algorithm tailored for the cloud-edge aggregated computing environment in the autonomous driving domain is proposed. The algorithm, grounded in real-world scenarios, considers factors that may impact computation latency, abstracts them into quantifiable attributes, and determines the priority of each task. Tasks are then assigned to optimal computing nodes to achieve a balance between computation time and waiting time, resulting in the shortest total average weighted computation latency time for all tasks. To validate the effectiveness of the algorithm, experiments were conducted using the self-designed CETO-Sim simulation platform. The algorithm’s results were compared with those of simulated annealing, traditional particle swarm optimization, purely local computation, and purely cloud-based computation. Additionally, comparisons with traditional algorithms were considered in terms of iteration count and result stability. The results indicate that the MPSO algorithm not only achieves optimal computation offloading strategies within specified time constraints when addressing computation offloading issues in the autonomous driving domain but also exhibits high stability. Furthermore, the algorithm determines the processing location for each computing task, demonstrating significant practical value.</p>\",\"PeriodicalId\":501103,\"journal\":{\"name\":\"Mobile Networks and Applications\",\"volume\":\"34 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mobile Networks and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11036-024-02310-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mobile Networks and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11036-024-02310-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着云计算和边缘计算技术的发展,这些技术在自动驾驶领域发挥着至关重要的作用。自动驾驶领域面临着一些尚未解决的问题,其中一个关键问题是如何处理车内对延迟敏感的应用。云计算和边缘计算提供了一种解决方案,它们将未解决的计算任务分割并卸载到不同的计算节点,通过分布式计算有效解决了高并发性的挑战。虽然学术文献探讨了计算卸载问题,但往往侧重于静态场景,并没有充分利用云计算和边缘计算的优势。为了应对这些挑战,本文提出了一种为自动驾驶领域的云-边缘聚合计算环境量身定制的多变量粒子群优化(MPSO)算法。该算法以真实世界的场景为基础,考虑了可能影响计算延迟的因素,将其抽象为可量化的属性,并确定每个任务的优先级。然后将任务分配到最佳计算节点,以实现计算时间和等待时间之间的平衡,从而使所有任务的总平均加权计算延迟时间最短。为了验证该算法的有效性,我们使用自行设计的 CETO-Sim 仿真平台进行了实验。该算法的结果与模拟退火、传统粒子群优化、纯本地计算和纯云计算的结果进行了比较。此外,还考虑了与传统算法在迭代次数和结果稳定性方面的比较。结果表明,在解决自动驾驶领域的计算卸载问题时,MPSO 算法不仅能在规定时间内实现最优计算卸载策略,而且表现出很高的稳定性。此外,该算法还能确定每个计算任务的处理位置,具有重要的实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MPSO: An Optimization Algorithm for Task Offloading in Cloud-Edge Aggregated Computing Scenarios for Autonomous Driving

With the development of cloud computing and edge computing technologies, these technologies have come to play a crucial role in the field of autonomous driving. The autonomous driving sector faces unresolved issues, with one key problem being the handling of latency-sensitive applications within vehicles. Cloud computing and edge computing provide a solution by segmenting unresolved computing tasks and offloading them to different computing nodes, effectively addressing the challenges of high concurrency through distributed computing. While the academic literature addresses computation offloading issues, it often focuses on static scenarios and does not fully leverage the advantages of cloud computing and edge computing. To address these challenges, a multivariate particle swarm optimization (MPSO) algorithm tailored for the cloud-edge aggregated computing environment in the autonomous driving domain is proposed. The algorithm, grounded in real-world scenarios, considers factors that may impact computation latency, abstracts them into quantifiable attributes, and determines the priority of each task. Tasks are then assigned to optimal computing nodes to achieve a balance between computation time and waiting time, resulting in the shortest total average weighted computation latency time for all tasks. To validate the effectiveness of the algorithm, experiments were conducted using the self-designed CETO-Sim simulation platform. The algorithm’s results were compared with those of simulated annealing, traditional particle swarm optimization, purely local computation, and purely cloud-based computation. Additionally, comparisons with traditional algorithms were considered in terms of iteration count and result stability. The results indicate that the MPSO algorithm not only achieves optimal computation offloading strategies within specified time constraints when addressing computation offloading issues in the autonomous driving domain but also exhibits high stability. Furthermore, the algorithm determines the processing location for each computing task, demonstrating significant practical value.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信