Results for “terminal airspace”

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 NTRS2022

Trajectory Specification Applied to Terminal Airspace

Despite major efforts to automate air traffic control (ATC), it is still performed by humans today. The complexity and safety-criticality of ATC makes it very difficult to safely automate, but it must be automated to increase airspace capacity (the density of traffic that can be safely managed) and airport throughput (the number of arrivals and departures that an airport can safely handle in a given period of time) beyond what is possible with human controllers. This paper presents the Trajectory Specification (TS) concept, which can help to safely automate ATC. TS is a method of specifying aircraft trajectories such that the position at any given time in flight is restricted to a precisely defined bounding space, removing all ambiguity as to where the flight is allowed to be. The bounding space or volume is determined by tolerances relative to a reference trajectory (position as a function of time). The tolerances are dynamic and are based on the aircraft navigation capabilities and the traffic situation. The tolerances can be a piecewise linear function of time or distance along the route, allowing the tolerances to vary as needed, typically increasing with time for departures and decreasing for arrivals. A Trajectory Specification Language (TSL) is proposed for communicating trajectories from aircraft to ATC as requests and from ATC to aircraft as assignments. The TS concept requires a new generation of airborne Flight Management Systems (FMS) that understand the TSL and can fly the assigned trajectories, but this paper focuses on the ATC functions and the prototype ATC algorithms and software that were developed to test the TS concept. Assuming conformance, TS can guarantee safe separation for an arbitrary length of time even in the event of an ATC system or communication outage. It can help to achieve the high level of safety and reliability needed for ATC automation, and it can also reduce the reliance on ATC backup systems for tactical conflict detection and resolution during normal operation. TS can be applied to any controlled airspace, including enroute, terminal, and urban airspace, but this paper presents algorithms and software for arrival spacing and conflict detection and resolution in the terminal airspace serving a major airport. In a fast-time simulation of a full day of traffic in a major terminal airspace, all conflicts were resolved in near real time, demonstrating the computational feasibility and the preliminary operational feasibility of the TS concept. This paper is a compilation of previous papers, and it adds significant information that was omitted from those papers due to length limitations. It also updates some of the results of those earlier papers due to algorithm refinements and corrections of minor software errors.

air traffic control, trajectory↗

NASA NTRS2010

Tactical Conflict Detection in Terminal Airspace

Air traffic systems have long relied on automated short-term conflict prediction algorithms to warn controllers of impending conflicts (losses of separation). The complexity of terminal airspace has proven difficult for such systems as it often leads to excessive false alerts. Thus, the legacy system, called Conflict Alert, which provides short-term alerts in both en-route and terminal airspace currently, is often inhibited or degraded in areas where frequent false alerts occur, even though the alerts are provided only when an aircraft is in dangerous proximity of other aircraft. This research investigates how a minimal level of flight intent information may be used to improve short-term conflict detection in terminal airspace such that it can be used by the controller to maintain legal aircraft separation. The flight intent information includes a site-specific nominal arrival route and inferred altitude clearances in addition to the flight plan that includes the RNAV (Area Navigation) departure route. A new tactical conflict detection algorithm is proposed, which uses a single analytic trajectory, determined by the flight intent and the current state information of the aircraft, and includes a complex set of current, dynamic separation standards for terminal airspace to define losses of separation. The new algorithm is compared with an algorithm that imitates a known en-route algorithm and another that imitates Conflict Alert by analysis of false-alert rate and alert lead time with recent real-world data of arrival and departure operations and a large set of operational error cases from Dallas/Fort Worth TRACON (Terminal Radar Approach Control). The new algorithm yielded a false-alert rate of two per hour and an average alert lead time of 38 seconds.

Tang, Huabin↗

NASA NTRS2020

Tactical Separation and Safety Alerting System for Terminal Airspace

Provision of tactical alerts to aid air traffic controllers in providing separation assurance in terminal airspace is hindered by the complexity of the airspace, its operations, and flight procedures. A prototype automation system is studied that provides controllers with both separation and safety alerts based on or derived from the separation standard for terminal airspace. The system models flight trajectories heuristically, with use of merged intent information from readily available sources: area navigation departure procedures, flight-plan routes, and arrival nominal interior routes used in terminal automation systems. Flight vertical intent is modeled according to standard procedural restrictions except when superseded by controller-issued altitude clearances. Importantly, flight trajectories are modeled for all aircraft, including those conducting visual approaches. New safety-alert thresholds for aircraft conducting visual approaches are studied. Performance of the system is evaluated through fast-time playback of recorded air traffic data from high-fidelity Human-In-The-Loop simulations and real-world operations in two Terminal Radar Approach Control facilities. The prototype system is found to produce a false-alert rate of 8% for separation alerts. The number and validity of safety alerts are studied by comparing with the current Conflict Alert system, showing that the false alerts of Conflict Alert are at 85% and they are avoided in the prototype system.

Air Traffic Management↗

NASA NTRS2013

Optimal Integration of Departures and Arrivals in Terminal Airspace

Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA). It was first applied to a test problem introduced in existing literature. An experiment with a test problem showed that new methods can solve the 20 aircraft problem in fast time with a 65% or 440 second delay reduction using shared departure fixes. In order to test its application in a more realistic and complicated problem, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial separation in current operations, which may introduce unnecessary delays. In this work, three types of separations - spatial, temporal, and hybrid separations - were formulated using the new algorithm. The hybrid separation combines both temporal and spatial separations. Results showed that although temporal separation achieved less delay than spatial separation with a small uncertainty buffer, spatial separation outperformed temporal separation when the uncertainty buffer was increased. Hybrid separation introduced much less delay than both spatial and temporal approaches. For a total of 15 interacting departures and arrivals, when compared to spatial separation, the delay reduction of hybrid separation varied between 11% or 3.1 minutes and 64% or 10.7 minutes corresponding to an uncertainty buffer from 0 to 60 seconds. Furthermore, as a comparison with the NSGA algorithm, a First-Come-First-Serve based heuristic method was implemented for the hybrid separation. Experiments showed that the results from the NSGA algorithm have 9% to 42% less delay than the heuristic method with varied uncertainty buffer sizes.

terminal airspace↗

NASA NTRS2016

Performance of an Automated System for Control of Traffic in Terminal Airspace

This paper examines the performance of a system that performs automated conflict resolution and arrival scheduling for aircraft in the terminal airspace around major airports. Such a system has the potential to perform separation assurance and arrival sequencing tasks that are currently handled manually by human controllers. The performance of the system is tested against several simulated traffic scenarios that are characterized by the rate at which air traffic is metered into the terminal airspace. For each traffic scenario, the levels of performance that are examined include: number of conflicts predicted to occur, types of resolution maneuver used to resolve predicted conflicts, and the amount of delay for all flights. The simulation results indicate that the percentage of arrivals that required a maneuver that changes the flight's horizontal route ranged between 11% and 15% in all traffic scenarios. That finding has certain implications if this automated system were to be implemented simply as a decision support tool. It is also found that arrival delay due to purely wake vortex separation requirements on final approach constituted only between 29% and 35% of total arrival delay, while the remaining major portion of it is mainly due to delay back propagation effects.

air traffic control↗

NASA NTRS2012

Optimal Integration of Departure and Arrivals in Terminal Airspace

Coordination of operations with spatially and temporally shared resources such as route segments, fixes, and runways improves the efficiency of terminal airspace management. Problems in this category include scheduling and routing, thus they are normally difficult to solve compared with pure scheduling problems. In order to reduce the computational time, a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA) was introduced in this work and applied to a test case based on existing literature. The experiment showed that new method can solve the whole problem in fast time instead of solving sub-problems sequentially with a window technique. The results showed a 60% or 406 second delay reduction was achieved by sharing departure fixes (more details on the comparison with MILP results will be presented in the final paper). Furthermore, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial segregation, which may introduce unnecessary delays. In this work, spatial segregation, temporal segregation, and hybrid segregation were formulated using the new algorithm. Results showed that spatial and temporal segregation approaches achieved similar delay. Hybrid segregation introduced much less delay than the other two approaches. For a total of 9 interacting departures and arrivals, delay reduction varied from 4 minutes to 6.4 minutes corresponding flight time uncertainty from 0 to 60 seconds. Considering the amount of flights that could be affected, total annual savings with hybrid segregation would be significant.

high density terminal↗

NASA NTRS2015

Strategic Time-Based Metering that Assures Separation for Integrated Operations in a Terminal Airspace

This paper reports an algorithm for strategic time-based metering of air traffic arriving and departing from a large ( tens of nautical miles) area (called here, the commitment region) around an airport or metroplex. The algorithm assures separation continuously in time and avoids a dictation of intent to an aircraft crew. This is accomplished by allowing an aircraft (specifically, its Flight Management System) to specify, and commit to, an intended route and ground speed profile along that route within the commitment region, and by supplying the time at which to enter the region to the aircraft crew. The airspace that comprises the commitment region need not be confined to the terminal airspace and can include some of the enroute space: the size and shape of the commitment region are parameters in the algorithm. An exact formula for including speed profile uncertainty in the algorithm is provided. The algorithm is applied to a number of data sets recorded during actual air traffic operations in the Southern California TRACON in July of 2014 and the Atlanta TRACON in November and December of 2013. The results of the numerical simulations indicate that the algorithm succeeds at keeping the aircraft separated, but introduces, in its current implementation, more separation than that observed in actual operations. This excess separation can be reduced by modeling more accurately the Visual Flight Rules separation practices, a direction for future research.

air traffic management↗

NASA NTRSDate not supplied

Trajectory Specification for Terminal Airspace

Trajectory Specification is a method of unambiguously specifying a trajectory to be flown by an aircraft. It has been applied in a fast-time simulation to the terminal airspace serving a major airport.

air traffic control↗

NASA NTRSDate not supplied

Initial Analysis of Digitally Enabled Cooperative Operations in Class D Terminal Airspace

The primary contribution of this paper is an initial analysis of integrating digitally enabled cooperative operations (or digital operations for short) with Visual Flight Rules (VFR) and Instrument Flight Rules (IFR) operations in the terminal airspace around a Class D airport, specifically around Fort Worth Alliance airport (KAFW). Enabled by connected digital technologies and automated information exchange, digital operations as envisioned would utilize cooperative practices and operator-responsible separation to ensure safety. In the present study, three conflict management configurations for digital operations were analyzed: 1) centralized with a single instance of a conflict management service to model a scenario with only one fleet operator conducting digital operations or all fleet operators utilizing the same service, 2) federated with two different instances to model a scenario with two different fleet operators conducting digital operations, and 3) fully distributed with a different instance for each digital operation. In simulations in which recorded tracks for VFR and IFR operations were played back and digital operations were modeled that would nominally arrive at KAFW once every 20 minutes (given no conflict resolution maneuvers), there were one or fewer losses of separation (LOS) across the three conflict management configurations. The same result was seen in simulations in which digital operations would nominally arrive at KAFW once every 10 minutes. However, in simulations in which digital operations would nominally arrive at KAFW once every 5 minutes, the number of LOS ranged between six and ten. This highlights the need for follow-on research to investigate the extent to which additional capabilities for digital operations, such as complexity management and/or flow organization, may be needed.

digitally enabled cooperative operations, digital ↗

NASA NTRSDate not supplied

Initial Analysis of Digitally Enabled Cooperative Operations in Class D Terminal Airspace

The primary contribution of this paper is an initial analysis of integrating digitally enabled cooperative operations (or digital operations for short) with Visual Flight Rules (VFR) and Instrument Flight Rules (IFR) operations in the terminal airspace around a Class D airport, specifically around Fort Worth Alliance airport (KAFW). Enabled by connected digital technologies and automated information exchange, digital operations as envisioned would utilize cooperative practices and operator-responsible separation to ensure safety. In the present study, three conflict management configurations for digital operations were analyzed: 1) centralized with a single instance of a conflict management service to model a scenario with only one fleet operator conducting digital operations or all fleet operators utilizing the same service, 2) federated with two different instances to model a scenario with two different fleet operators conducting digital operations, and 3) fully distributed with a different instance for each digital operation. In simulations in which recorded tracks for VFR and IFR operations were played back and digital operations were modeled that would nominally arrive at KAFW once every 20 minutes (given no conflict resolution maneuvers), there were one or fewer losses of separation (LOS) across the three conflict management configurations. The same result was seen in simulations in which digital operations would nominally arrive at KAFW once every 10 minutes. However, in simulations in which digital operations would nominally arrive at KAFW once every 5 minutes, the number of LOS ranged between six and ten. This highlights the need for follow-on research to investigate the extent to which additional capabilities for digital operations, such as complexity management and/or flow organization, may be needed.

digitally enabled cooperative operations↗

NASA NTRS2013

Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace

We address the problem of navigating a set (fleet) of aircraft in an aerial route network so as to bring each aircraft to its destination at a specified time and with minimal distance separation assured between all aircraft at all times. The speed range, initial position, required destination, and required time of arrival at destination for each aircraft are assumed provided. Each aircraft's movement is governed by a controlled differential equation (state equation). The problem consists in choosing for each aircraft a path in the route network and a control strategy so as to meet the constraints and reach the destination at the required time. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver. The proposed model is first step toward increasing the fidelity of continuous time control models of air traffic in a terminal airspace. The Pontryagin Maximum Principle implies the polygonal shape of those portions of the state trajectories away from those states in which one or more aircraft pair are at minimal separation. The model also confirms the intuition that, the narrower the allowed speed ranges of the aircraft, the smaller the space of optimal solutions, and that an instance of the optimal control problem may not have a solution at all (i.e., no control strategy that meets the separation requirement and other constraints).

transportation network↗

NASA NTRS2015

ATM Technology Demonstration 1 (ATD-1) Project: Terminal Airspace Technologies for NextGen (Public)

This video highlights the human-in-the-loop (HITL) simulations conducted by the ATD-1 project and features visual elements developed for Traffic Management Advisor - Terminal Metering, Controller Managed Spacing, and Flight Deck Interval Management. The video content is fairly technical and intended for audiences that have some knowledge of air traffic management issues. This includes researchers and management from NASA, FAA, industry partners, and others interested in terminal metering, controller managed spacing, and interval management technologies. Please note that the media release only clears the video for peer audiences such as ATM conferences or as part of presentations to researchers.

Robinson, John E.↗

NASA NTRSDate not supplied

Traffic Prediction for Uncommunicative Aircraft in Terminal Airspace: Development Framework and Performance Evaluations

This paper presents an air traffic prediction algorithm that takes observations of an aircraft and classifies aircraft type, estimates the aircraft's intent to and method of joining an airport traffic pattern, and predicts the aircaft's future trajectory. To develop algorithms that enable autonomous aircraft to safely insert into un-towered traffic patterns, several challenges need to be addressed. These challenges range from traffic detection to sensor fusion to own-ship trajectory replanning. Critical to a trajectory replanning algorithm is information regarding the future behavior of all traffic aircraft in the operational environment. The presented traffic prediction algorithm generates this information using regular measurements of traffic aircraft position and velocity to classify the aircraft by speed-class, estimate how the aircraft will approach the runway, and construct a predicted trajectory to the runway including future positions and velocities at specific times. The predictions of the presented algorithm are the necessary inputs for any downstream traffic pattern sequencing and own-ship trajectory planning routines. The presented algorithm is benchmarked using approximately 300 randomized traffic trajectories, spanning four vehicle weight classes and eight traffic entry types. While the algorithm can process multiple traffic vehicles in the terminal area, there is no prediction of traffic-on-traffic interaction. Each traffic vehicle is processed separately.

John D McMinn↗

NASA NTRS2012

Efficient Computation of Separation-Compliant Speed Advisories for Air Traffic Arriving in Terminal Airspace

A class of problems in air traffic management asks for a scheduling algorithm that supplies the air traffic services authority not only with a schedule of arrivals and departures, but also with speed advisories. Since advisories must be finite, a scheduling algorithm must ultimately produce a finite data set, hence must either start with a purely discrete model or involve a discretization of a continuous one. The former choice, often preferred for intuitive clarity, naturally leads to mixed-integer programs, hindering proofs of correctness and computational cost bounds (crucial for real-time operations). In this paper, a hybrid control system is used to model air traffic scheduling, capturing both the discrete and continuous aspects. This framework is applied to a class of problems, called the Fully Routed Nominal Problem. We prove a number of geometric results on feasible schedules and use these results to formulate an algorithm that attempts to compute a collective speed advisory, effectively finite, and has computational cost polynomial in the number of aircraft. This work is a first step toward optimization and models refined with more realistic detail.

Sadovsky, Alexander V.↗

NASA NTRS2015

Methods of Increasing Terminal Airspace Flexibility and Control Authority

The focus of the NRA contract is to develop a What-if Analysis Tool for planning Departure Management Programs (DMP) at airports. This final report summarizes the work conducted throughout the base year, with a focus on use case specification for the what-if analysis capability and the implementation of the What-if Analysis Tool and its application to traffic and weather scenarios at Charlotte Douglas International Airport (CLT).

NRA Final Report↗

NASA NTRSDate not supplied

Visualizing Corridors in Terminal Airspace using Trajectory Clustering

Context: Advances in battery and automation technology have made routine air taxi and cargo transport in urban areas a business model that can be attained by emerging aviation innovators. The community vision and work to enable these novel operations is discussed using the term ‘Urban Air Mobility’ or UAM. Small, piloted, airspace vehicles that fly with a few passengers do operate in urban areas today, and these vehicles can be studied as an early proxy for this future UAM traffic. Aim: We seek to identify corridors already in daily operation and their properties. Method: We applied DBSCAN and HDBSCAN to Dallas Forth-Worth TRACON flight data to identify corridors in use, their density, and devised a method to annotate landing sites used in these corridors with site metadata. Results: While DBSCAN was unable to group similar trajectories, we we were able to successfully identify corridors using HDBSCAN, measure their density and annotate them. Conclusion: The applied method can successfully identify corridors in daily operation with additional metadata to help domain expert understand the intent of UAM corridors.

UAM, Trajectory, TRACON, Clustering, DBSCAN, HDBSC↗

NASA NTRSDate not supplied

Visualizing Corridors in Terminal Airspace Using Trajectory Clustering

Context: Advances in battery and automation technology have made routine air taxi and cargo transport in urban areas a business model that can be attained by emerging aviation innovators. The community vision and work to enable these novel operations is discussed using the term ‘Urban Air Mobility’ or UAM. Small, piloted, airspace vehicles that fly with a few passengers do operate in urban areas today, and these vehicles can be studied as an early proxy for this future UAM traffic. Aim: We seek to identify corridors already in daily operation and their properties. Method: We applied DBSCAN and HDBSCAN to Dallas Forth-Worth TRACON flight data to identify corridors in use, their density, and devised a method to annotate landing sites used in these corridors with site metadata. Results: While DBSCAN was unable to group similar trajectories, we we were able to successfully identify corridors using HDBSCAN, measure their density and annotate them. Conclusion: The applied method can successfully identify corridors in daily operation with additional metadata to help domain expert understand the intent of UAM corridors.

UAM Trajectory, TRACON, Clustering, DBSCAN, HDBSCA↗