Cooperative Multi-Agent Deep Reinforcement Learning for Dynamic Task Execution and Resource Allocation in Vehicular Edge Computing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00384527" target="_blank" >RIV/68407700:21230/25:00384527 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/TVT.2024.3520637" target="_blank" >https://doi.org/10.1109/TVT.2024.3520637</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TVT.2024.3520637" target="_blank" >10.1109/TVT.2024.3520637</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Cooperative Multi-Agent Deep Reinforcement Learning for Dynamic Task Execution and Resource Allocation in Vehicular Edge Computing

Popis výsledku v původním jazyce

Computer vision plays a crucial role in enabling connected autonomous vehicles (CAVs) to observe and comprehend their surroundings. The computer vision tasks are typically based on convolutional neural networks (CNNs). However, CNNs often require significant processing power. Techniques like early exiting and split computing enhance CNN task execution latency and adaptability to varying environmental conditions. Since the split computing introduces additional overhead for offloading of the task from the CAV to an edge servers, we incorporate multiple autoencoders within each split point to enhance the adaptability of splitting under varying environmental conditions. However, the autoencoders introduce an additional layer of complexity related to the selection of the optimal compression strategy alongside the splitting and exiting decisions. To tackle this challenge, we introduce a novel approach based on the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm. This algorithm dynamically and jointly determines the most suitable exit point, split point, and autoencoder. Furthermore, the MADDPG-based approach considers other CAVs when selecting action, promoting cooperation among CAVs. Our results demonstrate that the proposed approach reduces latency up to 44.4% while maintaining at least comparable or even higher accuracy of the computed vision outcome compared to the state-of-the-art solutions.

Název v anglickém jazyce

Cooperative Multi-Agent Deep Reinforcement Learning for Dynamic Task Execution and Resource Allocation in Vehicular Edge Computing

Popis výsledku anglicky

Computer vision plays a crucial role in enabling connected autonomous vehicles (CAVs) to observe and comprehend their surroundings. The computer vision tasks are typically based on convolutional neural networks (CNNs). However, CNNs often require significant processing power. Techniques like early exiting and split computing enhance CNN task execution latency and adaptability to varying environmental conditions. Since the split computing introduces additional overhead for offloading of the task from the CAV to an edge servers, we incorporate multiple autoencoders within each split point to enhance the adaptability of splitting under varying environmental conditions. However, the autoencoders introduce an additional layer of complexity related to the selection of the optimal compression strategy alongside the splitting and exiting decisions. To tackle this challenge, we introduce a novel approach based on the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm. This algorithm dynamically and jointly determines the most suitable exit point, split point, and autoencoder. Furthermore, the MADDPG-based approach considers other CAVs when selecting action, promoting cooperation among CAVs. Our results demonstrate that the proposed approach reduces latency up to 44.4% while maintaining at least comparable or even higher accuracy of the computed vision outcome compared to the state-of-the-art solutions.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/LUASK22064" target="_blank" >LUASK22064: Prediktivní alokace výpočetních prostředků pro autonomní řízení na hraně sítě</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Transactions on Vehicular Technology

ISSN

0018-9545

e-ISSN

1939-9359

Svazek periodika

74

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

16

Strana od-do

5741-5756

Kód UT WoS článku

001470980100035

EID výsledku v databázi Scopus

2-s2.0-105003233950