Real-Time Optimized Path Planning and Energy Consumption for Data Collection in Unmanned Ariel Vehicles-Aided Intelligent Wireless Sensing
Bibliographic record
Abstract
In this article, we consider a new unmanned ariel vehicles (UAV)-aided intelligent wireless sensing scheme, where the UAVs are deployed for smart sensing and collecting data from Internet-of-Things (IoT) devices. In particular, we propose optimal UAVs’ path planing approaches for minimizing the completion time and total energy consumption of the UAVs’ deployment for data collection. Two optimal schemes, namely, optimal energy consumption by peer-to-peer UAV-IoT sensing networks and optimal energy consumption by clustering UAV-IoT sensing networks, are considered. The low-complexity procedures of our advanced optimization techniques are suitably applied to disaster relief networks when the solving time must be strictly adhered to. Our real-time optimization algorithms result in low computational complexity with fast deployment and low processing time for solving the problem of tracking and gathering sensor data, i.e., in very short time (milliseconds). Through simulations results we demonstrate that our proposed approaches in UAV-aided intelligent IoT wireless sensing are suitable for time-critical mission applications such as emergency communications, public safety, and disaster relief networks.
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.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".