Joint Optimization of AAV Deployment and Task Scheduling in Multi-AAV-Enabled Mobile Edge Computing Systems
Bibliographic record
Abstract
Mobile edge computing (MEC) is a highly promising approach for achieving low-latency and high-performance computing services for mobile users. However, traditional MEC systems face challenges in meeting the increasing demands of mobile users due to the limited coverage and flexibility of fixed MEC servers. Integrating unmanned aerial vehicles (UAVs) with MEC has gained significant attention as a promising way to improve the MEC networks’ performances and meet the demands of next-generation networks. UAVs can act as flying edge servers, providing mobile users with flexible and on-demand computing resources. This article shows a new way to use the grey wolf optimizer (JDTS-GWO) algorithm to improve both the placement of UAVs and the scheduling of tasks in a multi-UAV MEC system. The objective is to minimize the overall system’s energy consumption while meeting various constraints, such as UAV coverage, collision avoidance, and task execution requirements. The proposed approach formulates the joint optimization approach, considering the deployment of UAVs, offloading decisions, and resource allocation. An encoding scheme is proposed to represent UAV deployment and task allocation within the JDTS-GWO framework. Simulations demonstrate significant improvements in energy efficiency and task completion compared to existing benchmarks, with up to 35% energy savings and a 98% task completion rate. Sensitivity analysis confirms the approach’s scalability and robustness. The problem is modeled as a mixed-integer nonlinear programming (MINLP) problem, taking into account the consumed energy of mobile nodes, UAVs, and the MEC system. The JDTS-GWO algorithm is adapted to solve the optimization problem efficiently.
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.001 | 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".