A research team at Changsha University of Science and Technology in China has now tackled this question with an unusually comprehensive strategy. In a study published in Cluster Computing, Qiang Tang, Defa Ouyang, Heng Liu, and Lei Yang present a framework called VDDM, short for VM Dynamic partition and DRL-based Delay Minimization. The work targets a scenario with multiple drones serving multiple user equipments, the phones, sensors, and devices that generate computational workloads. The goal is deceptively simple to state and notoriously hard to achieve: minimize the total task delay experienced by all users simultaneously, while juggling virtual machine configuration, user-to-drone assignments, and the flight paths of the aircraft themselves.

The mathematical backbone of the study is a mixed-integer nonlinear programming problem, a class of optimization that combines continuous variables, such as a drone’s position in three-dimensional space, with discrete choices, such as which user connects to which drone and how many virtual machines each drone should run. Problems of this type are computationally brutal; the search space explodes combinatorially as the number of drones, users, and time slots grows. Solving them exactly is often infeasible in real time, which is precisely why the authors decomposed the challenge into three cooperating components rather than attacking it as one monolithic calculation.

The first component addresses a subtle but performance-critical issue that has plagued virtualized systems for years: input-output interference among virtual machines. When several VMs on the same physical host hammer the disk and network subsystems at once, they contend for shared I/O channels, and each one slows the others down. Prior research, including widely cited work on performance interference in virtualized cloud environments, has documented how badly I/O-heavy workloads can degrade when packed onto a single host. The VDDM framework counters this with a dynamic partition algorithm that adjusts the number of virtual machines on each drone according to the sizes of the tasks being processed. Instead of a fixed VM configuration, the partition adapts to the workload, reducing interference and keeping the drone’s parallel computing capacity genuinely usable.

The second component handles the matching problem between users and drones. In a multi-UAV network, every user wants to offload to the drone that will serve it fastest, but if everyone piles onto the same aircraft, that drone becomes a bottleneck while its neighbors idle. The researchers apply matching theory, a mathematical framework originally developed for economics problems like stable marriages and school assignments, to pair each user equipment with the UAV carrying the lowest load. This load-aware assignment spreads the computational demand across the fleet, preventing hotspots and smoothing out the queueing delays that build up when too many tasks land on one server at once.

The third and perhaps most visually striking component is the flight control layer. Where a drone hovers determines the quality of its wireless channel to each user, and therefore how fast data can flow during offloading. Optimizing trajectories jointly with everything else is what elevates this work beyond simple resource scheduling. The authors turn to deep reinforcement learning, specifically the Soft Actor-Critic algorithm, a technique that has become a favorite in control problems because it balances exploration of new actions against exploitation of known good ones. SAC learns a policy that guides each UAV’s flight path over time, continuously repositioning the aircraft to shorten transmission distances, improve channel conditions, and ultimately cut the end-to-end delay of every offloaded task.

Deep reinforcement learning deserves a moment of explanation for readers unfamiliar with it. In this paradigm, an agent, here the drone’s onboard decision system, observes the state of its environment, takes an action such as moving to a new coordinate, and receives a reward signal that reflects how well that action served the overall objective of minimizing delay. Over many training episodes, the neural network behind the agent learns which maneuvers and configurations yield the best long-term outcomes, even in environments too complex and dynamic for hand-written rules. SAC adds entropy to the reward, encouraging the agent to keep trying diverse actions rather than collapsing prematurely onto a mediocre strategy, which is one reason the approach tends to converge reliably in high-dimensional problems like multi-UAV trajectory planning.

The three components of VDDM do not operate in isolation; they form a pipeline in which each stage feeds the next. Task sizes inform the virtual machine partition, the partition shapes each drone’s effective capacity, capacity determines the sensible user-to-drone matches, and the resulting pattern of communication demands shapes the trajectories the SAC agent learns to fly. By formulating the whole system as a single MINLP objective before decomposing it, the authors ensure that the pieces pull in the same direction rather than optimizing themselves into conflict. This joint design philosophy reflects a broader trend in edge computing research, where treating offloading, resource allocation, and mobility as separate problems has repeatedly been shown to leave performance on the table.

How well does it actually work? According to the team’s extensive simulation results, VDDM significantly outperforms existing benchmark strategies in the two metrics that matter most for this class of system: total task delay and training convergence speed. The delay reduction follows directly from the framework’s ability to simultaneously cut I/O interference, balance loads across the fleet, and physically move computing power closer to the users who need it most. The faster convergence is a practical bonus with real consequences, because reinforcement learning systems that train slowly burn time and energy before they become useful, and in dynamic environments a policy that converges quickly adapts to changing user distributions sooner. The study reports its findings across a series of figures and algorithm descriptions that trace how each component contributes to the overall gain.

The implications stretch well beyond the simulation lab. Multi-UAV edge computing is a candidate technology for emergency response networks, where terrestrial base stations may be destroyed; for temporary mass gatherings, where cellular capacity buckles under demand; for precision agriculture and infrastructure inspection across vast rural areas; and for maritime and border surveillance, where earlier work by some of the same authors has explored latency minimization in aerial networks. In each of these settings, delay is not merely a quality-of-service statistic but often the difference between a useful system and a useless one. A framework that squeezes latency out of every layer of the stack, from the virtual machine scheduler to the flight controller, moves the field measurably closer to deployments that can be trusted under pressure.

The work also highlights a challenge the field is only beginning to confront honestly: the gap between idealized virtual machines and the messy physical reality of shared hardware. Much of the existing literature on UAV-assisted MEC treats a drone’s computing capacity as a clean, divisible quantity, ignoring the contention effects that arise when multiple workloads share the same I/O subsystem. By building I/O interference into the problem formulation and designing the dynamic partition algorithm specifically to mitigate it, the Changsha team grounds its optimization in a more realistic model of what actually happens inside a virtualized host. That realism, combined with learning-based trajectory control, suggests a template for future systems in which flying edge servers are not just a research curiosity but dependable infrastructure, quietly hovering overhead and making sure the computations that matter arrive on time.

Subject of Research: Delay minimization for computation offloading in multi-UAV assisted mobile edge computing using virtual machine partitioning and deep reinforcement learning

Article Title: A VM dynamic partition and drl based delay minimization offloading strategy for Multi-UAV assisted MEC

Article References: Tang, Q., Ouyang, D., Liu, H., & Yang, L. (2026). A VM dynamic partition and drl based delay minimization offloading strategy for Multi-UAV assisted MEC. Cluster Computing, 29(13), Article 737. https://doi.org/10.1007/s10586-026-06512-z

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06512-z

Keywords: mobile edge computing, unmanned aerial vehicles, virtual machines, deep reinforcement learning, Soft Actor-Critic, trajectory optimization, computation offloading, I/O interference, matching theory, mixed-integer nonlinear programming, task delay, UAV networks

The core challenge the researchers set out to tame is one of the hardest in edge computing. Wireless channels fluctuate constantly as signals are blocked, interfered with, and faded. Task arrivals are random and unpredictable. A device’s battery drains as it computes or transmits. If tasks arrive faster than the system can process them, the queues of waiting data at the edge server grow without bound, and the whole system becomes unstable. Traditional optimization methods struggle in this environment because they typically assume knowledge of future conditions that simply does not exist. Machine learning approaches, particularly deep reinforcement learning, can adapt to changing conditions, but they often fail to guarantee the long-term stability of the system’s queues and its average power consumption, which are the metrics that determine whether a network remains usable over hours and days rather than seconds.

RIASO attacks this problem by fusing three techniques that have rarely been combined so tightly. The first is Lyapunov optimization, a mathematical framework that converts long-term stability requirements into per-time-frame decisions. Instead of trying to plan far into an uncertain future, Lyapunov optimization maintains virtual queues that track accumulated data backlog and power consumption, and then makes each frame’s decision in a way that pushes those queues back toward zero. This provides a theoretical guarantee of long-term stability without needing to predict the future. The second ingredient is deep reinforcement learning, in which a neural network learns through trial and error which offloading decisions yield the best outcomes. The third, and arguably the most novel, is multi-output learning, which trains a single neural network to produce many candidate solutions simultaneously rather than just one.

The architecture that ties these together is an actor-critic structure, a well-established reinforcement learning pattern in which one component proposes actions and another evaluates them. In RIASO, the actor is a multi-input multi-output convolutional neural network, dubbed MIMO_CNN, that receives three pieces of information for every user device at each time frame: the current wireless channel gain, the length of the device’s data queue, and the length of its virtual power queue. From this input, the network generates not one but multiple candidate binary offloading decisions, each specifying which devices should compute locally and which should offload to the edge server. The critic then evaluates each candidate analytically, solving the remaining resource allocation problem, which is convex once the binary decisions are fixed, using an efficient primal-dual algorithm. The best action is selected, stored in a replay memory, and used to retrain the actor network.

This multi-output design is where RIASO departs most sharply from conventional actor-critic schemes, which typically use a single-output network and rely on random exploration to discover good actions. By generating many diverse candidate solutions in parallel, the MIMO_CNN naturally balances exploration and exploitation: the system can pick the best of many well-informed options rather than gambling on random perturbations of a single guess. The researchers report that this leads to more robust and faster convergence of the training process, which matters enormously in edge networks with high-dimensional action spaces where the number of possible offloading combinations grows exponentially with the number of devices.

Equally inventive is the way RIASO handles its own training schedule. In standard deep reinforcement learning, the model is retrained every time new experience accumulates, which is computationally expensive and can slow the system down. RIASO instead waits until its replay memory is completely full and then trains on the entire batch at once, setting the batch size equal to the memory size so that every stored sample is used and the memory is emptied. Moreover, training is triggered only if the current loss exceeds the minimum of all previous loss values, preventing wasteful retraining when the model is already performing well. The researchers found that this policy cut the training phase from roughly 10,000 time frames down to just 2,000, a fivefold reduction that directly translates into shorter response times and shorter data queues for users.

The team also carefully tuned the network’s structure. They examined how the number of output branches in the MIMO_CNN affects performance, discovering that with only five output layers the system behaved erratically, with unreasonable queue lengths, while configurations with ten or more layers converged reliably. After 2,000 time frames, the average data queue lengths for ten, twenty, and thirty output layers were nearly identical, so the researchers settled on ten as the sweet spot between convergence quality and computational cost. Similarly, they swept the size of the replay memory and sample batch, finding that a size of 256 offered the best balance: smaller memories risked trapping the model in local optima, while larger ones updated the data too slowly and lengthened training time.

To validate RIASO, the researchers ran simulations on a TensorFlow 2.0 platform modeling a multi-user MEC network in which an access point integrated with an edge server assists a set of user devices whose tasks arrive stochastically across consecutive time frames. Channel gains followed a Rician distribution built on a path-loss model, with devices positioned at varying distances from the server. The benchmarks included LyDROO, a well-known Lyapunov-guided deep reinforcement learning framework; DRL-DO, a distributed offloading framework using multiple convolutional networks; and three naive strategies: executing everything locally, executing everything at the edge, and executing randomly. Across the weighted sum computation rate, average data queue length, average power consumption, average energy queue length, and average response time per channel, RIASO delivered the best computation rate and the shortest data queue of all tested methods.

The comparison with LyDROO was particularly instructive. Under identical conditions and parameters, RIASO performed comparably on most metrics but achieved better results on average response time per channel, average data queue length, and average energy queue length, indicating a more stable system overall. DRL-DO showed better average power consumption than RIASO, but at the cost of instability across the other metrics, which the authors argue is a fatal flaw for real deployments where queue blowups mean dropped tasks and angry users. The naive strategies illustrated the trade-offs vividly: local execution minimized response time but produced a low computation rate and high energy queues, while edge execution minimized power consumption but created very long data queues, and random execution was poor on nearly every measure.

The implications reach well beyond the simulation lab. As 5G and future 6G networks push computing closer to users, the offloading decision layer becomes the nervous system of the entire edge infrastructure, and algorithms like RIASO demonstrate that it is possible to be simultaneously fast, energy-aware, and provably stable without clairvoyant knowledge of the future. The authors point to several directions for extending the work, including multitier offloading across edge, fog, and cloud layers, collaborative offloading among neighboring devices with spare resources, and support for partial offloading in which a task’s data is split between local and remote execution. For now, RIASO stands as a compelling proof that combining Lyapunov optimization’s stability guarantees with the adaptive intelligence of multi-output deep reinforcement learning can produce an offloading algorithm that is greater than the sum of its parts, one that keeps the edge responsive even as the wireless world around it refuses to sit still.

Subject of Research: Real-time adaptive computation offloading in multi-access edge computing using Lyapunov optimization and deep reinforcement learning

Article Title: A novel real-time integrated adaptive stable offloading (RIASO) algorithm in multi-access edge computing

Article References: Elhadidy, H., Saleh, H., Rizk, R., & Saber, W. (2026). A novel real-time integrated adaptive stable offloading (RIASO) algorithm in multi-access edge computing. Cluster Computing, 29(14), Article 796. https://doi.org/10.1007/s10586-026-06444-8

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06444-8

Keywords: edge computing, mobile edge computing, computation offloading, deep reinforcement learning, Lyapunov optimization, multi-output learning, Internet of Things, queue stability, actor-critic, convolutional neural network, energy efficiency, wireless networks