Age-of-Information Minimization for UAV-Based Multi-View Sensing and Communication
Bibliographic record
Abstract
Due to flexible deployment and controllable mobility, unmanned aerial vehicles (UAVs) have great potential for supporting many time-critical sensing applications. In this article, we investigate UAV-based wireless sensing and communication in which one UAV with an onboard camera sensor senses ground targets from multiple different views and transmits the sensing data to a remote ground controller (GC). With the objective of improving the freshness of the information received at the GC while ensuring the sensing quality, we develop aMUlti-view SensIng and Communication (MUSIC)framework and jointly optimize the parameters in the framework including the target visiting sequence, the number of sensing, UAV trajectory, service time and transmit power. To solve the corresponding mixed-integer non-convex problem, we propose a two-stage approach. Specifically, we first determine the target visiting sequence by considering a specific case, i.e., UAV senses each target only once, through the quadratic penalty (QP) and successive convex approximation (SCA) methods. Based on the obtained visiting sequence, we minimize the average peak age-of-information (PAoI) of all targets by jointly optimizing the variables contained in theMUSICframework via the SCA and exhaustion methods. Simulation results demonstrate that the proposed joint optimization approach outperforms the benchmark schemes.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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".