2026· IEEE Transactions on Cognitive Communications and Networking· Vol 12, pp. 10573-10588· 0 citations· 38 references
Abstract
Vehicular edge computing (VEC) has emerged as a key paradigm to support computation-intensive and delay-sensitive vehicular applications by offloading tasks from vehicles to nearby multi-access edge computing (MEC) servers. However, in realistic urban environments, task processing performance is heavily affected by heterogeneous vehicle-MEC interactions, spatiotemporal traffic dynamics, and continuously varying vehicle populations. To address these challenges, this paper considers a traffic-aware embodied edge intelligence-enabled vehicular network (EEIVN), where edge intelligence is grounded in the physical traffic environment by integrating VLM-based semantic perception with edge decision making. Based on this architecture, we formulate a reliability-constrained delay minimization problem (RDMP) by jointly optimizing task offloading ratio, computing resource allocation, and vehicle association, while constraining the queue reliability to mitigate queue-induced tail delay. To solve the NP-hard RDMP, we propose a VLM-multi-agent proximal policy optimization (VLM-MAPPO) approach that integrates a VLM-based traffic awareness method, a vehicle-adaptive MAPPO algorithm, and a vehicle association scoring and selection mechanism. Extensive simulations based on SUMO and CARLA demonstrate that the proposed VLM-MAPPO approach outperforms benchmarks in terms of task completion delay and tail delay, while maintaining comparable vehicle energy consumption and exhibiting robust scalability under dynamic traffic conditions and varying vehicle densities.
Vehicular edge computing (VEC), a key enabler for the Internet of Things (IoT) in intelligent transportation, addresses onboard processing constraints through collaborative task offloading among vehicles, facilitating latency-sensitive applications such as autonomous driving. However, developing efficient offloading strategies remains particularly challenging in high-density vehicular networks, where intensive computational demands coexist with severely constrained intervehicle communication ranges due to signal blockage. To handle this, we propose M4O, a mobility-aware task offloading framework supporting multihop, multiuser, and multitask offloading optimization. M4O intelligently integrates vehicle mobility patterns and enables relay-assisted offloading to enhance system effectiveness and robustness. The framework employs a dual-algorithm approach: the advantage actor–critic (A2C) for indivisible tasks and the hybrid proximal policy optimization (H-PPO) for divisible tasks, both optimized to minimize the temporally coupled composite cost of time and resources. Extensive experiments demonstrate that the deep reinforcement learning (DRL)-based solutions of M4O deliver stable and efficient offloading strategies, outperforming existing benchmarks by significant margins in cost efficiency. Our code is available at https://github.com/Zhouym1028/M4O
Momiao Zhou, Yimin Zhou, Yanshi Sun et al.· IEEE Internet of Things Jour...· 0 citations
6G vehicular services, including cooperative perception, augmented reality navigation, and high-definition map updating, need computation support close to moving vehicles. Vehicular Edge Computing (VEC) is a natural solution, but the offloading decision becomes difficult when wireless channel conditions, vehicle density, and edge server loads vary simultaneously. In this paper, we study joint task offloading and resource allocation in 6G VEC with high- and low-frequency cooperation (HL-FC). We formulate the problem as a decentralized partially observable Markov decision process (Dec-POMDP). Each vehicle decides its offloading ratio, transmission power, server association, and edge CPU request from local observations. To evaluate the proposed policy, we build a lightweight equation-driven Python simulator and compare MAPPO with Local-only, Edge-only, Random, and Greedy policies. Compared with Edge-only, MAPPO reduces the average system cost by 32.15%, 23.51%, and 17.13% under 10, 15, and 20 vehicles, respectively. It also improves the task completion rate by 21.00, 20.49, and 17.65 percentage points. Additional blockage experiments show that HL-FC keeps the policy more robust than high-frequency-only transmission under severe high-frequency blockage. The results reveal that MAPPO delivers better performance when edge resources become congested than in lightly loaded scenarios.
Zi-Heng Gu· 2026 8th International Confe...· 0 citations
Multi-access edge computing (MEC) enables computation-intensive perception and decision-making tasks in vehicular networks to be offloaded to nearby edge servers. Existing approaches usually fix the artificial intelligence (AI) inference model, overlooking how model selection jointly affects latency, energy consumption, and service reliability. We propose a hierarchical model selection and control (HMSC) framework based on deep reinforcement learning (DRL) for MEC-assisted vehicular networks. The framework couples a vehicle-layer MAPPO component that provides a communication interface representation for subchannel assignment and energy accounting with a centralized MEC-layer soft actor-critic (SAC) agent that, under SDN orchestration, adaptively selects lightweight or high-fidelity AI models and allocates computational resources. Accordingly, the core contribution of this paper lies in MEC-side model-aware computation control under an explicitly defined subchannel-contention abstraction, rather than in physical-layer transmit-power optimization. Both layers are guided by a composite objective that integrates normalized end-to-end (E2E) latency, normalized energy consumption, and a deadline-violation penalty. Using a discrete-time simulation framework, HMSC reduces E2E latency compared with static inference and non-hierarchical DRL baselines and sustains a higher deadline satisfaction ratio (DSR) under constrained uplink throughput and varying traffic loads. The learned policy is load-aware, favoring high-fidelity inference under light load and lightweight inference under congestion; a post hoc analysis using YOLOv5-family accuracy reference further quantifies the inference-quality implications of this adaptive selection behavior. These results show that coordinated MEC-side control of AI model selection and computation, under a shared deadline-aware objective, provides a robust latency–energy trade-off for MEC-assisted vehicular networks.
Inseok Song, S. Kang, Seyha Ros et al.· Italian National Conference...· 0 citations
With the rapid growth of Vehicular Edge Computing (VEC) and Mobile Edge Computing, efficient task offloading is essential for enhancing the computing and communication capabilities in vehicular networks. However, many existing methods suffer from slow convergence, load imbalance, and instability in dynamic, latency-sensitive environments. To address these challenges, we propose MAPPO-Lyapunov (MAPPO-L), a multi-agent offloading framework that integrates Multi-Agent Proximal Policy Optimization (MAPPO) with Lyapunov optimization. MAPPO-L enables distributed coordination among vehicles, roadside units (RSUs), and cloud servers, minimizing delay, improving resource utilization, and ensuring long-term stability. Lyapunov theory transforms long-term stability into per-slot optimizations, while MAPPO ensures efficient policy learning. An adaptive exploration mechanism dynamically adjusts exploration rates based on network dynamics, accelerating convergence and stabilizing training. Extensive simulations with real-world data show that MAPPO-L maintains task completion rates above 80%, converges 25%–37.5% faster than baselines, and reduces training fluctuations to 2.3%. Ablation studies confirm the critical roles of location, channel, and queue information, validating the robustness of MAPPO-L in practical VEC environments.
Lu Wei, Yong Yu, Jie Cui et al.· IEEE Transactions on Network...· 0 citations
In post-disaster or infrastructure-limited remote-area environments where local terrestrial networking infrastructure is unavailable or severely degraded, heterogeneous cloud–edge–ground (CEG) systems provide a viable platform for computation offloading. Ground devices such as IoT sensors and unmanned ground vehicles (UGVs) generate computation-intensive and latency-sensitive tasks, while fixed-wing unmanned aerial vehicles (UAVs) with edge servers offer intermediate processing and relay capabilities to the cloud. We aim to minimize system energy consumption and task latency by jointly considering offloading ratios, CPU frequencies and transmission power of the ground devices. However, efficiently partitioning tasks across these tiers is challenging due to dynamic wireless network conditions, limited onboard resources, and diverse task demands. We propose a temporal dynamics-aware multi-agent offloading and resource allocation framework for such CEG systems in this work. We introduce KAT-MAPPO, a Kolmogorov–Arnold Transformer-enhanced Multi-Agent Proximal Policy Optimization scheme. By embedding Kolmogorov–Arnold Network layers into the transformer encoder, the framework captures long-range temporal dependencies and improves feature representation, while MAPPO enables decentralized offloading under dynamic conditions. Resource allocation is further decoupled and solved analytically via convex optimization. Using a real-world setup, our simulation results show that KAT-MAPPO significantly outperforms existing baselines, achieving faster convergence, a 43% reduction in average task latency in the training evaluation setting, and up to 53.57% latency reduction for the case study scenarios, while also reducing energy consumption. These results highlight the promise of reinforcement learning considering temporal dynamics for efficient offloading in heterogeneous CEG systems.
Chenyang Wang, Qifeng Han· ACM Transactions on Internet...· 0 citations