Energy-Efficient Joint Trajectory and Reflecting Design in IRS-Enabled UAV Edge Computing
Bibliographic record
Abstract
Intelligent Reflecting Surface (IRS) enabled Unmanned Aerial Vehicle (UAV) edge computing, a new communication technology, can provide sufficient capacity for edge computing system. However, due to the Line-of-Sight (LoS) or the Non Line of Sight (NLoS) of communicating environments will impact transmitting rate or delay, the Intelligent Reflective Surface (IRS) can be utilized to compensate the channel fading in the IRS-enabled UAV edge computing. In this paper, the joint problem of IRS phase shift, UAV trajectory and power allocation in the system is investigated, aiming to maximize the energy efficient. The corresponding optimization problem, which consists of mixed integer nonlinear programming problem, is formulated. To solve the problem, the original problem is decomposed into two subproblems, and an iterative method framework based on ConVex optimization and Deep Reinforcement Learning (CV-DRL) is proposed. Given the UAV trajectory and IRS phase shift, the Convex optimization algorithm is used to solve the power allocation schemes. Then, given the power allocation schemes, the Double Deep Q Network (Double DQN) and Deep Deterministic Policy Gradient (DDPG) algorithms are utilized to solve the problem of optimal UAV trajectory and IRS phase shift. The simulation results demonstrate that our proposed method outperforms other schemes in terms of energy efficiency, providing significant enhancements
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.000 |
| 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.002 | 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".