论文标题
通信和计算资源优化,用于连接的自动驾驶
Communication and Computing Resource Optimization for Connected Autonomous Driving
论文作者
论文摘要
运输系统面临着急剧的破坏,因为连接的自动驾驶汽车(CAV)可以借助车辆到车辆(V2V)通信,使人们无法驾驶并提供良好的驾驶体验。尽管骑士在驾驶安全性,车队稳定性和道路交通吞吐量方面带来了好处,但大多数现有工作旨在仅改善这些性能指标之一。但是,这些指标可能相互竞争,因为它们在路段中共享相同的通信和计算资源。从联合优化驾驶安全性,车队稳定性和道路交通吞吐量的角度来看,有关互联自动驾驶的资源管理的研究差距很大。在本文中,我们首先探讨了驾驶安全性,车队稳定性和道路交通吞吐量的关节优化,该方法通过利用共识交替方向算法算法(ADMM)进行了优化。但是,有限的沟通带宽和机上处理能力会引起骑士的资源竞争。接下来,我们将分析基于竞争的媒介访问中的多个任务竞赛,以达到与V2V相关的应用程序卸载的上限延迟。提出了一种有效的睡眠多臂匪徒基于树木的算法来解决资源分配问题。进行了一系列模拟实验,以验证所提出的算法的性能。
Transportation system is facing a sharp disruption since the Connected Autonomous Vehicles (CAVs) can free people from driving and provide good driving experience with the aid of Vehicle-to-Vehicle (V2V) communications. Although CAVs bring benefits in terms of driving safety, vehicle string stability, and road traffic throughput, most existing work aims at improving only one of these performance metrics. However, these metrics may be mutually competitive, as they share the same communication and computing resource in a road segment. From the perspective of joint optimizing driving safety, vehicle string stability, and road traffic throughput, there is a big research gap to be filled on the resource management for connected autonomous driving. In this paper, we first explore the joint optimization on driving safety, vehicle string stability, and road traffic throughput by leveraging on the consensus Alternating Directions Method of Multipliers algorithm (ADMM). However, the limited communication bandwidth and on-board processing capacity incur the resource competition in CAVs. We next analyze the multiple tasks competition in the contention based medium access to attain the upper bound delay of V2V-related application offloading. An efficient sleeping multi-armed bandit tree-based algorithm is proposed to address the resource assignment problem. A series of simulation experiments are carried out to validate the performance of the proposed algorithms.