Optimizing Trajectory of Unmanned Aerial Vehicles for Efficient Data Acquisition: A Matrix Completion Approach
Bibliographic record
Abstract
In this paper, unmanned aerial vehicles (UAVs) are used to efficiently collect information in an areas of interest. Based on the matrix completion, an optimal UAV data collection trajectory (OUDCT) scheme is proposed for improving energy efficiency and reducing redundant data by optimizing the trajectory of the UAV. With the proposed scheme, the backbone sampling points can be selected as follows. First, sampling points with higher degrees are selected as dominator sampling points. Second, sampling points with lower degrees are selected as virtual dominator sampling points to ensure that the information in all rows and columns is collected. Third, sampling points with lower degrees are selected as follower sampling points until the total number of selected sampling points satisfies the minimum requirement of the matrix completion. Thus, all the information in the monitoring area can be recovered by using the matrix completion. Finally, the optimal simulated annealing algorithm is used to plan the path of UAV based on the selected sampling points. The experimental results indicate that the performance of the OUDCT scheme is better than those in previous studies. Extensive simulation results are provided, which demonstrate that the OUDCT scheme can reduce data redundancy by 50%-52% and increase the lifetime by 17% compared with the random selection sampling points scheme.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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".