Aerial Computing: A New Computing Paradigm, Applications, and Challenges
Bibliographic record
Abstract
In existing computing systems, such as edge computing and cloud computing, several emerging applications and practical scenarios are mostly unavailable or only partially implemented. To overcome the limitations that restrict such applications, the development of a comprehensive computing paradigm has garnered attention in both academia and industry. However, a gap exists in the literature, owing to the scarce research, and a comprehensive computing paradigm is yet to be systematically designed and reviewed. This study introduces a novel concept, calledaerial computing, via the amalgamation of aerial radio access networks and edge computing, which attempts to bridge the gap. Specifically, first, we propose a novel comprehensive computing architecture that is composed of low-altitude computing (LAC), high-altitude computing (HAC), and satellite computing platforms, along with conventional computing systems. We determine that aerial computing offers several desirable attributes: global computing service, better mobility, higher scalability and availability, and simultaneity. Second, we comprehensively discuss key technologies that facilitate aerial computing, including energy refilling, edge computing, network softwarization, frequency spectrum, multiaccess techniques, artificial intelligence, and big data. In addition, we discuss vertical domain applications (e.g., smart cities, smart vehicles, smart factories, and smart grids) supported by aerial computing. Finally, we highlight several challenges that need to be addressed and their possible solutions.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.002 | 0.005 |
| Scholarly communication | 0.007 | 0.014 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".