Answers are grounded in this paper and cite their sources.
Demonstrates improved task offloading efficiency in vehicular networks, suggesting better resource management strategies.
In dynamic vehicular ad hoc networks (VANETs), high vehicle mobility and time varying communication links make task offloading highly uncertain. As the numbers of vehicles and tasks increase, the joint decision space grows rapidly under this uncertainty, which further complicates offloading optimization. Traditional reinforcement learning methods therefore often suffer from action‐space explosion and unstable convergence. To address this issue, we propose a hierarchical task‐enhanced fully decentralized multi‐agent proximal policy optimization method (HT‐FMPPO), which integrates a hierarchical reinforcement scheduling framework (HRS) and a target entropy driven adaptive entropy regularization mechanism (TEAR). The HRS decomposes joint offloading into batch level quota planning and task level execution location selection, thereby reducing decision complexity in large action spaces. The TEAR adjusts the entropy coefficient online based on the gap between current policy entropy and target policy entropy, thereby improving exploration in early training and reducing excessive randomness during convergence. The experimental results show that HT‐FMPPO reduces request completion time and total energy consumption across different vehicle and task scales, while achieving better convergence and stability.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: