Modeling Air Traffic Situation Complexity with a Dynamic Weighted Network Approach
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In order to address the flight delays and risks associated with the forecasted increase in air traffic, there is a need to increase the capacity of air traffic management systems. This should be based on objective measurements of traffic situation complexity. In current air traffic complexity research, no simple means is available to integrate airspace and traffic flow characteristics. In this paper, we propose a new approach for the measurement of air traffic situation complexity. This approach considers the effects of both airspace and traffic flow and objectively quantifies air traffic situation complexity. Considering the aircraft, waypoints, and airways as nodes, and the complexity relationships among these nodes as edges, a dynamic weighted network is constructed. Air traffic situation complexity is defined as the sum of the weights of all edges in the network, and the relationships of complexity with some commonly used indices are statistically analyzed. The results indicate that the new complexity index is more accurate than traffic count and reflects the number of trajectory changes as well as the high-risk situations. Additionally, analysis of potential applications reveals that this new index contributes to achieving complexity-based management, which represents an efficient method for increasing airspace system capacity.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| 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.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it