4.6 Article

Hybrid Sensing Data Fusion of Cooperative Perception for Autonomous Driving With Augmented Vehicular Reality

期刊

IEEE SYSTEMS JOURNAL
卷 15, 期 1, 页码 1413-1422

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSYST.2020.3007202

关键词

Sensors; Task analysis; Visualization; Servers; Autonomous vehicles; Computational modeling; Optimization; Augmented vehicular reality (AVR); cooperative perception; multiaccess edge computing; task offloading

资金

  1. National Key Research and Development Program of China [2018YFB1800100, LZC0019]

向作者/读者索取更多资源

The proposed AVR algorithm utilizes computation offloading and resource allocation optimization to improve the efficiency of real-time data processing, achieving cooperative perception with hybrid sensing data fusion.
Augmented vehicular reality (AVR) is one of the key technologies to realize intelligent transportation in the future, which can significantly improve traffic safety and transportation efficiency of autonomous driving. However, available computation and spectrum resources of vehicles are not well utilized to meet the requirements of cooperative perception of autonomous vehicles. In order to meet the needs of sharing sensing data to cooperatively perceive the surrounding environment, executing delay-sensitive and computationally intensive tasks of autonomous driving applications, we propose computation offloading and resource allocation optimization for AVR (CoroAVR) algorithm with hybrid sensing data fusion of cooperative perception to process the real-time data in fog-edge computing for maximizing system throughput and spectrum utilization on the premise of ensuring the quality of task completion. First, the minimum signal to interference plus noise ratio needed to complete the task is obtained with the given maximum computing resources. Second, the optimal power allocation is carried out by using convex optimization theory, and the throughput gain is calculated, and the offloading decision is made by comparing the throughput gain. Finally, the channel allocation problem is solved by using the maximum matching algorithm of the bipartite graph, and the computation resource allocation is studied. The simulation results show that the performance of the proposed algorithm is better than that of the contrast algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据