A constraint programming model with time uncertainty for cooperative flight departures

The lack of a proper integration of strategic Air Traffic Management decision support tools with tactical Air Traffic Control interventions usually generates a negative impact on the Reference Business Trajectory adherence, and in consequence affects the potential of the Trajectory-Based Operations framework. In this paper, a new mechanism relaying on Reference Business Trajectories as a source of data to reduce the amount of Air Traffic Controller interventions at the tactical level while preserving Air Traffic Flow Management planned operations is presented. Artificial Intelligence can enable Constraint Programming as it is a powerful paradigm for solving complex, combinatorial search problems. The proposed methodology takes advantage of Constraint Programming and fosters adherence of Airspace User’s trajectory preferences by identifying tight interdependencies between trajectories and introducing a new mechanism to improve the aircraft separation at concurrence events considering time uncertainty. The underlying philosophy is to capitalize present degrees of freedom between layered Air Traffic Management planning tools, when sequencing departures at the airports by considering the benefits of small time stamp changes in the assigned Calculated Take-Off Time departures and to enhance Trajectory-Based Operations concepts.     

Predicting the operational acceptance of airborne flight reroute requests using data mining

For tools that generate more efficient flight routes or reroute advisories, it is important to ensure compatibility of automation and autonomy decisions with human objectives so as to ensure acceptability by the human operators. In this paper, the authors developed a proof of concept predictor of operational acceptability for route changes during a flight. Such a capability could have applications in automation tools that identify more efficient routes around airspace impacted by weather or congestion and that better meet airline preferences. The predictor is based on applying data mining techniques, including logistic regression, a decision tree, a support vector machine, a random forest and Adaptive Boost, to historical flight plan amendment data reported during operations and field experiments. Cross validation was used for model development, while nested cross validation was used to validate the models. The model found to have the best performance in predicting air traffic controller acceptance or rejection of a route change, using the available data from Fort Worth Air Traffic Control Center and its adjacent Centers, was the random forest, with an F-score of 0.77. This result indicates that the operational acceptance of reroute requests does indeed have some level of predictability, and that, with suitable data, models can be trained to predict the operational acceptability of reroute requests. Such models may ultimately be used to inform route selection by decision support tools, contributing to the development of increasingly autonomous systems that are capable of routing aircraft with less human input than is currently the case.     

Generation and recovery of airborne delays in air transport

The analysis of the causes behind the appearance and propagation of delays is one of the major topics inside Air Transport Management research. Existing research focuses by and large on Air Traffic Flow Management regulations and reactionary delays; less attention has been devoted to the study of the mechanisms governing the generation and absorption of delays while airborne, in spite of their important economical and environmental consequences. Here we present a methodology to detect delay-generating events, based on the comparison of planned and real trajectories; these events are then used to characterise several aspects of the dynamics of the system, e.g. its resilience. We apply this methodology to a historical data set of flights crossing the European airspace during 2011, and observe an overall resilient system, able to absorb as much delays as it generates; yet resilience is not constant, but strongly depends on the phase of the flight, and shows high spatial and temporal heterogeneities. We anticipate the proposed methodology to open new doors for the development of a better systemic performance, by enabling the characterisation and understanding of this fundamental type of delay.     

Coordinated multi-aircraft 4D trajectories planning considering buffer safety distance and fuel consumption optimization via pure-strategy game

In this paper, we consider a coordinated multi-aircraft 4D (3D space plus time) trajectories planning problem which is illustrated by planning 4D trajectories for aircraft traversing an Air Traffic Control (ATC) sector. The planned 4D trajectories need to specify each aircraft’s position at any time, ensuring conflict-free and reducing fuel and delay costs, with possible aircraft maneuvers such as speed adjustment and flight level change. Different from most existing literature, the impact of buffer safety distance is also under consideration, and conflict-free is guaranteed at any given time (not only at discrete time instances). The problem is formulated as a pure-strategy game with aircraft as players and all possible 4D trajectories as strategies. An efficient maximum improvement distributed algorithm is developed to find equilibrium at which every aircraft cannot unilaterally improve further, without enumerating all possible 4D trajectories in advance. Proof of existence of the equilibrium and convergence of the algorithm are given. A case study based on real air traffic data shows that the algorithm is able to solve 4D trajectories for online application with estimated 16.7% reduction in monetary costs, and allocate abundant buffer safety distance at minimum separation point. Scalability of the algorithm is verified by computational experiments.     

Time to burn: Flight delay,terminal efficiency,and fuel consumption in the National Airspace System

Improved Air Traffic Management (ATM) leading to reduced en route and gate delay, greater predictability in flight planning, and reduced terminal inefficiencies has a role to play in reducing aviation fuel consumption. Air navigation service providers are working to quantify this role to help prioritize and justify ATM modernization efforts. In the following study we analyze actual flight-level fuel consumption data reported by a major U.S. based airline to study the possible fuel savings from ATM improvements that allow flights to better adhere to their planned trajectories both en route and in the terminal area. To do so we isolate the contribution of airborne delay, departure delay, excess planned flight time, and terminal area inefficiencies on fuel consumption using econometric techniques. The model results indicate that, for two commonly operated aircraft types, the system-wide averages of flight fuel consumption attributed to ATM delay and terminal inefficiencies are 1.0–1.5% and 1.5–4.5%, respectively. We quantify the fuel impact of predicted delay to be 10–20% that of unanticipated delay, reinforcing the role of flight plan predictability in reducing fuel consumption. We rank terminal areas by quantifying a Terminal Inefficiency metric based on the variation in terminal area fuel consumed across flights. Our results help prioritize ATM modernization investments by quantifying the trade-offs in planned and unplanned delays and identifying terminal areas with high potential for improvement.     

A hybrid machine learning model for short-term estimated time of arrival prediction in terminal manoeuvring area

4D trajectory prediction is the core element of future air transportation system, which is intended to improve the operational ability and the predictability of air traffic. In this paper, we introduce a novel hybrid model to address the short-term trajectory prediction problem in Terminal Manoeuvring Area (TMA) by application of machine learning methods. The proposed model consists of two parts: clustering-based preprocessing and Multi-Cells Neural Network (MCNN)-based prediction. Firstly, in the preprocessing part, after data cleaning, filtering and data re-sampling, we applied principal Component Analysis (PCA) to reduce the dimension of trajectory vector variable. Then, the trajectories are clustered into several patterns by clustering algorithm. Using nested cross validation, MCNN model is trained to find out the appropriate prediction model of Estimated Time of Arrival (ETA) for each individual cluster cell. Finally, the predicted ETA for each new flight is generated in different cluster cells classified by decision trees. To assess the performance of MCNN model, the Multiple Linear Regression (MLR) model is proposed as the comparison learning model, and K-means++ and DBSCAN are proposed as two comparison clustering models in preprocessing part. With real 4D trajectory data in Beijing TMA, experimental results demonstrate that our proposed model MCNN with DBSCAN in preprocessing is the most effective and robust hybrid machine learning model, both in trajectory clustering and short-term 4D trajectory prediction. In addition, it can make an accurate trajectory prediction in terms of Mean Absolute Error (MAE) and Root Mean Squared Error (RMSE) with regards to comparison models.     

Interactive image-based information visualization for aircraft trajectory analysis

Objectives: The objective of the presented work is to present novel methods for big data exploration in the Air Traffic Control (ATC) domain. Data is formed by sets of airplane trajectories, or trails, which in turn records the positions of an aircraft in a given airspace at several time instants, and additional information such as flight height, speed, fuel consumption, and metadata (e.g. flight ID). Analyzing and understanding this time-dependent data poses several non-trivial challenges to information visualization.Materials and methods: To address this Big Data challenge, we present a set of novel methods to analyze aircraft trajectories with interactive image-based information visualization techniques.As a result, we address the scalability challenges in terms of data manipulation and open questions by presenting a set of related visual analysis methods that focus on decision-support in the ATC domain. All methods use image-based techniques, in order to outline the advantages of such techniques in our application context, and illustrated by means of use-cases from the ATC domain.Results: For each considered use-case, we outline the type of questions posed by domain experts, data involved in addressing these questions, and describe the specific image-based techniques we used to address these questions. Further, for each of the proposed techniques, we describe the visual representation and interaction mechanisms that have been used to address the above-mentioned goals. We illustrate these use-cases with real-life datasets from the ATC domain, and show how our techniques can help end-users in the ATC domain discover new insights, and solve problems, involving the presented datasets.     

Future air traffic management systems and financial decision-making constraints

The object is to identify characteristics of feasible systems for UK – and European – Air Traffic Management (ATM) in the coming decades. ATM here covers Air Traffic Control (ATC) provision plus wider issues, such as airspace design. The analytical focus is on the financial decision-making processes and constraints that will act to shape this future system. R&D work into control workload and planning based on an "ATM core concept" are proposed as likely to offer the best way forward.     

Maximizing airborne delay at no extra fuel cost by means of linear holding

This paper introduces a linear holding strategy based on prior works on cruise speed reduction, aimed at performing airborne delay at no extra fuel cost, as a complementary strategy to current ground and airborne holding strategies. Firstly, the equivalent speed concept is extended to climb and descent phases through an analysis of fuel consumption and speed from aircraft performance data. This gives an insight of the feasibility to implement the concept, differentiating the case where the cruise flight level initially requested is kept and the case where it can be changed before departure in order to maximize the linear holding time. Illustrative examples are given, where typical flights are simulated using an optimal trajectory generation tool where linear holding is maximized while keeping constant the initially planned fuel. Finally, the effects of linear holding are thoroughly assessed in terms of the vertical trajectory profiles, range of feasible speed intervals and trade-offs between fuel and time. Results show that the airborne delay increases significantly with nearly 3-fold time for short-haul flights and 2-fold for mid-hauls to the cases in prior works.     

Strategic de-confliction in the presence of a large number of 4D trajectories using a causal modeling approach

This paper presents a strategic de-confliction algorithm based on causal modeling developed under the STREAM project and launched under the umbrella of the Single European Sky ATM Research (SESAR) Program. The basic underlying concept makes use of the enriched information included in the Shared Business Trajectories (SBTs) of the flights prior to takeoff (or in the Reference Business Trajectories (RBTs) if the flight is airborne) to allocate conflict-free trajectories in a traffic planning phase that should lead to an actual conflict-free scenario in the flight execution phase in the absence of flight and/or network uncertainties. The proposed approach could decrease the workload of the air traffic controllers, thus improving the Air Traffic Management (ATM) capacity while meeting the maximum possible expectations of the Airspace Users’ requirements in terms of horizontal flight efficiency. The main modules of the implemented system are also presented in this paper; these modules are designed to enable the processing of thousands of trajectories within a few seconds or minutes and encompass a global network scope with a planning horizon of approximately 2–3 h. The causal model applied for network conflict resolution and flight routing allocation is analyzed to demonstrate how the emergent dynamics (i.e., domino effects) of local trajectory amendments can be efficiently explored to identify conflict-free Pareto-efficient network scenarios. Various performance indicators can be taken into account in the multi-criteria optimization process, thus offering to the network manager a flexible tool for fostering a collaborative planning process.     

Conflict-free arrival and departure trajectory planning for parallel runway with advanced point-merge system

In this paper, an efficient trajectory planning system is proposed to solve the integration of arrivals and departures on parallel runways with a novel route network system. Our first effort is made in designing an advanced Point Merge (PM) route network named Multi-Level Point Merge (ML-PM) to meet the requirements of parallel runway operations. Then, more efforts are paid on finding a complete and efficient framework capable of dynamically modelling the integration of arrival and departure trajectories on parallel runways, modelling the conflict detection and resolution in presence of curved trajectory and radius-to-fix merging process. After that, a suitable mathematical optimization formulation is built up. Receding Horizon Control (RHC) and Simulated Annealing (SA) algorithms are proposed to search the near-optimal solution for the large scale trajectories in routine dense operations. Taking Beijing Capital International Airport (BCIA) as a study case, the experimental results show that our system shows good performances on the management of arrivals and departures. It can automatically solve all the potential conflicts in presence of dense traffic flows. With its unique ML-PM route network, it can realize a shorter flying time and a near-Continuous Descent Approach (CDA) descent for arrival aircraft, an economical climbing for departure aircraft, an easier runway allocation together with trajectory control solutions. It shows a good and dynamic sequencing efficiency in Terminal Manoeuvring Area (TMA). In mixed ML-PM mode, under tested conditions, our proposed system can increase throughput at BCIA around 26%, compared with baseline. The methodology defined here could be easily applied to airports worldwide.     

Impact of continuous climb operations on airport capacity

The full benefits of Continuous Climb Operations (CCO) are realised when CCO are performed without interruption. However, CCO require safe departures that necessarily implies a reduction in capacity at high density traffic airports. This paper quantifies the capacity impact due to the integration of CCO (conflict-free with other departures and arrivals) in a high density traffic airport. The methodology develops a scheduling algorithm, a conflict-detection and resolution algorithm, and Monte Carlo simulations. The scheduling algorithm calculates two schedules, one for departures and another for arrivals, considering the CCO Rate. The conflict-detection and resolution algorithm compares CCO and arrival trajectories to detect which aircraft pairs are in conflict. The Air Traffic Control (ATC) intervention required to solve the conflict is modelled by delaying the CCO take-off. Numerical simulations based on Monte Carlo techniques are used to analyse scheduling combinations that are statistically significant in terms of conflict, ATC interventions, total delay and capacity. The results show a 32% reduction in the maximum theoretical capacity with a CCO Rate of 100%. Despite the reduction, the number of CCO departures is above the maximum operational capacity (50% of the maximum theoretical capacity). This implies that with optimised scheduling it is possible for all departures to be CCO.     

Surrounding traffic complexity analysis for efficient and stable conflict resolution

The constant increase in air traffic demand increases a probability of the separation minima infringements in certain areas as a consequence of increased traffic density. The Annual Safety Report 2016 reports that in recent years the number of infringements, measured per million flight hours, had been increased at a lower rate (Eurocontrol, 2018). However, this level of infringements still generates a continuous pressure on the air traffic control (ATC) system and seeks for more control resources ready to tactically solve potential conflicts, while increasing at the same time the operational costs. Considering present air traffic management (ATM) trade-off criteria: increased airspace capacity and traffic efficiency but reducing the cost while preserving safety, new services must be designed to distribute the separation management ATC task loads among other actors. Based on the Single European Sky Air Traffic Management Research and Next Generation Air Transportation System initiatives, this paper proposes an innovative separation management service to shift the completely centralized tactical ATC interventions to more efficient decentralized tactical operations relying on an advanced surrounding traffic analysis tool, to preserve the safety indicators while considering the operational efficiency. A developed methodology for the proposed service is an application-oriented, trying to respond to characteristics and requirements of the current operational environment. The paper further analysis the traffic complexity taking into consideration the so-called domino effect, i.e. a number of the surrounding aircraft causally involved in the separation management service by the means of identification of the spatiotemporal interdependencies between them and the conflicting aircraft. This complexity is driven by the interdependencies structure and expressed as a time-criticality in quantifying the total number of the system solutions, that varies over time as the aircraft are approaching to each other. The results from two randomly selected ecosystem scenarios, extracted from a simulated traffic, illustrate different avoidance capacities for a given look-ahead time and the system solutions counts, that in discrete moments reach zero value.     

Coloured Petri net-based traffic collision avoidance system encounter model for the analysis of potential induced collisions

The Traffic Alert and Collision Avoidance System (TCAS) is a world-wide accepted last-resort means of reducing the probability and frequency of mid-air collisions between aircraft. Unfortunately, it is widely known that in congested airspace, the use of the TCAS may actually lead to induced collisions. Therefore, further research regarding TCAS logic is required. In this paper, an encounter model is formalised to identify all of the potential collision scenarios that can be induced by a resolution advisory that was generated previously by the TCAS without considering the downstream consequences in the surrounding traffic. The existing encounter models focus on checking and validating the potential collisions between trajectories of a specific scenario. In contrast, the innovative approach described in this paper concentrates on quantitative analysis of the different induced collision scenarios that could be reached for a given initial trajectory and a rough specification of the surrounding traffic. This approach provides valuable information at the operational level. Furthermore, the proposed encounter model can be used as a test-bed to evaluate future TCAS logic changes to mitigate potential induced collisions in hot spot volumes. In addition, the encounter model is described by means of the coloured Petri net (CPN) formalism. The resulting state space provides a deep understanding of the cause-and-effect relationship that each TCAS action proposed to avoid an actual collision with a potential new collision in the surrounding traffic. Quantitative simulation results are conducted to validate the proposed encounter model, and the resulting collision scenarios are summarised as valuable information for future Air Traffic Management (ATM) systems.     

Integrated sequencing and merging aircraft to parallel runways with automated conflict resolution and advanced avionics capabilities

Congestion in Terminal Maneuvering Area (TMA) in hub airports is the main problem in Chinese air transportation. In this paper we propose a new system to integrated sequence and merge aircraft to parallel runways at Beijing Capital International Airport (BCIA). This system is based on the advanced avionics capabilities. Our methodology integrates a Multi-Level Point Merge (ML-PM) system, an economical descent approaches procedure, and a tailored heuristic algorithm to find a good, systematic, operationally-acceptable solution. First, Receding Horizontal Control (RHC) technique is applied to divide the entire 24 h of traffic into several sub-problems. Then in each sub-problem, it is optimized on given objectives (conflict, deviation from Estimated Time of Arrival (ETA) on the runway and makespan of the arrival flow). Four decision variables are designed to control the trajectory: the entry time, the entry speed, the turning time on the sequencing leg, and the landing runway allocation. Based on these variables, the real time trajectories are generated by the simulation module. Simulated Annealing (SA) algorithm is used to search the best solution for aircraft to execute. Finally, the conflict-free, least-delay, and user-preferred trajectories from the entry point of TMA to the landing runway are defined. Numerical results show that our optimization system has very stable de-conflict performance to handle continuously dense arrivals in transition airspace. It can also provide the decision support to assist flow controllers to handle the asymmetric arrival flows on different runways with less fuel consumption, and to assist tactical controllers to easily re-sequence aircraft with more relaxed position shifting. Moreover, our system can provide the fuel consumption prediction, and runway assignment information to assist airport and airlines managers for optimal decision making. Theoretically, it realizes an automated, cooperative and green control of routine arrival flows. Although the methodology defined here is applied to the airport BCIA, it could also be applied to other airports in the world.     

An efficient algorithm for smoothing airspace congestion by fine-tuning take-off times

Current technological advances in communications and navigation have improved air traffic management (ATM) with new decision support tools to balance airspace capacity with user demands. Despite agreements achieved in flying reference business trajectories (RBTs) among different stakeholders, tight spatio-temporal connectivity between trajectories in dense sectors can cause perturbations that might introduce time or space deviations into the original RBTs, thus potentially affecting other 4D trajectories. In this paper, several challenging results are presented by properly tuning the Calculated Take-Off Times (CTOTs) as a tool for mitigating the propagation of perturbations between trajectories that can readily appear in dense sectors. Based on the identification of “collective microregions”, a tool for predicting potential spatio-temporal concurrence events between trajectories over the European airspace was developed, together with a CTOT algorithm to sequence the departures that preserve the scheduled slots while relaxing tight trajectory interactions. The algorithm was tested by considering a realistic scenario (designed and analyzed in the STREAM project (Stream, 2013)) to evaluate relevant ATM KPIs that provide aggregated information about the sensitivity of the system to trajectory interactions, taking into account the system dynamics at a network level. The proposed approach contributes to enhancing the ATM capacity of airports to mitigate network perturbations.     

Prediction of aircraft performances based on data collected by air traffic control centers

Accurate prediction of aircraft position is becoming more and more important for the future of air traffic. Currently, the lack of information about flights prevents us to fulfill future demands for the needed accuracy in 4D trajectory prediction. Until we get the necessary information from aircraft and until new more accurate methods are implemented and used, we propose an alternative method for predicting aircraft performances using machine learning from historical data about past flights collected in a multidimensional database. In that way, we can improve existing applications by providing them better inputs for their trajectory calculations. Our method uses flight plan data to predict performance values, which are suited individually for each flight. The results show that based on recorded past aircraft performances and related flight data we can effectively predict performances for future flights based on how similar flights behaved in the past.     

Adaptive prediction of flight time uncertainty for ground-based 4D trajectory management

An adaptive prediction model of level flight time uncertainty is derived as a function of flight and meteorological conditions, and its effectiveness for ground-based 4D trajectory management is discussed. Flight time uncertainty inevitably increases because of fluctuations in meteorological conditions, even though the Mach number, flight altitude and direction are controlled constant. Actual flight data collected using the secondary surveillance radar Mode S and numerical weather forecasts are processed to obtain a large collection of flight time error and flight and meteorological conditions. Through the law of uncertainty propagation, an adaptive prediction model of flight time uncertainty is derived as a function of the Mach number, flight distance, wind, and temperature. The coefficients of the adaptive prediction model is determined through cluster analysis and linear regression analysis. It is clearly demonstrated that the proposed adaptive prediction model can estimate the flight time uncertainty without underestimation or overestimation, even under moderate or severe weather conditions. The proposed adaptive prediction is able to improve both safety and efficiency of 4D trajectory management simultaneously.     

Operating cost sensitivity to required time of arrival commands to ensure separation in optimal aircraft 4D trajectories

Trajectory optimisation has shown good potential to reduce environmental impact in aviation. However, a recurring problem is the loss in airspace capacity that fuel optimal procedures pose, usually overcome with speed, altitude or heading advisories that lead to more costly trajectories. This paper aims at the quantification in terms of fuel and time consumption of implementing suboptimal trajectories in a 4D trajectory context that use required times of arrival at specific navigation fixes. A case study is presented by simulating conflicting Airbus A320 departures from two major airports in Catalonia. It is shown how requiring an aircraft to arrive at a waypoint early or late leads to increased fuel burn. In addition, the efficiency of such methods to resolve air traffic conflicts is studied in terms of both fuel burn and resulting aircraft separations. Finally, various scenarios are studied reflecting various airline preferences with regards to cost and fuel burn, as well as different route and conflict geometries for a broader scope of study.