TY - JOUR
T1 - Joint Task Offloading and Resource Allocation for Vehicle Platoon
T2 - A Nested Algorithm Based on Stackelberg Game
AU - Liu, Jiahui
AU - Du, Guodong
AU - Zou, Yuan
AU - Zhang, Xudong
AU - Wu, Jinming
AU - Sun, Wenjing
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2025/12
Y1 - 2025/12
N2 - With the increasing computational demands of intelligent connected vehicles (ICVs), traditional roadside mobile edge computing (MEC) faces resource and coverage limitations. As a mobile computing entity, a vehicle platoon enables coordinated resource scheduling and low-latency communication, serving as an effective supplement to edge computing. However, limited onboard resources make vehicle platoons insufficient for handling heavy task loads. This study focuses on the joint task offloading and resource allocation between vehicle platoons and MEC servers. An MEC-assisted vehicle platoon computing network (MVPCN) is constructed, where both platoon vehicles (PVs) and MEC servers serve as computing nodes. We formulate a joint optimization problem of task offloading and resource allocation in the vehicle platoon, aiming to minimize the long-term weighted cost of time and energy consumption. Given the complexity of the problem and the limitations of conventional solution methods, we design a discrete two-stage Stackelberg game (DTSG) to decompose the problem into two subproblems: leader [platoon leader (PL)] level and follower (computing nodes) level and prove the existence of a Stackelberg equilibrium (SE). Based on the game model, we propose a nested platoon task offloading and resource-allocation (NPTORA) algorithm. The leader employs the multiagent proximal policy optimization (MAPPO) to generate offloading decisions for the platoon, while the followers allocate computational resources using a dynamic priority-based hybrid optimization (DPHO) algorithm based on the received offloading decisions. Simulation results show that NPTORA outperforms baseline methods in task success, cost efficiency, and adaptability, demonstrating strong performance and practical potential.
AB - With the increasing computational demands of intelligent connected vehicles (ICVs), traditional roadside mobile edge computing (MEC) faces resource and coverage limitations. As a mobile computing entity, a vehicle platoon enables coordinated resource scheduling and low-latency communication, serving as an effective supplement to edge computing. However, limited onboard resources make vehicle platoons insufficient for handling heavy task loads. This study focuses on the joint task offloading and resource allocation between vehicle platoons and MEC servers. An MEC-assisted vehicle platoon computing network (MVPCN) is constructed, where both platoon vehicles (PVs) and MEC servers serve as computing nodes. We formulate a joint optimization problem of task offloading and resource allocation in the vehicle platoon, aiming to minimize the long-term weighted cost of time and energy consumption. Given the complexity of the problem and the limitations of conventional solution methods, we design a discrete two-stage Stackelberg game (DTSG) to decompose the problem into two subproblems: leader [platoon leader (PL)] level and follower (computing nodes) level and prove the existence of a Stackelberg equilibrium (SE). Based on the game model, we propose a nested platoon task offloading and resource-allocation (NPTORA) algorithm. The leader employs the multiagent proximal policy optimization (MAPPO) to generate offloading decisions for the platoon, while the followers allocate computational resources using a dynamic priority-based hybrid optimization (DPHO) algorithm based on the received offloading decisions. Simulation results show that NPTORA outperforms baseline methods in task success, cost efficiency, and adaptability, demonstrating strong performance and practical potential.
KW - Dynamic priority
KW - Stackelberg game
KW - mobile edge computing (MEC)
KW - multiagent proximal policy optimization (MAPPO)
KW - vehicle platoon
UR - https://www.scopus.com/pages/publications/105017587986
U2 - 10.1109/JIOT.2025.3616134
DO - 10.1109/JIOT.2025.3616134
M3 - Article
AN - SCOPUS:105017587986
SN - 2327-4662
VL - 12
SP - 53288
EP - 53307
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 24
ER -