NAV Portugal's performance within the single European Sky Initiative

NAV Portugal is the Air Navigation Service Provider in Portugal, providing air traffic control services in the airspace under the country’s responsibility. Recently, the company has been included in an initiative launched by the European Commission, called the Single European Sky. This aims for a unification of the European airspace, improving it in four main pillars: safety, capacity, environment, and cost-efficiency. To each of them, Key Performance Indicators need to be computed and monitored, all having pre-defined targets. The presented work project will be analyzing how NAV Portugal is doing in the pillar of capacity, proving suggestions if needed

Research on Arrival/Departure Scheduling of Flights on Multirunways Based on Genetic Algorithm

Aiming at the phenomenon of a large number of flight delays in the terminal area makes a reasonable scheduling for the approach and departure flights, which will minimize flight delay losses and improve runway utilization. This paper considered factors such as operating conditions and safety interval of multi runways; the maximum throughput and minimum flight delay losses as well as robustness were taken as objective functions; the model of optimization scheduling of approach and departure flights was established. Finally, the genetic algorithm was introduced to solve the model. The results showed that, in the program whose advance is not counted as a loss, its runway throughput is improved by 18.4%, the delay losses are reduced by 85.8%, and the robustness is increased by 20% compared with the results of FCFS (first come first served) algorithm, while, compared with the program whose advance is counted as a loss, the runway throughput is improved by 15.16%, flight delay losses are decreased by 75.64%, and the robustness is also increased by 20%. The algorithm can improve the efficiency and reduce delay losses effectively and reduce the workload of controllers, thereby improving economic results

Robust decision-support tools for airport surface traffic

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (p. 107-113).This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Forecasts of departure demand are one of the driving inputs to tactical decision-support tools (DSTs) for airport surface traffic. While there are well-known results on average- or worst-case forecast uncertainty, it is the forecast errors which occur under best-case minimum-uncertainty conditions which constrain robust DST design and the achievable traffic benefits. These best-case errors have never previously been characterized. Several quantitative models and techniques for computing pushback forecasts are developed. These are tested against a dataset of 17,344 real-world airline ground operations covering 3 months of Lufthansa flights transiting Frankfurt International Airport. The Lufthansa dataset includes detailed timing information on all of the turn processes, including deboarding, catering, cleaning, fueling and boarding. The dataset is carefully filtered to obtain a sample of 3820 minimum-uncertainty ground events. The forecast models and techniques are tested against this sample, and it is observed that current pushback forecast errors (on the order of ±15min) cannot be reduced by a factor of more than 2 or 3. Furthermore, for each ground event, only 3 observations are necessary to achieve this best-case performance: the available ground-time between actual onblock and scheduled offblock; the time until deboarding begins; and the time until boarding ends. Any DST used in real-world operations must be robust to this "noise floor". To support the development of robust DSTs, a unified framework called ceno-scale modelling is developed.(cont.) This class of models encodes a wide range of observed delay mechanisms using multi-resource synchronization (MRS) feedback networks. A ceno-scale model instance is created for Newark International Airport, and the parameter sensitivity and model fidelity are tested against a detailed real-world dataset. Based on the validated model framework, several robust dual control strategies are proposed for airport surface traffic.by Francis R. Carr.Ph.D

Robust Decision-Support Tools for Airport Surface Traffic

Forecasts of departure demand are one of the driving inputs to tactical decision-support tools (DSTs) for airport surface traffic. While there are well-known results on average- or worst-case forecast uncertainty, it is the forecast errors which occur under best-case minimum-uncertainty conditions which constrain robust DST design and the achievable traffic benefits. These best-case errors have never previously been characterized. Several quantitative models and techniques for computing pushback forecasts are developed. These are tested against a dataset of 17,344 real-world airline ground operations covering 3 months of Lufthansa fights transiting Frankfurt International Airport. The Lufthansa dataset includes detailed timing information on all of the turn processes, including deboarding, catering, cleaning, fueling and boarding. The dataset is carefully filtered to obtain a sample of 3820 minimum-uncertainty ground events. The forecast models and techniques are tested against this sample, and it is observed that current pushback forecast errors (on the order of §15min) cannot be reduced by a factor of more than 2 or 3. Furthermore, for each ground event, only 3 observations are necessary to achieve this best-case performance: the available ground-time between actual onblock and scheduled offblock; the time until deboarding begins; and the time until boarding ends. Any DST used in real-world operations must be robust to this “noise floor". To support the development of robust DSTs, a unified framework called ceno-scale modeling is developed. This class of models encodes a wide range of observed delay mechanisms using multi-resource synchronization (MRS) feedback networks. A ceno-scale model instance is created for Newark International Airport, and the parameter sensitivity and model fidelity are tested against a detailed real-world dataset. Based on the validated model framework, several robust dual control strategies are proposed for airport surface traffic

Approximate dynamic programming with applications in multi-agent systems

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.MIT Institute Archives copy: contains CDROM of thesis in .pdf format.Includes bibliographical references (p. 151-161).This thesis presents the development and implementation of approximate dynamic programming methods used to manage multi-agent systems. The purpose of this thesis is to develop an architectural framework and theoretical methods that enable an autonomous mission system to manage real-time multi-agent operations. To meet this goal, we begin by discussing aspects of the real-time multi-agent mission problem. Next, we formulate this problem as a Markov Decision Process (MDP) and present a system architecture designed to improve mission-level functional reliability through system self-awareness and adaptive mission planning. Since most multi-agent mission problems are computationally difficult to solve in real-time, approximation techniques are needed to find policies for these large-scale problems. Thus, we have developed theoretical methods used to find feasible solutions to large-scale optimization problems. More specifically, we investigate methods designed to automatically generate an approximation to the cost-to-go function using basis functions for a given MDP. Next, these these techniques are used by an autonomous mission system to manage multi-agent mission scenarios. Simulation results using these methods are provided for a large-scale mission problem. In addition, this thesis presents the implementation of techniques used to manage autonomous unmanned aerial vehicles (UAVs) performing persistent surveillance operations. We present an indoor multi-vehicle testbed called RAVEN (Real-time indoor Autonomous Vehicle test ENvironment) that was developed to study long-duration missions in a controlled environment.(cont.) The RAVEN's design allows researchers to focus on high-level tasks by autonomously managing the platform's realistic air and ground vehicles during multi-vehicle operations, thus promoting the rapid prototyping of UAV technologies by flight testing new vehicle configurations and algorithms without redesigning vehicle hardware. Finally, using the RAVEN, we present flight test results from autonomous, extended mission tests using the technologies developed in this thesis. Flight results from a 24 hr, fully-autonomous air vehicle flight-recharge test and an autonomous, multi-vehicle extended mission test using small, electric-powered air vehicles are provided.by Mario J. Valenti.Ph.D

Runway operations scheduling using airline preferences

Koole, G.M. [Promotor

Kernel-based approximate dynamic programming using Bellman residual elimination

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2010.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student submitted PDF version of thesis.Includes bibliographical references (p. 207-221).Many sequential decision-making problems related to multi-agent robotic systems can be naturally posed as Markov Decision Processes (MDPs). An important advantage of the MDP framework is the ability to utilize stochastic system models, thereby allowing the system to make sound decisions even if there is randomness in the system evolution over time. Unfortunately, the curse of dimensionality prevents most MDPs of practical size from being solved exactly. One main focus of the thesis is on the development of a new family of algorithms for computing approximate solutions to large-scale MDPs. Our algorithms are similar in spirit to Bellman residual methods, which attempt to minimize the error incurred in solving Bellman's equation at a set of sample states. However, by exploiting kernel-based regression techniques (such as support vector regression and Gaussian process regression) with nondegenerate kernel functions as the underlying cost-to-go function approximation architecture, our algorithms are able to construct cost-to-go solutions for which the Bellman residuals are explicitly forced to zero at the sample states. For this reason, we have named our approach Bellman residual elimination (BRE). In addition to developing the basic ideas behind BRE, we present multi-stage and model-free extensions to the approach. The multistage extension allows for automatic selection of an appropriate kernel for the MDP at hand, while the model-free extension can use simulated or real state trajectory data to learn an approximate policy when a system model is unavailable.(cont.) We present theoretical analysis of all BRE algorithms proving convergence to the optimal policy in the limit of sampling the entire state space, and show computational results on several benchmark problems. Another challenge in implementing control policies based on MDPs is that there may be parameters of the system model that are poorly known and/or vary with time as the system operates. System performance can suer if the model used to compute the policy differs from the true model. To address this challenge, we develop an adaptive architecture that allows for online MDP model learning and simultaneous re-computation of the policy. As a result, the adaptive architecture allows the system to continuously re-tune its control policy to account for better model information 3 obtained through observations of the actual system in operation, and react to changes in the model as they occur. Planning in complex, large-scale multi-agent robotic systems is another focus of the thesis. In particular, we investigate the persistent surveillance problem, in which one or more unmanned aerial vehicles (UAVs) and/or unmanned ground vehicles (UGVs) must provide sensor coverage over a designated location on a continuous basis. This continuous coverage must be maintained even in the event that agents suer failures over the course of the mission. The persistent surveillance problem is pertinent to a number of applications, including search and rescue, natural disaster relief operations, urban traffic monitoring, etc.(cont.) Using both simulations and actual flight experiments conducted in the MIT RAVEN indoor flight facility, we demonstrate the successful application of the BRE algorithms and the adaptive MDP architecture in achieving high mission performance despite the random occurrence of failures. Furthermore, we demonstrate performance benefits of our approach over a deterministic planning approach that does not account for these failures.by Brett M. Bethke.Ph.D