Multi-Agent Task Assignment in Vehicular Edge Computing: A Regret-Matching Learning-Based Approach

Bach Long Nguyen

doi:10.1109/TETCI.2023.3339540

2024-04-01

DOI：10.1109/TETCI.2023.3339540

原文链接

原文求助

摘要

En 中文

Vehicular edge computing has emerged as a solution for enabling computation-intensive applications within Intelligent Transportation Systems (ITS), encompassing domains like autonomous driving and augmented reality. Despite notable progress in this domain, the efficient allocation of constrained computational resources to a spectrum of time-critical ITS tasks remains a substantial challenge. We address this challenge by devising an innovative task assignment scheme tailored for vehicles navigating a highway. Given the high speed of vehicles and the limited communication radius of roadside units (RSUs), the dynamic migration of computation tasks among multiple servers becomes imperative. We present a novel approach that formulates the task assignment challenge as a binary nonlinear programming (BNLP) problem, managing the allocation of computation tasks from vehicles to RSUs and a macrocell base station. To tackle the potentially large dimensionality of this optimization problem, we develop a distributed multi-agent regret-matching learning algorithm. Incorporating the method of regret minimization, our proposed algorithm employs a forgetting mechanism that enables a continuous learning process, thereby accommodating the high mobility of vehicle networks. We prove that this algorithm converges towards correlated equilibrium solutions for our BNLP formulation. Extensive simulations, grounded in practical parameter settings, underscore the algorithm's ability to minimize total delay and task processing costs, while ensuring equitable utility distribution among agents.

Keyword:

Correlated equilibrium

intelligent transportation systems

multi-agent learning

regret matching

task assignment

vehicular edge computing