Task Offloading and Resource Allocation in UAV-Assisted Vehicle Platoon System
Bibliographic record
Abstract
Vehicle platooning is a key application in the realm of smart connected vehicles and autonomous driving technologies, holding significant potential to enhance road utilization and save energy consumption. Simultaneously, within intelligent transportation systems, the limited computing resources of vehicle users themselves fail to meet the computational demands of various new applications. Therefore, addressing the ever-increasing computational demands of vehicles is an urgent problem that needs resolution. Unmanned Aerial Vehicle (UAV) equipped with edge computing servers leverage their advantages of flexible deployment and high maneuverability to promptly alleviate issues such as high latency and narrow bandwidth associated with processing remote data in cloud computing. This paper focuses on the scenario of UAV-assisted vehicle platooning, conducting research on task offloading and resource allocation mechanisms within UAV-assisted vehicle platooning systems. We construct a joint optimization problem for decision-making on task offloading, transmission power allocation, and CPU computing frequency allocation in UAV-assisted vehicle platooning systems. The objective is to minimize system energy consumption while ensuring the stability of the task computation queue. Since the formulated joint optimization problem is a mixed-integer nonlinear programming problem, we decompose it into two sub-problems and simultaneously transform them into Markov decision processes. Subsequently, we proposed a continuous optimization algorithm based on Block Coordinate Descent (BCD) and deep deterministic policy gradient(DDPG). Simulation results validate the effectiveness of this method, demonstrating comparatively low energy consumption under different network environments and parameter settings.
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.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".