Dynamic Airspace Configuration Research Articles

Impact of Trajectories’ Uncertainty in Existing ATC Complexity Methodologies and Metrics for DAC and FCA SESAR Concepts

The most relevant SESAR 2020 solutions dealing with future Capacity Management processes are Dynamic Airspace Configuration (DAC) and Flight Centric ATC (FCA). Both concepts, DAC and FCA, rely on traffic flow complexity assessment. For this reason, complexity assessments processes, methods and metrics, become one of the main constraints to deal with the growing demand and increasing airspace capacity. The aim of this work is to identify the influence of trajectories’ uncertainty in the quality of the predictions of complexity of traffic demand and the effectiveness of Demand Capacity Balance (DCB) airspace management processes, in order to overcome the limitations of existing complexity assessment approaches to support Capacity Management processes in a Trajectory-Based Operations (TBO) environment. This paper presents research conducted within COTTON project, sponsored by the SESAR Joint Undertaking and EU’s Horizon 2020 research and innovation program. The main objective is to deliver innovative solutions to maximize the performance of the Capacity Management procedures based on information in a TBO environment.

Bayesian Network Modelling of ATC Complexity Metrics for Future SESAR Demand and Capacity Balance Solutions.

Demand & Capacity Management solutions are key SESAR (Single European Sky ATM Research) research projects to adapt future airspace to the expected high air traffic growth in a Trajectory Based Operations (TBO) environment. These solutions rely on processes, methods and metrics regarding the complexity assessment of traffic flows. However, current complexity methodologies and metrics do not properly take into account the impact of trajectories’ uncertainty to the quality of complexity predictions of air traffic demand. This paper proposes the development of several Bayesian network (BN) models to identify the impacts of TBO uncertainties to the quality of the predictions of complexity of air traffic demand for two particular Demand Capacity Balance (DCB) solutions developed by SESAR 2020, i.e., Dynamic Airspace Configuration (DAC) and Flight Centric Air Traffic Control (FCA). In total, seven BN models are elicited covering each concept at different time horizons. The models allow evaluating the influence of the “complexity generators” in the “complexity metrics”. Moreover, when the required level for the uncertainty of complexity is set, the networks allow identifying by how much uncertainty of the input variables should improve.

Dynamic airspace configuration by genetic algorithm

Abstract With the continuous air traffic growth and limits of resources, there is a need for reducing the congestion of the airspace systems. Nowadays, several projects are launched, aimed at modernizing the global air transportation system and air traffic management. In recent years, special interest has been paid to the solution of the dynamic airspace configuration problem. Airspace sector configurations need to be dynamically adjusted to provide maximum efficiency and flexibility in response to changing weather and traffic conditions. The main objective of this work is to automatically adapt the airspace configurations according to the evolution of traffic. In order to reach this objective, the airspace is considered to be divided into predefined 3D airspace blocks which have to be grouped or ungrouped depending on the traffic situation. The airspace structure is represented as a graph and each airspace configuration is created using a graph partitioning technique. We optimize airspace configurations using a genetic algorithm. The developed algorithm generates a sequence of sector configurations for one day of operation with the minimized controller workload. The overall methodology is implemented and successfully tested with air traffic data taken for one day and for several different airspace control areas of Europe.

Sectorization and Configuration Transition in Airspace Design

Current airspace is sectorized according to some predefined rules that are not flexible. To facilitate utilizing the airspace more efficiently, methods to design sectors need to be promoted. In this paper, we propose an undirected graph cut-based approach that employs a memetic local search-embedded constrained evolution algorithm, NSGA-II, to generate nondominated airspace configurations. We also propose a new concave hull-based method to automatically depict sector boundaries. In addition, we also study the configuration transition problem. We define the similarity of the two different configurations and calculate their similarity with a bisection diagram and a minimum cost flow algorithm. We build a forward network to represent configuration transitions across several consecutive time periods and use multiobjective dynamic programming to determine a series of nondominated configuration links from the first period to the end. We test our approaches by simulation in high-altitude airspace controlled by Beijing Area Control Center. The results show that our sectorization method outperforms the current configuration in practice, providing a lower sector number, lower intersector flow, more balanced workload distribution among the different sectors, and no constraint violations, so that the proposed approach shows its significant potential as practical applications for dynamic airspace configuration.

Dynamic airspace configuration method based on a weighted graph model

This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint.

Design and Evaluation of a Dynamic Sectorization Algorithm for Terminal Airspace

Given its static and rigid structure, the current National Airspace System lacks the ability to cope efficiently with the increasingly severe demand–capacity imbalances expected to develop over the coming years. To better accommodate the flexibility desired for future flight operations and to alleviate the demand–capacity imbalances, research initiatives have been conducted under the dynamic airspace configuration concept. Although most past dynamic airspace configuration researchers have focused on en route airspace, this paper investigates terminal airspace operations. A dynamic sectorization algorithm for terminal airspace is developed, which combines a -means clustering-based vertical sectorization algorithm, an integer-programming-based horizontal sectorization algorithm, and an -shapes-based airspace sectorization algorithm. This dynamic sectorization algorithm is validated with real traffic data from several major international airports in the United States and simulated traffic data with projected future air routes and traffic patterns. Performance evaluation demonstrates that the algorithm can improve the efficiency of terminal airspace utilization and reduce traffic complexity.

Dynamic Airspace Configuration Using Approximate Dynamic Programming

On the basis of weather and high traffic, the Next Generation Air Transportation System envisions an airspace that is adaptable, flexible, controller friendly, and dynamic. Sector geometries, developed with average traffic patterns, have remained structurally static with occasional changes in geometry due to limited forming of sectors. Dynamic airspace configuration aims at migrating from a rigid to a more flexible airspace structure. Efficient management of airspace capacity is important to ensure safe and systematic operation of the U.S. National Airspace System and maximum benefit to stakeholders. The primary initiative is to strike a balance between airspace capacity and air traffic demand. Imbalances in capacity and demand are resolved by initiatives such as the ground delay program and rerouting, often resulting in systemwide delays. This paper, a proof of concept for the dynamic programming approach to dynamic airspace configuration by static forming of sectors, addresses static forming of sectors by partitioning airspace according to controller workload. The paper applies the dynamic programming technique to generate sectors in the Fort Worth, Texas, Air Route Traffic Control Center; compares it with current sectors; and lays a foundation for future work. Initial results of the dynamic programming methodology are promising in terms of sector shapes and the number of sectors that are comparable to current operations.

Graph-Based Algorithm for Dynamic Airspace Configuration

In this paper, a new algorithm for dynamic airspace configuration is developed based on graph theory. A graph model is first constructed that accurately represents the air-route structure and air traffic in the National Airspace System. The airspace configuration problem is then formulated as a graph-partitioning problem to balance the subgraph (sector) workload while satisfying the capacity constraint, which is efficiently solved by a spectral clustering method. Since the original spectral clustering method shows some undesirable properties, such as disconnected subgraphs and unbalanced partitions, an algorithm is proposed to refine the partitions. Lastly, using the partitioned graph as an input, a novel airspace sectorization algorithm is developed, based on the graph search method. The new sectors computed by the sectorization algorithm have smooth boundaries and good geometrical shapes, which satisfy the minimum distance requirement (i.e., the sector boundaries are at least a minimum distance away from the airports, waypoints, and main air routes). The performance of the proposed dynamic airspace configuration algorithm is validated through various air-traffic scenarios with real air-traffic data.

Describing Airspace Complexity: Airspace Response to Disturbances

In ongoing efforts to balance air traffic demand and airspace capacity, airspace complexity stands as a fundamental research problem.This paper proposes a newnotion of airspace complexity by capturing howdifficult a given traffic situation is in terms of the control activity required to accommodate disturbances such as the entrance of another aircraft into the airspace. A complexity map is introduced that offers a graphical view of the control activity required to accept a new aircraft as a function of its essential parameters. The proposed method is illustrated with examples related to traffic flow management and dynamic airspace configuration.