Energy-efficient data routing in cooperative UAV swarms for medical assistance after a disaster
Bibliographic record
Abstract
Medical assistance is crucial to disaster management. In particular, the situation of survivors as well as the environmental information after disasters should be collected and sent back to cloud/data centers immediately for further interpretation and analysis. Recently, unmanned aerial vehicle (UAV)-aided disaster management has been considered a promising approach to enhance the efficiency of searching and rescuing survivors after a disaster, in which a group of UAVs collaborates to accomplish the search and rescue task. However, the battery capacity of UAVs is a critical shortcoming that limits their usage. Worse still, the unstable network connectivity of disaster sites could lead to high latency of data transmission from UAV to remote data centers, which could make significant challenges on real-time data collecting and processing. To solve the above problems, in this paper, we investigate an energy-efficient multihop data routing algorithm with the guarantee of quality-of-service for UAV-aided medical assistance. Specifically, we first study the data routing problem to minimize the energy consumption considering transmission rate, time delay, and life cycle of the UAV swarms. Then, we formulate the issue as a mixed-integer nonlinear programming model. Because of the Non-deterministic Polynomial-hardness of this problem, we propose a polynomial time algorithm based on a genetic algorithm to solve the problem. To achieve high efficiency, we further enhance our algorithm based on DBSCAN and adaptive techniques. Extensive experiments show that our approach can outperform the state-of-the-art methods.
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.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".