Profit Maximization for Multi-Time-Scale Hierarchical DRL-Based Joint Optimization in MEC-Enabled Air-Ground Integrated Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we address the problem of the operator’s economic profit maximization in a multi-access edge computing (MEC)-enabled time division multiple access (TDMA)-based air-ground integrated networking (AGIN) network. We consider to optimize task placement and replacement, unmanned aerial vehicle (UAV) placement, UAV flight time, access control, and task offloading ratios in user devices (UDs) and the UAV. The optimization is constrained by storage capacity, task processing quality of service (QoS) requirements, and TDMA requirements, etc. Our optimization is conducted in two time scales. Task placement and replacement are performed in a coarse-grained time scale (frame), while other optimizations are conducted in a fine-grained time scale (time slot). Due to the high dynamics of the environment, finding a solution is challenging. To address this problem, we present a hierarchical deep reinforcement learning (DRL) algorithm. The high-level component is a deep Q network (DQN) agent responsible for obtaining task placement and replacement solutions within a frame. The low-level component is an improved deep deterministic policy gradient (IDDPG) agent, which is used to address task processing-related issues within a time slot. Our simulations illustrate that the proposed algorithm has good performance in economic profit maximization compared with other algorithms.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it