Mobile-Aware Service Offloading for UAV-Assisted IoV: A Multiagent Tiny Distributed Learning Approach
Bibliographic record
Abstract
Unmanned aerial vehicles (UAVs)-assisted multi-access edge computing (MEC) platforms are becoming an increasingly popular solution for infrastructure-less Internet of Vehicles (IoVs) due to their mobility and flexibility. To address the challenges of uneven task offloading and vehicle mobility, in this paper, we propose a mobility-aware service offloading and migration scheme for UAV-assisted IoVs. We formulate the service placement, service migration, and UAV deployment as an optimization problem to minimize the serving delay of task addressing for IoVs, under a predefined long-term migration cost budget. To solve the problem, we use the Lyapunov optimization method to transform the long-term optimization into a real-time optimization problem. Additionally, we design a multi-agent deep deterministic policy gradient (MADDPG) algorithm to solve the problem. Compared with traditional central optimization methods, the proposed algorithm can achieve a near-global optimal policy by leveraging only local observation information. Simulation results show that the proposed MADDPG algorithm can achieve good convergence performance, and the proposed scheme can achieve quasi-optimal performance in terms of serving delay, service offloading rate, and service migration cost.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".