4.6 Article

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

Journal

IEEE SYSTEMS JOURNAL
Volume 15, Issue 1, Pages 1413-1422

Publisher

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

Keywords

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

Funding

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

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available