Skip to content
#edge computing Open access

Vehicle as a Service: Fuzzy Reward-Based Multi-Agent Deep Reinforcement Learning for Task Scheduling in Vehicular Edge Computing

Sep 2026 · Systems · 0 citations · 45 references

TL;DR

A reinforcement learning-based VEC task scheduling approach that integrates a fuzzy reward mechanism with multi-agent proximal policy optimization (FRMPPO) that satisfies the real-time processing demands of perception tasks in VaaS scenarios is proposed.

Abstract

Under the vehicle as a service (VaaS) paradigm, intelligent connected vehicles continuously generate large-scale, computation-intensive perception data processing tasks. However, limited onboard computing resources and power supply prevent vehicles from handling these tasks efficiently. Vehicular edge computing (VEC) extends available computing resources through vehicle–infrastructure collaboration. Nevertheless, continuous vehicle mobility causes intermittent communication links between vehicles and roadside units, posing new challenges for VEC task scheduling. Therefore, this paper proposes a reinforcement learning-based VEC task scheduling approach that integrates a fuzzy reward mechanism with multi-agent proximal policy optimization (FRMPPO). First, a system architecture is developed by integrating the directed acyclic graph task model, dynamic communication model, and computation model. The scheduling problem is formulated as a partially observable Markov decision process, with the objective of minimizing task completion latency and vehicle energy consumption. Second, a fuzzy reward mechanism is designed to guide the training of multi-agent proximal policy optimization. It takes edge node load pressure and communication state as inputs to adaptively combine local immediate rewards and the global reward, eventually guiding the agents toward a globally optimized cooperative policy. Finally, real-time scheduling decisions under communication intermittency are enabled through a centralized training and decentralized execution framework and gated recurrent unit-based state encoding. Simulation results demonstrate that FRMPPO effectively solves the VEC task scheduling problem, achieving significantly superior performance over existing algorithms in terms of both task completion latency and vehicle energy consumption. The proposed method thereby satisfies the real-time processing demands of perception tasks in VaaS scenarios.

Read PDF

Similar papers

#reinforcement learning Open access Oct 2026

Adaptive multi-agent optimization in intelligent-connected vehicles based on deep reinforcement learning

In order to provide offloading services for computationally demanding and time-sensitive operations on vehicles, multi-access edge computing has emerged as a successful paradigm. However, there are typically spatiotemporal load mismatches across edge servers due to significant vehicle mobility. As a result, task migrat...

Shi Dong, Suliman A. Alsuhibany, A. Smerat et al. · 0 citations
#edge computing Conference Sep 2026

Adaptive edge resource optimization for vehicle-edge cooperative perception with deep reinforcement learning

Vehicle-base station cooperative perception extends sensing coverage and detection precision in intelligent transportation systems. However, random task arrivals, heterogeneous communication-computing resources and short vehicle coverage residence time bring great difficulties to efficient task scheduling. To solve thi...

Feng-Hui Zhang, Xiang-Rui Xie, Jia-Xin Ma et al. · 0 citations
2026

SAC-Based Collaborative Task Offloading and Path Optimization for Vehicular Edge Computing

With the rapid development of Vehicle-to-Everything (V2X) and Vehicular Edge Computing (VEC), the massive computation-intensive tasks generated by intelligent vehicles during driving, including environmental perception, path planning, and autonomous driving decision-making, impose extremely high requirements on real-ti...

Jun Wang, Lin Chai, Yu-Mei Yang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Deadline-Aware Multi-Agent Reinforcement Learning for TSN-Based Vehicular Edge Networks

This work proposes a multi-agent reinforcement learning (MARL) approach for queue-level scheduling in TSN-enabled VEC and employs multi-agent proximal policy optimization (MAPPO) to enable coordinated yet autonomous scheduling decisions.

Bernardo A. C. Pereira, Marcos Carvalho, Fatih Temiz et al. · 0 citations
2026

Task Offloading in Marine Edge Clouds: A Lyapunov-Guided Multi-Agent DRL Approach

Maritime mobile edge computing (MMEC) has emerged as a key enabler for supporting computation-intensive vision applications on uncrewed surface vehicles (USVs). However, volatile maritime channels, heterogeneous computing resources, and mismatched task offloading strategies jointly lead to excessive energy consumption...

Wen-Qian Luo, Yanglong Sun, Wei-Jian Xu et al. · 0 citations
Sep 2026

Self-Attention Enhanced Multi-Agent Reinforcement Learning for UAV Trajectory Design in MEC Networks

Nowadays, Unmanned Aerial Vehicle (UAV)-assisted Mobile Edge Computing (MEC) has been widely recognized as a promising technique for flexibly and effectively handling computation-intensive and delay-sensitive tasks in 5G advanced and 6G networks. This paper investigates the joint optimization of UAV trajectory and comp...

Xue-Wei Zhang, Jian-Tao Li, Yuan Ren et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.