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