Edge Computing-Aided Dynamic Wireless Charging and Trip Planning of UAVs
Bibliographic record
Abstract
In today’s era of rapid technological advancement, unmanned aerial vehicles (UAVs) are transforming sectors such as remote delivery, surveillance, and disaster response. However, challenges related to energy consumption and operational efficiency continue to hinder their broader adoption. To address these issues, this study proposes an integrated system design combining dynamic wireless charging (DWC), intelligent trip planning, and intelligent edge computing (IEC). The proposed system leverages IEC for local data processing to reduce latency and optimize energy management, 6G networks for real-time vehicle-to-infrastructure (V2I) communication, and DWC to enable efficient, on-the-go energy replenishment. Additionally, a dynamic arrival management algorithm is introduced to minimize UAV wait times to enhance operational efficiency. Simulations of this system demonstrated significant improvements: larger UAVs achieved an average charging efficiency of 91.2%, while smaller UAVs achieved 92.75%, with dynamic arrival management reducing wait times by an average of 1.5 min for smaller UAVs and 5.0 min for larger UAVs. These findings underscore the system’s effectiveness in optimizing UAV operations and charging efficiency. This integrated approach offers a scalable framework to enhance UAV capabilities and sets a benchmark for future advancements in operational efficiency and charging technology for urban and environmental applications.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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".