Sep 2026· IEEE Internet of Things Journal· Vol 13, pp. 40522-40537· 0 citations· 37 references
Computer Science
Abstract
Multiaccess edge computing (MEC) has emerged as a key paradigm to empower resource-constrained edge devices through task offloading. However, dynamically fluctuating user preferences regarding latency and energy tradeoffs severely complicate the task scheduling and resource allocation, while existing methods struggle to accommodate this variability. To address this, we first formulate the dynamic-weight task offloading challenge as a nonconvex, nondeterministic polynomial-time (NP) hard multiobjective optimization problem (MOOP). We then propose a dynamic multiobjective task offloading framework built upon an enhanced proximal policy optimization algorithm to tackle this MOOP, namely DMT-PPO, which incorporates a dynamic reward structure and preference-aware subnetworks to effectively model user preferences and adapt to varying weight conditions. By introducing a discrete-continuous hybrid action space, DMT-PPO achieves the joint optimization across server selection, offloading decision, and computing provisioning. Moreover, DMT-PPO leverages a domain-based transfer learning (TL) paradigm coupled with an edge caching mechanism to accelerate both training and decision processes, enabling fine-grained coordination among heterogeneous task, device, and edge server settings. Extensive experiments demonstrate our framework’s superiority in dynamic environments, achieving up to 12.5% energy savings and a 10.6% reduction in task completion time, alongside a $3.5\times $ improvement in training efficiency compared to state-of-the-art baselines like Hybrid-PPO.
A constraint-aware multi-agent edge collaborative offloading algorithm (CARE-CTDE) that achieves better scheduling performance, resource utilization, and constraint satisfaction than baseline methods in dynamic heterogeneous MEC scenarios, demonstrating its effectiveness and robustness for constrained edge computing sy...
Yuxuan Yang, Hexing Wang, Yang Zhou· Mathematics· 0 citations
This study jointly optimizes task offloading and system resource scheduling to minimize the long-term delay–energy cost of NOMA-MEC systems using a master-refined multi-agent proximal policy optimization algorithm.
This paper addresses the joint task offloading and resource allocation problem in multi-user MEC systems and proposes a decentralized control framework based on Multi-Agent Reinforcement Learning (MARL), which achieves lower total system cost and faster convergence than the full-local, full-offload, and heuristic basel...
Youssef Oukissou, Mohamed Amine Meddaoui, Ayoub Belaidi et al.· International journal of Com...· 0 citations
A Mixed Integer Nonlinear Programming (MINLP) model with the objective of a weighted sum of long-term average task completion rate, total latency and energy consumption is established, which improves the task completion rate by 4% in high load scenarios and achieves a better balance between latency and energy consumpti...
Mobile edge computing (MEC) enables mobile devices to offload computation-intensive tasks to nearby edge nodes in order to reduce delay and improve service continuity. The Quality-of-Experience-Oriented Computation Offloading (QECO) algorithm addresses this problem through a QoE-oriented deep reinforcement learning fra...
Najlaà Abdulrahman Abu-Taleb, A. Zahary, Asma Alshargabi et al.· 2026 6th International Confe...· 0 citations
A task-driven offloading algorithm based on Balanced Multi-Agent Deep Deterministic Policy Gradient (BMADDPG) that reduces average task processing latency by approximately 22.67% and decreases total system cost by at least 18.32% under high-load scenarios.
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· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
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.