Search arXiv⌕ Search

arXiv · 2610.39675

From Airspace Degradation to Deconfliction: Predicting Safety-Critical Traffic States through the Evolution of Multiscale Complexity Metrics

Abstract

Growing air traffic demand is pushing airspace management towards the limits of its operational capacity, with steadily increasing workload for air traffic control officers, with direct consequences for safety. Understanding which traffic conditions give rise to safety-critical situations is therefore an essential open problem. Here we compare a large number of deconfliction events with equivalent conflict-free scenarios, extracted from thirteen weeks of air traffic control data over the Swedish Flight Information Region. We describe the traffic structure before each event through thirty sector-complexity metrics computed at multiple spatial and temporal scales, and use them as inputs of Machine Learning models. We find that the need of deconflictions can be predicted with an accuracy reaching $70\%$, but only when the traffic is described at the sector spatial scale. Predictability increases monotonically in the minutes preceding the clearance, showing that situations requiring deconflicting actions are not sudden occurrences, but rather the endpoint of a progressive degradation process. Additionally, the information needed for such prediction mainly resides in specific characteristics of the overall traffic structure, and not only in the conflicting pair. These results numerically demonstrate that safety-critical airspace states can be anticipated from the collective behaviour of the traffic, paving the way for early-warning systems that flag degraded, safety-relevant conditions before an intervention is required.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raúl López-Martín, Justus Renkhoff, Yash Guleria, Mohsan Jameel, Massimiliano Zanin. 2026-10-29. From Airspace Degradation to Deconfliction: Predicting Safety-Critical Traffic States through the Evolution of Multiscale Complexity Metrics. https://arxiv.org/abs/2610.39675

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

CrowdEgress: A Multi-Agent Simulation Platform for Pedestrian Crowd

This article introduces a simulation platform to study complex crowd behavior in social context. The agent-based model is extended based on the social force model, and it mainly describes how agents interact with each other, and also with surrounding facilities such as walls, doors and exits. The simulation platform is compatible to FDS+Evac, and the input data in FDS+Evac could be imported into our simulation platform to create single-floor compartment geometry, and a flow solver is used to generate the roadmap towards exits. Most importantly, we plan to integrate advanced social and psychological theory into our simulation platform, especially investigating human behavior in emergency evacuation,such as pre-evacuation behavior, exit-selection activities, social group and herding effect and so forth.

physics.soc-ph↗

The distribution of violent event and interevent times in conflicts

Ongoing violent conflicts at all scales are interrupted by lulls without violence. Studies of interevent times found power-law distributions, based on coarse-grained data with a resolution of days or longer. Fine-grained data with a resolution of seconds or shorter is rare. Here, interevent times in violent conflicts are represented as multiplicative processes, and video-recorded street fights are used as fine grained data. For multiplicative processes, a mathematical theorem predicts that coarse grained data are power-law distributed, but fine grained data are lognormal. To the street violence data, however, the lognormal does not fit better than the power law (and vice versa), although the lognormal covers more data. Violent events, by contrast, take much energy and their durations are shorter, hence their distribution is better approximated by an exponential.

physics.soc-ph↗

Generalized Discrete Fractal Dimensions of Graph Families

Quantifying the self-similarity of complex networks via discrete fractal dimensions is a fundamental problem in network science. In this paper, we investigate some general fractal dimensions of graph families based on q-energy and Rényi entropy. We first establish several bounds for the energy, and then discuss the monotonicity, measure invariance of the dimensions, as well as some concrete graph families.

physics.soc-ph↗