Learning aircraft operational factors to improve aircraft climb prediction: A large scale multi-airport study

Ground-based aircraft trajectory prediction is a major concern in air traffic control and management. A safe and efficient prediction is a prerequisite to the implementation of new automated tools.In current operations, trajectory prediction is computed using a physical model. It models the forces acting on the aircraft to predict the successive points of the future trajectory. Using such a model requires knowledge of the aircraft state (mass) and aircraft intent (thrust law, speed intent). Most of this information is not available to ground-based systems.This paper focuses on the climb phase. We improve the trajectory prediction accuracy by predicting some of the unknown point-mass model parameters. These unknown parameters are the mass and the speed intent. This study relies on ADS-B data coming from The OpenSky Network. It contains the climbing segments of the year 2017 detected by this sensor network. The 11 most frequent aircraft types are studied. The obtained data set contains millions of climbing segments from all over the world. The climbing segments are not filtered according to their altitude. Predictive models returning the missing parameters are learned from this data set, using a Machine Learning method. The trained models are tested on the two last months of the year and compared with a baseline method (BADA used with the mean parameters computed on the first ten months). Compared with this baseline, the Machine Learning approach reduce the RMSE on the altitude by 48% on average on a 10 min horizon prediction. The RMSE on the speed is reduced by 25% on average. The trajectory prediction is also improved for small climbing segments. Using only information available before the considered aircraft take-off, the Machine Learning method can predict the unknown parameters, reducing the RMSE on the altitude by 25% on average.The data set and the Machine Learning code are publicly available.     

Aircraft trajectory forecasting using local functional regression in Sobolev space

This paper considers the problem of short to mid-term aircraft trajectory prediction, that is, the estimation of where an aircraft will be located over a 10–30 min time horizon. Such a problem is central in decision support tools, especially in conflict detection and resolution algorithms. It also appears when an air traffic controller observes traffic on the radar screen and tries to identify convergent aircraft, which may be in conflict in the near future. An innovative approach for aircraft trajectory prediction is presented in this paper. This approach is based on local linear functional regression that considers data preprocessing, localizing and solving linear regression using wavelet decomposition. This algorithm takes into account only past radar tracks, and does not use any physical or aeronautical parameters. This approach has been successfully applied to aircraft trajectories between several airports on the data set that is one year air traffic over France. The method is intrinsic and independent from airspace structure.     

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.     

Aircraft initial mass estimation using Bayesian inference method

Aircraft mass is a crucial piece of information for studies on aircraft performance, trajectory prediction, and many other topics of aircraft traffic management. However, It is a common challenge for researchers, as well as air traffic control, to access this proprietary information. Previously, several studies have proposed methods to estimate aircraft weight based on specific parts of the flight. Due to inaccurate input data or biased assumptions, this often leads to less confident or inaccurate estimations. In this paper, combined with a fuel-flow model, different aircraft initial masses are computed independently using the total energy model and reference model at first. It then adopts a Bayesian approach that uses a prior probability of aircraft mass based on empirical knowledge and computed aircraft initial masses to produce the maximum a posteriori estimation. Variation in results caused by dependent factors such as prior, thrust and wind are also studied. The method is validated using 50 test flights of a Cessna Citation II aircraft, for which measurements of the true mass were available. The validation results show a mean absolute error of 4.3% of the actual aircraft mass.     

A network‐based dynamic air traffic flow model for short‐term en route traffic prediction

This paper presents a dynamic network‐based approach for short‐term air traffic flow prediction in en route airspace. A dynamic network characterizing both the topological structure of airspace and the dynamics of air traffic flow is developed, based on which the continuity equation in fluid mechanics is adopted to describe the continuous behaviour of the en route traffic. Building on the network‐based continuity equation, the space division concept in cell transmission model is introduced to discretize the proposed model both in space and time. The model parameters are sequentially updated based on the statistical properties of the recent radar data and the new predicting results. The proposed method is applied to a real data set from Shanghai Area Control Center for the short‐term air traffic flow prediction both at flight path and en route sector level. The analysis of the case study shows that the developed method can characterize well the dynamics of the en route traffic flow, thereby providing satisfactory prediction results with appropriate uncertainty limits. The mean relative prediction errors are less than 0.10 and 0.14, and the absolute errors fall in the range of 0 to 1 and 0 to 3 in more than 95% time intervals respectively, for the flight path and en route sector level. Copyright © 2017 John Wiley & Sons, Ltd.     

An optimal aircraft fleet management decision model under uncertainty

Decision planning for an efficient fleet management is crucial for airlines to ensure a profit while maintaining a good level of service. Fleet management involves acquisition and leasing of aircraft to meet travelers' demand. Accordingly, the methods used in modeling travelers' demand are crucial as they could affect the robustness and accuracy of the solutions. Compared with most of the existing studies that consider deterministic demand, this study proposes a new methodology to find optimal solutions for a fleet management decision model by considering stochastic demand. The proposed methodology comes in threefold. First, a five‐step modeling framework, which is incorporated with a stochastic demand index (SDI), is proposed to capture the occurrence of uncertain events that could affect the travelers' demand. Second, a probabilistic dynamic programming model is developed to optimize the fleet management model. Third, a probable phenomenon indicator is defined to capture the targeted level of service that could be achieved satisfactorily by the airlines under uncertainty. An illustrative case study is presented to evaluate the applicability of the proposed methodology. The results show that it is viable to provide optimal solutions for the aircraft fleet management model. Copyright © 2013 John Wiley & Sons, Ltd.     

Conflict‐free time‐based trajectory planning for aircraft taxi automation with refined taxiway modeling

To mitigate airport congestion caused by increasing air traffic demand, the trajectory‐based surface operations concept has been proposed to improve surface movement efficiency while maintaining safety. It utilizes decision support tools to provide optimized time‐based trajectories for each aircraft and uses automation systems to guide surface movements and monitor their conformance with assigned trajectories. Whether the time‐based trajectories can be effectively followed so that the expected benefits can be guaranteed depends firstly on whether these trajectories are realistic. So, this paper first deals with the modeling biases of the network model typically used for taxi trajectory planning via refined taxiway modeling. Then it presents a zone control‐based dynamic routing and timing algorithm upon the refined taxiway model to find the shortest time taxi route and timings for an aircraft. Finally, the presented algorithm is integrated with a sequential planning framework to continuously decide taxi routes and timings. Experimental results demonstrate that the solution time for an aircraft can be steadily around a few milliseconds with timely cleaning of expired time windows, showing potential for real‐time decision support applications. The results also show the advantages of the proposed methodology over existing approaches. Copyright © 2015 John Wiley & Sons, Ltd.     

Enhanced transport-related air pollution prediction through a novel metamodel approach

This research proposes a novel approach to improve the ability to forecast low frequency extreme events of transport-related pollution in urban areas using a limited input data set. The approach is based on the idea of a self-managing model, able to adapt to unexpected changes in pollution level. In more detail, for a given combination of variables, it selects the most suitable prediction model within a set of alternative air quality models, estimated for a wider range of locations and conditions.In this study, the new approach is tested for the prediction of nitrogen dioxide concentration in the United Kingdom (UK), specifically in an air quality monitoring site of the Greater Manchester Area, by comparing it with a context-specific statistical model (ARIMAX). The analysis results show that the two methods are similar in terms of global covariance and difference between observed and simulated concentrations, however the performance of the new approach in the prediction of extreme air pollution events is up to 27% better than the standard statistical approach and up to 113% better than the artificial neural network method.     

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.     

Real options and flexibility analysis in design and management of one-way mobility on-demand systems using decision rules

This study explores the concepts of real options and flexibility analysis as an approach to address uncertain demand growth in mobility on-demand (MoD) vehicle-sharing systems, with the goal of improving expected lifecycle performance. As MoD systems are gaining popularity worldwide, they inevitably face significant uncertainty in terms of needs and customer demands. Designing, planning capacity deployment, and operating such system can be challenging, and require significant capital investments for companies and cities. Two distinct real options analysis (ROA) models are developed to evaluate and optimize flexible strategies for these systems, relying on a novel methodological approach to value flexibility based on decision rules. The decision-rule-based approach differs from standard ROA approaches used to quantify the value of flexibility in irreversible investment projects, typically based on dynamic programming. It emulates the decision-making process by capturing mathematically a triggering mechanism that determines when it is best to exercise the flexibilities embedded in the system design. Two prevalent types of MoD systems are studied in this paper as demonstration of the methodological framework: a station-based system where customers must pick up and return the vehicle at specific locations, and a free-floating system, where customers may pick up and drop the car anywhere within a certain area. A simulation-based approach is used to analyze the station-based system, which models the rebalancing operations from a micro-level perspective. The approach consists of a discrete event simulator for performance estimation, and an optimization algorithm for design space exploration that integrates a population-based search algorithm with Optimal Computing Budget Allocation (OCBA). For the free-floating system, an analytical model is developed where the decision rule is formulated into and solved using stochastic mixed integer programming (MIP). The study provides guidance to system operators on potential strategies for deploying MoD systems, considering explicitly uncertainty and flexibility as a value enhancing mechanism.     

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.     

Short/medium-term prediction for the aviation emissions in the en route airspace considering the fluctuation in air traffic demand

This paper proposes a novel short/medium-term prediction method for aviation emissions distribution in en route airspace. An en route traffic demand model characterizing both the dynamics and the fluctuation of the actual traffic demand is developed, based on which the variation and the uncertainty of the short/medium-term traffic growth are predicted. Building on the demand forecast the Boeing Fuel Flow Method 2 is applied to estimate the fuel consumption and the resulting aviation emissions in the en route airspace. Based on the traffic demand prediction and the en route emissions estimation, an aviation emissions prediction model is built, which can be used to forecast the generation of en route emissions with uncertainty limits. The developed method is applied to a real data set from Hefei Area Control Center for the en route emission prediction in the next 5 years, with time granularities of both months and years. To validate the uncertainty limits associated with the emission prediction, this paper also presents the prediction results based on future traffic demand derived from the regression model widely adopted by FAA and Eurocontrol. The analysis of the case study shows that the proposed method can characterize well the dynamics and the fluctuation of the en route emissions, thereby providing satisfactory prediction results with appropriate uncertainty limits. The prediction results show a gradual growth at an average annual rate of 7.74%, and the monthly prediction results reveal distinct fluctuation patterns in the growth.     

Large-scale transit itinerary planning under uncertainty

In this paper, we study the transit itinerary planning problem with incorporation of randomness that arises in transit vehicle arrival/departure and passenger transfer. We investigate two approaches to address the uncertainty: a minmax robust approach and an expectation-based probabilistic approach. We adapt a two-phase framework to mitigate computational challenges in large-scale planning problems. In phase I, we compute candidate route connections offline and store them into a database. Although expensive computation is required in phase I, it is typically performed only once over a period of time (e.g., half a year). Phase II takes place whenever a request is received, for which we query candidate route connections from the database, build a stochastic shortest-path model based on either approach listed above, and solve the model in real time. With phase I, computational requirement in phase II is substantially reduced so as to ensure real-time itinerary planning. To demonstrate the practical feasibility of our two-phase approach, we conduct extensive case studies and sensitivity analyses based on a large real-world transit network.     

A probabilistic model for traffic at actuated control signals

Vehicle actuated controls are designed to adapt green and red times automatically, according to the actual dynamics of the arrival, departure and queuing processes. In turn, drivers experience variable delays and waiting times at these signals. However, in practice, delays and waiting times are computed at these systems with models that assume stationariety in the arrival process, and that are capable of computing simply expectation values, while no information is given on the uncertainty around this expectation. The growing interest on measures like travel time reliability, or network robustness motivates the development of models able to quantify the variability of traffic at these systems.This paper presents a new modeling approach for estimating queues and signal phase times, based on probabilistic theory. This model overcomes the limitations of existing models in that it does not assume stationary arrival rates, but it assumes any temporal distribution as input, and allows one to compute the temporal evolution of queue length and signal sequence probabilities. By doing so, one can also quantify the uncertainty in the estimation of delays and waiting times as time-dependent processes. The results of the probabilistic approach have been compared to the results of repeated microscopic simulations, showing good agreement. The smaller number of parameters and shorter computing times required in the probabilistic approach makes the model suitable for, e.g., planning and design problems, as well as model-based travel time estimation.     

Flight delays,capacity investment and social welfare under air transport supply-demand equilibrium

This paper analyzes benefits from aviation infrastructure investment under competitive supply-demand equilibrium. The analysis recognizes that, in the air transportation system where economies of density is an inherent characteristic, capacity change would trigger a complicated set of adjustment of and interplay among passenger demand, air fare, flight frequency, aircraft size, and flight delays, leading to an equilibrium shift. An analytical model that incorporates these elements is developed. The results from comparative static analysis show that capacity constraint suppresses demand, reduces flight frequency, and increases passenger generalized cost. Our numerical analysis further reveals that, by switching to larger aircraft size, airlines manage to offset part of the delay effect on unit operating cost, and charge passengers lower fare. With higher capacity, airlines tend to raise both fare and frequency while decreasing aircraft size. More demand emerges in the market, with reduced generalized cost for each traveler. The marginal benefit brought by capacity expansion diminishes as the capacity-demand imbalance becomes less severe. Existing passengers in the market receive most of the benefit, followed by airlines. The welfare gains from induced demand are much smaller. The equilibrium approach yields more plausible investment benefit estimates than does the conventional method. In particular, when forecasting future demand the equilibrium approach is capable of preventing the occurrence of excessive high delays.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.     

An ensemble approach for conflict detection in Free Flight by data mining

Airborne separation assurance is a key requirement for Free Flight operations. A variety of conflict detection (CD) and resolution algorithms have been developed for this task. A lack of rigorous evaluation and the existence of an infinite number of possible conflict geometries in Free Flight makes the choice of which algorithm to be placed in the cockpit a challenging task for the designers of future air traffic management (ATM) systems. In this paper, we propose an ensemble approach for CD in Free Flight. The ensemble consists of several CD algorithms, a rule set for each algorithm describing its learned behavior from its past performance and a switch mechanism to choose an appropriate CD algorithm given probe characteristics. A novel mechanism to evolve complex conflict scenarios, using genetic algorithms (GA), is developed and integrated in a fast time air traffic simulator to generate the performance data of CD algorithms. Data mining techniques are then employed to identify implicit patterns in the probe characteristics where the CD algorithms missed or falsely identified a conflict. These patterns are formulated as rule sets for each CD algorithm and are then used by a switch in the ensemble to route a probe for conflict prediction. Given probe characteristics, the CD algorithm, which is less likely to miss or falsely identify a conflict, is selected to evaluate the probe for potential conflict. The performance of the ensemble and of individual algorithms is evaluated by comparing the Pareto efficient set of solutions generated by them. The ensemble approach demonstrates a significant reduction in the number of missed detects and false alarms as compared to individual algorithms. The proposed methodology is capable of accommodating existing as well as new CD models and can be extended to other ATM concepts as well.     

A competitive, charter air-service planning model for student athlete travel

This paper presents a model for planning an air charter service for pre-scheduled group travel. This model is used to investigate the competitiveness of such an enterprise for student athlete travel in conference sports. The relevant demand subset to be served by a limited charter fleet is identified through a comparison with existing scheduled travel options. Further, the routing and scheduling of the charter aircraft is performed within the same framework. Through this modeling a method for formulating and accommodating continuous time windows and competitive market dynamics in strategic planning for a charter service is developed. Computational improvements to the basic model are also presented and tested. The model is applied to the Big Sky Conference for the 2006-2007 season, quantifying the benefits to the students from such a service and the change in expenditure associated with such a benefit for various assumptions about operations and value of time. The findings indicate the lack of spatial or sport based patterns for maximizing benefit, indicating the absence of simplistic “rules of thumb” for operating such a service, and validating the need for the model.     

A dynamic lane-changing trajectory planning model for automated vehicles

This paper focuses on the lane-changing trajectory planning (LTP) process in the automatic driving technologies. Existing studies on the LTP algorithms are primarily the static planning method in which the states of the surrounding vehicles of a lane-changing vehicle are assumed to keep unchanged in the whole lane-changing process. However, in real-world traffic, the velocities of the surrounding vehicles change dynamically, and the lane-changing vehicle needs to adjust its velocity and positions correspondingly in real-time to maintain safety. To address such limitations, the dynamic lane-changing trajectory planning (DLTP) model is proposed in the limited literature. This paper proposes a novel DLTP model consisting of the lane-changing starting-point determination module, trajectory decision module and trajectory generation module. The model adopts a time-independent polynomial trajectory curve to avoid the unrealistic assumptions on lane-changing velocities and accelerations in the existing DLTP model. Moreover, a rollover-avoidance algorithm and a collision-avoidance algorithm containing a reaction time are presented to guarantee the lane-changing safety of automated vehicles, even in an emergent braking situation. The field lane-changing data from NGSIM data are used to construct a real traffic environment for lane-changing vehicles and verify the effectiveness of the proposed model, and CarSim is applied to investigate the traceability of the planned lane-changing trajectories using the proposed model. The results indicate that an automated vehicle can complete the lane-changing process smoothly, efficiently and safely following the trajectory planned by the proposed model, and the planned velocity and trajectory can be well-tracked by automated vehicles.     

Extending Time to Collision for probabilistic reasoning in general traffic scenarios

Vehicle-to-vehicle communication systems allow vehicles to share state information with one another to improve safety and efficiency of transportation networks. One of the key applications of such a system is in the prediction and avoidance of collisions between vehicles. If a method to do this is to succeed it must be robust to measurement uncertainty and to loss of communication links. The method should also be general enough that it does not rely on constraints on vehicle motion for the accuracy of its predictions. It should work for all interactions between vehicles and not just a select subset. This paper presents a method to calculate Time to Collision for unconstrained vehicle motion. This metric is gated using a novel technique based on relative vehicle motion that we call “looming”. Finally, these ideas are integrated into a probabilistic framework that accounts for uncertainty in vehicle state and loss of vehicle-to-vehicle communication. Together this work represents a new way of considering vehicle collision estimation. These algorithms are validated on data collected from real world vehicle trials.