Communication capacity maximization in drone swarms
Bibliographic record
Abstract
Employment of unmanned aerial vehicles (UAVs) or drones as swarms of coordinating nodes offers multiple advantages for commercial as well as military applications. However, the complex communication requirements of these swarms, coupled with high data rates of advanced UAV payloads, require innovative techniques for optimizing data throughput. Channel capacity being the key resource, optimum communication architecture and network topology is critical to ensure quality of service while remaining within transmission power constraints. This paper proposes a capacity maximization approach for swarm communication architectures using mixed-integer nonlinear programming (MINLP). These techniques are designed to tackle optimization applications involving both discrete variables and nonlinear system dynamics. Mathematical model formulated considering system constraints and desired objective function establishes applicability of MINLP. Since MINLP problems are NP-hard in general, computational overheads and search space exponentially grow with number of nodes in the swarm. Therefore, outer approximation algorithm has been applied that achieves near-optimal solutions with reduced convergence time and complexity compared with exhaustive search. Applicability of algorithm regardless of selected communication architecture has been established through realistic simulations.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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".