Search NASA⌕ Search

SEARCH · Search NASA

Results for “air traffic optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2024

Optimizing Air Traffic - Integrating Artificial Intelligence and Machine Learning in Flight Path Planning and 3D Airspace Visualization for Air Traffic Control

Air Traffic Control (ATC) systems are vital components of the National Airspace System (NAS). ATC, Airport Traffic Control Towers (ATCT), and Terminal Radar Approach Control (TRACON) are responsible for directing all flights departing from and arriving at airports, managing our nation’s airspace, preventing potential accidents, and ensuring that every flight is accounted for. However, these systems often face challenges in effectively monitoring the skies. Issues such as poor communication between operators, difficulty in performing operations, and the constant need for vigilance frequently burden ATC operators. Additionally, the projected increase in air traffic in the coming years will only exacerbate the stress associated with this role. To address these issues, we propose a system that assists ATC operators in situations such as handovers, emergencies, and routing aircraft to avoid weather hazards. Our solution includes an Artificial Intelligence (AI) and Machine Learning (ML)-based Flight Pathways Planning System (FPPS) designed to find the fastest and most optimal routes for aircraft, taking into account weather conditions, restricted terrain, and Extended-Range Twin-Engine Operational Performance Standards (ETOPS) ratings. The proposed Predictive Weather Planning Model, included in FPPS, adjusts routes based on real-time and forecasted weather conditions. Additionally, our NVIDIA Omniverse 3D Visualization System offers a highly interactive environment for better visualization and a clear view of the airspace. By incorporating these systems, the roles of ATC, ATCT, and TRACON operators will become more manageable and less stressful, equipping them to efficiently handle the growing density of airspace.

Regina Ayoubi↗
NASA NTRSDate not supplied

Natural Language Processing Analysis of Notices to Airmen for Air Traffic Management Optimization

With new emerging technologies in the field of NLP, we explore their applications to digitize and analyze heritage Air Traffic Management (ATM) documents for planning and optimizing airspace operations. Specifically, this research focuses on harvesting semi-structured or un-structured information contained in Notices to Airmen (NOTAMs). Using NLP and other advanced data analytics, we will construct a data-driven framework which facilitates finding language patterns and the use of pretrained language models for classification and extraction of useful airspace constraints and restrictions. These may lead to tools that assist airspace users in understanding the constraints more efficiently, contributing to better route planning and safer execution. This paper explores three workflows entailing different NLP tasks. First, unsupervised techniques like word embedding and topic modeling are used for pattern finding and document classification. Second, a dataset is created by extracting information from the semi-structured NOTAM format as metadata for categorizing, visualizing, and extracting key entities driving NOTAM content. Third, modern pre-built deep learning based transformer models such as BERT, RoBERTa, and XLNet are evaluated on the question answering task, an even more robust approach to information extraction, as well as their respective fine-tuning tasks. In this work we include various performance metrics for the trained models to evaluate both accuracy and precision and we show that the models can be generalized for their respective tasks. The research work developed shows promise in uncovering trends in digital NOTAMs in the NAS and also offers a new framework for digitizing and inferring insights from free-form legacy NOTAMs, that are yet to be digitized.

Natural Language Processing↗
NASA NTRSDate not supplied

Natural Language Processing (NLP) Analysis of NOTAMs for Air Traffic Management Optimization

With new emerging technologies in the field of NLP, we explore their applications to digitize and analyze heritage Air Traffic Management (ATM) documents for planning and optimizing airspace operations. Specifically, this research focuses on harvesting semi-structured or un-structured information contained in Notices to Airmen (NOTAMs). Using NLP and other advanced data analytics, we will construct a data-driven framework which facilitates finding language patterns and the use of pretrained language models for classification and extraction of useful airspace constraints and restrictions. These may lead to tools that assist airspace users in understanding the constraints more efficiently, contributing to better route planning and safer execution. This paper explores three workflows entailing different NLP tasks. First, unsupervised techniques like word embedding and topic modeling are used for pattern finding and document classification. Second, a dataset is created by extracting information from the semi-structured NOTAM format as metadata for categorizing, visualizing, and extracting key entities driving NOTAM content. Third, modern pre-built deep learning based transformer models such as BERT, RoBERTa, and XLNet are evaluated on the question answering task, an even more robust approach to information extraction, as well as their respective fine-tuning tasks. In this work we include various performance metrics for the trained models to evaluate both accuracy and precision and we show that the models can be generalized for their respective tasks. The research work developed shows promise in uncovering trends in digital NOTAMs in the NAS and also offers a new framework for digitizing and inferring insights from free-form legacy NOTAMs, that are yet to be digitized. Video is an mp4 download, with a play time of 9 min 35 secs.

Natural Language Processing↗
NASA NTRS2020

Air Traffic Simulation Technology for High-Population Metroplexes

IAI's MetroSim optimizes air traffic by simulating departures, arrivals, and activity in air and onthe ground in busy metroplexes, where flights impact each other at a single airport and among traffic at nearby airports. MetroSim evolved out of several NASA SBIR/STTR Awards and has since been used by NASA for flight simulation analysis. MetroSim has also been integrated with FAA and DOT technology, has produced studies for the Port Authority of New York and New Jersey, and is under development to support the Navy

Cannon, Kimberly A.↗
NASA NTRS2015

Impact of Airspace Charges on Transatlantic Aircraft Trajectories

Aircraft flying over the airspace of different countries are subject to over-flight charges. These charges vary from country to country. Airspace charges, while necessary to support the communication, navigation and surveillance services, may lead to aircraft flying routes longer than wind-optimal routes and produce additional carbon dioxide and other gaseous emissions. This paper develops an optimal route between city pairs by modifying the cost function to include an airspace cost whenever an aircraft flies through a controlled airspace without landing or departing from that airspace. It is assumed that the aircraft will fly the trajectory at a constant cruise altitude and constant speed. The computationally efficient optimal trajectory is derived by solving a non-linear optimal control problem. The operational strategies investigated in this study for minimizing aircraft fuel burn and emissions include flying fuel-optimal routes and flying cost-optimal routes that may completely or partially reduce airspace charges en route. The results in this paper use traffic data for transatlantic flights during July 2012. The mean daily savings in over-flight charges, fuel cost and total operation cost during the period are 17.6 percent, 1.6 percent, and 2.4 percent respectively, along the cost- optimal trajectories. The transatlantic flights can potentially save $600,000 in fuel cost plus $360,000 in over-flight charges daily by flying the cost-optimal trajectories. In addition, the aircraft emissions can be potentially reduced by 2,070 metric tons each day. The airport pairs and airspace regions that have the highest potential impacts due to airspace charges are identified for possible reduction of fuel burn and aircraft emissions for the transatlantic flights. The results in the paper show that the impact of the variation in fuel price on the optimal routes is to reduce the difference between wind-optimal and cost-optimal routes as the fuel price increases. The additional fuel consumption is quantified using the 30 percent variation in fuel prices during March 2014 to March 2015.

aircraft scheduling↗
NASA NTRS1971

On optimal scheduling and air traffic control in the near terminal area

A scheme is proposed for automated air traffic control of landing aircraft in the vicinity of the airport. Each aircraft is put under the control of an airport-based computer as soon as it enters the near-terminal area (NTA). Scheduling is done immediately thereafter. The aircraft is given a flight plan which, if followed precisely, will lead it to the runway at a prespecified time. The geometry of the airspace in the NTA is chosen so that delays are executed far from the outer marker, and violations of minimum altitude and lateral separations are avoided. Finally, a solution to the velocity mix problem is proposed.

Sarris, A. H.↗
NASA NTRS2009

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Rios, Joseph Lucio↗
NASA NTRS2023

Search for UnderUtilized Airspace for Extensible Traffic Management Operations Based on Air Traffic Patterns

This paper presents a new method to facilitate integrating new vehicle traffic operations, operating with existing air traffic operations. The extensible traffic management (xTM) concept assumes that the new vehicles can operate in a dedicated Cooperative Area (CA) with minimal interaction with conventional air traffic and requiring minimal air traffic supervision. Our method assumes that a new xTM CA can be created when an underutilized airspace with little or no traffic can be identified. Our approach involves modeling airspace as a tree data structure and iteratively subdividing it into smaller cells, with underutilized airspace defined as any cells without flight tracks. The benefits of our approach include its applicability to all xTM scenarios, the ability to handle both 2D and 3D space using a unique tree data structure, and computational efficiency for key functions such as space decomposition, labeling of connected cells, and searching of cells containing a given point. By automatically searching for underutilized airspace based on operating air traffic patterns, we can optimize airspace utilization and improve air traffic management. Our proposed approach can quantitatively determine when and where to allow xTM operations in the National Airspace System.

extensible traffic management↗
NASA NTRS2016

Application of Aviation Turbulence Information to Air-Traffic Management (ATM): Chapter - 24

Unexpected turbulence especially in the upper troposphere and lower stratosphere where cabin crews and passengers in cruising aircraft are likely to unbuckle causes in-flight injuries, structural damage, and flight delay. Therefore, turbulence information can be used to improve safety while pursuing efficiency in Air-Traffic Management (ATM). In this chapter, simple modeling of aircraft trajectories combined with wind and turbulence predictions can suggest the optimal solution of flight plans that minimizes both total flight time (e.g., fuel consumption) and potential encounters of turbulence from departure to arrival airports. Also, probabilistic ensemble turbulence forecasts are applied to suggest an optimal strategic and tactical ATM route planning in a given weather and turbulence condition in the United States which are evaluated against in situ Eddy Dissipation Rate observations from commercial aircraft. Finally, variations of long-haul trans-Oceanic flight routes and their turbulence potentials are investigated using a global reanalysis data to understand how the upper-level large-scale flow patterns can affect the long-term ATM planning through the changes of winds and turbulence conditions.

Wind Optimal↗
NASA NTRS1997

A Critical Survey of Optimization Models for Tactical and Strategic Aspects of Air Traffic Flow Management

This document presents a critical review of the principal existing optimization models that have been applied to Air Traffic Flow Management (TFM). Emphasis will be placed on two problems, the Generalized Tactical Flow Management Problem (GTFMP) and the Ground Holding Problem (GHP), as well as on some of their variations. To perform this task, we have carried out an extensive literature review that has covered more than 40 references, most of them very recent. Based on the review of this emerging field our objectives were to: (i) identify the best available models; (ii) describe typical contexts for applications of the models; (iii) provide illustrative model formulations; and (iv) identify the methodologies that can be used to solve the models. We shall begin our presentation below by providing a brief context for the models that we are reviewing. In Section 3 we shall offer a taxonomy and identify four classes of models for review. In Sections 4, 5, and 6 we shall then review, respectively, models for the Single-Airport Ground Holding Problem, the Generalized Tactical FM P and the Multi-Airport Ground Holding Problem (for the definition of these problems see Section 3 below). In each section, we identify the best available models and discuss briefly their computational performance and applications, if any, to date. Section 7 summarizes our conclusions about the state of the art.

Bertsimas, Dimitris↗
NASA NTRS2014

Benefits Analysis of Wind-Optimal Operations For Trans-Atlantic Flights

North Atlantic Tracks are trans-Atlantic routes across the busiest oceanic airspace in the world. This study analyzes and compares current flight-plan routes to wind-optimal routes for trans-Atlantic flights in terms of aircraft fuel burn, emissions and the associated climate impact. The historical flight track data recorded by EUROCONTROL's Central Flow Management Unit is merged with data from FAA's Enhanced Traffic Management System to provide an accurate flight movement database containing the highest available flight path resolution in both systems. The combined database is adopted for airspace simulation integrated with aircraft fuel burn and emissions models, contrail models, simplified climate response models, and a common climate metric to assess the climate impact of flight routes within the Organized Track System (OTS). The fuel burn and emissions for the tracks in the OTS are compared with the corresponding quantities for the wind-optimized routes to evaluate the potential environmental benefits of flying wind-optimal routes in North Atlantic Airspace. The potential fuel savings and reduction in emissions depend on existing inefficiencies in current flight plans, atmospheric conditions and location of the city-pairs. The potential benefits are scaled by comparing them with actual flight tests that have been conducted since 2010 between a few city-pairs in the transatlantic and trans-pacific region to improve fuel consumption and reduce the environmental impact of aviation.

air traffic optimization↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRS2014

Optimizing Integrated Terminal Airspace Operations Under Uncertainty

In the terminal airspace, integrated departures and arrivals have the potential to increase operations efficiency. Recent research has developed geneticalgorithm- based schedulers for integrated arrival and departure operations under uncertainty. This paper presents an alternate method using a machine jobshop scheduling formulation to model the integrated airspace operations. A multistage stochastic programming approach is chosen to formulate the problem and candidate solutions are obtained by solving sample average approximation problems with finite sample size. Because approximate solutions are computed, the proposed algorithm incorporates the computation of statistical bounds to estimate the optimality of the candidate solutions. A proof-ofconcept study is conducted on a baseline implementation of a simple problem considering a fleet mix of 14 aircraft evolving in a model of the Los Angeles terminal airspace. A more thorough statistical analysis is also performed to evaluate the impact of the number of scenarios considered in the sampled problem. To handle extensive sampling computations, a multithreading technique is introduced.

air traffic optimization↗
NASA NTRS1986

An optimization model for the US Air-Traffic System

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

Mulvey, J. M.↗
NASA NTRS2015

A Stochastic Scheduler for Integrated Arrival, Departure and Surface Operations in Los Angeles

In terminal airspace, integrating arrivals, departures, and surface operations with competing resources provides the potential of improving operational efficiency by removing barriers between different operations. This work develops a centralized stochastic scheduler for operations in a terminal area including airborne and surface operations using Non-dominated sorting genetic algorithm and Monte Carlo simulations. The scheduler handles completing resources between different flows, such as runway allocations, runway crossing, departure fixes, and other interaction way points between arrivals and departures. Meanwhile, the scheduler also takes time-varied uncertainties into account when optimizing schedules. The scheduler is run sequentially to identify the best and robust schedule for the next planning window. Resulting schedules decide the routes, speed or delays, and runway assignments with separation constraints at mergingdiverging waypoints in the air and crossing and separations on runways. The Los Angels terminal area was used as an example. The implementation of this stochastic scheduler for integrated arrival, departure and surface operations is completed. And several preliminary runs are finished for over 1,200 flights in LAX in a typical day. Sensitivity studies on various planning window sizes are presented, which shows that trade-off exits between planning window size and achievable minimum delay. Preliminary results on runway usage are also presented in this abstract. Because arrivals on the outer runways have to be followed by crossings on the inner runways, algorithmic runway allocation prefers inner runways for arrivals and outer runways for departures. More results will be presented in the final paper. And current terminal arrival and departure procedures based on first-come-first-serve procedure will also be set up and used as a baseline for comparison.

integrated scheduler↗