Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied traffic flow management”

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 37 records · Page 2

A Wavelet Analysis Approach for Categorizing Air Traffic Behavior

In this paper two frequency domain techniques are applied to air traffic analysis. The Continuous Wavelet Transform (CWT), like the Fourier Transform, is shown to identify changes in historical traffic patterns caused by Traffic Management Initiatives (TMIs) and weather with the added benefit of detecting when in time those changes take place. Next, with the expectation that it could detect anomalies in the network and indicate the extent to which they affect traffic flows, the Spectral Graph Wavelet Transform (SGWT) is applied to a center based graph model of air traffic. When applied to simulations based on historical flight plans, it identified the traffic flows between centers that have the greatest impact on either neighboring flows, or flows between centers many centers away. Like the CWT, however, it can be difficult to interpret SGWT results and relate them to simulations where major TMIs are implemented, and more research may be warranted in this area. These frequency analysis techniques can detect off-nominal air traffic behavior, but due to the nature of air traffic time series data, so far they prove difficult to apply in a way that provides significant insight or specific identification of traffic patterns.

wavelet analysis↗

A Frequency Analysis Approach for Categorizing Air Traffic Behavior

A method of analyzing National Air Space (NAS) air traffic that uses the Discrete Fourier Transform (DFT) is presented. The DFT is used to transform time domain traffic count data into the frequency domain where the sources of traffic in air spaces can be identified and characterized more easily. It is shown in simulation that individual traffic flows within Air Route Traffic Control Centers can be distinguished by their periodicity in the DFT plot. Next, three Traffic Management Initiatives (playbook rerouting, metered flows, and Ground Delay Programs) are implemented in simulations and their signature effects on the traffic are identified using the DFT. Finally, historical flight data is studied and the DFT is applied to sector traffic count data. It is found that in many cases, variations in traffic due to rerouting and convective weather disturbances are better highlighted in the frequency domain than in the original time domain data. Initial results of the DFT show it has potential as a tool for measuring and/or predicting NAS behavior for daily tactical planning and control purposes.

fourier transform↗

CATS-based Air Traffic Controller Agents

This report describes intelligent agents that function as air traffic controllers. Each agent controls traffic in a single sector in real time; agents controlling traffic in adjoining sectors can coordinate to manage an arrival flow across a given meter fix. The purpose of this research is threefold. First, it seeks to study the design of agents for controlling complex systems. In particular, it investigates agent planning and reactive control functionality in a dynamic environment in which a variety perceptual and decision making skills play a central role. It examines how heuristic rules can be applied to model planning and decision making skills, rather than attempting to apply optimization methods. Thus, the research attempts to develop intelligent agents that provide an approximation of human air traffic controller behavior that, while not based on an explicit cognitive model, does produce task performance consistent with the way human air traffic controllers operate. Second, this research sought to extend previous research on using the Crew Activity Tracking System (CATS) as the basis for intelligent agents. The agents use a high-level model of air traffic controller activities to structure the control task. To execute an activity in the CATS model, according to the current task context, the agents reference a 'skill library' and 'control rules' that in turn execute the pattern recognition, planning, and decision-making required to perform the activity. Applying the skills enables the agents to modify their representation of the current control situation (i.e., the 'flick' or 'picture'). The updated representation supports the next activity in a cycle of action that, taken as a whole, simulates air traffic controller behavior. A third, practical motivation for this research is to use intelligent agents to support evaluation of new air traffic control (ATC) methods to support new Air Traffic Management (ATM) concepts. Current approaches that use large, human-in-the-loop simulations are unquestionably valuable for this purpose, but pose considerable logistical, fiscal, and experimental control problems. First, data analysis is extremely complicated, owing simply to the large number of participants and data sources in such simulations. In addition, experienced human air traffic controllers working adjacent sectors tend to flexibly adapt to the evolving control problem - potentially shifting to other strategies than those under investigation. In addition, their performance is tightly coupled to the control interface, which in the development phase may support some concepts and supporting strategies better than others. A simple shift in strategy by one controller can change the character of a particular traffic scenario dramatically, which makes experimental comparison of ATC performance under different traffic scenarios difficult. Training a given team of controllers on operations under a new ATM concept for a sufficient period of time could avert such difficulties, but instituting an adequate training program is expensive and logistically difficult.

Callantine, Todd J.↗

Macroscopic Traffic Modeling Using Probe Vehicle Data: A Machine Learning Approach

Abstract The macroscopic fundamental diagram (MFD) captures an orderly relationship among traffic flow, density, and speed at the network level. It is a simple yet powerful tool for modeling traffic dynamics in large urban networks with broad application in traffic control and management. However, empirically derived MFDs in urban regions require high-resolution traffic data from the network. Having the network flow and vehicular density estimated at the (granular) census tract level using vehicle probe data, we apply machine learning methods to predict the MFDs across U.S. urban areas and capture the impacts of location-specific input features on the network flow–density relationships at a large scale. The results show that, among the four tested machine learning approaches (Random Forest, XGBoost, Support Vector Machine, and Neural Network), XGBoost delivers the best performance in predicting network traffic flow based on vehicular density and location attributes. Using interaction Shapley Additive explanation (SHAP) values and partial correlation analysis, we examine the factors influencing MFD shapes across different locations. Our empirical findings reveal that across U.S. urban areas, network topology, transportation infrastructure, and land use are primary factors shaping MFD curves, while demand and trip-related factors play a lesser role. Specifically, higher ranking roads, centrality, and development levels correlate positively with network capacity and critical density, whereas negative associations are observed for network connectivity, mixed-use development, and road roughness levels.

Jin, Ling↗

Traffic Flow Management Using Aggregate Flow Models and the Development of Disaggregation Methods

A linear time-varying aggregate traffic flow model can be used to develop Traffic Flow Management (tfm) strategies based on optimization algorithms. However, there are no methods available in the literature to translate these aggregate solutions into actions involving individual aircraft. This paper describes and implements a computationally efficient disaggregation algorithm, which converts an aggregate (flow-based) solution to a flight-specific control action. Numerical results generated by the optimization method and the disaggregation algorithm are presented and illustrated by applying them to generate TFM schedules for a typical day in the U.S. National Airspace System. The results show that the disaggregation algorithm generates control actions for individual flights while keeping the air traffic behavior very close to the optimal solution.

Sun, Dengfeng↗

The Airspace Concepts Evaluation System Architecture and System Plant

The Airspace Concepts Evaluation System is a simulation of the National Airspace System. It includes models of flights, airports, airspaces, air traffic controls, traffic flow managements, and airline operation centers operating throughout the United States. It is used to predict system delays in response to future capacity and demand scenarios and perform benefits assessments of current and future airspace technologies and operational concepts. Facilitation of these studies requires that the simulation architecture supports plug and play of different air traffic control, traffic flow management, and airline operation center models and multi-fidelity modeling of flights, airports, and airspaces. The simulation is divided into two parts that are named, borrowing from classical control theory terminology, control and plant. The control consists of air traffic control, traffic flow management, and airline operation center models, and the plant consists of flight, airport, and airspace models. The plant can run open loop, in the absence of the control. However, undesired affects, such as conflicts and over congestions in the airspaces and airports, can occur. Different controls are applied, "plug and played", to the plant. A particular control is evaluated by analyzing how well it managed conflicts and congestions. Furthermore, the terminal area plants consist of models of airports and terminal airspaces. Each model consists of a set of nodes and links which are connected by the user to form a network. Nodes model runways, fixes, taxi intersections, gates, and/or other points of interest, and links model taxiways, departure paths, and arrival paths. Metering, flow distribution, and sequencing functions can be applied at nodes. Different fidelity model of how a flight transits are can be used by links. The fidelity of the model can be adjusted by the user by either changing the complexity of the node/link network-or the way that the link models how the flights transit from one node to the other.

Windhorst, Robert↗

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↗

Exploration of Near-Term Potential Routes and Procedures for Urban Air Mobility

Urban air mobility is gaining interest as the need for On Demand Mobility in today's congested traffic is becoming high in metropolitan areas. Urban Air Mobility (UAM) is envisioned as a concept to transport passengers and cargo safely and efficiently using innovative aircraft in the urban areas. It is expected to improve mobility for the general public, decongest road traffic, reduce transport time and reduce the strain on existing public transport networks. There exist several challenges to Urban Air Mobility (UAM) such as integration of procedures with airspace and the airport, noise levels that are acceptable to the general public, public safety, public acceptance, vehicle certification, and more. Most of the research in the United States and European skies (DLR - German Aerospace Center) related to urban areas has focused on small UAS (Unmanned Aircraft Systems) flights (NASA's UTM (UAS Traffic Management) research) and their integration with the airspace and building safe operations in densely populated areas. Previous studies on UAM have focused on fast time simulations of the routes that are separated via a separation service and network of routes. Similarly, research in Europe has focused on the approach profile for these innovative aircraft, vertiports and battery life among others. UAM as a part of the On-Demand Mobility effort has provided some guidelines for operations as shown below: Does not require additional ATC (Air Traffic Control) infrastructure; Does not impose additional workload on ATC; Does not restrict operations of traditional airspace users; Will meet appropriate safety thresholds and requirements; Will prioritize operational scalability; Will allow flexibility where possible and structure where necessary. This paper explores potential routes and procedures in a Human-In-The-Loop (HITL) experiment that could be applied in the near-term to allow integration of UAM flights into the airspace as well as a large airport. The airspace that was explored was Dallas Fort Worth (DFW) airspace managed by the DFW East Tower in South Flow only. In addition, Dallas Love Field (DAL) and Addison (ADS) airspace were also part of the testbed. The initial set of routes investigated in this study were published helicopter routes in the DFW area. Figure 1 shows class B airspace in DFW area and the origin/destination city pairs where UAM flights flew along with helicopter routes shown in blue. The research focused on exploring procedures for integrating UAM flights into Class Bravo and Class Delta airspace. Three different communication procedures, evaluated with three different levels of UAM traffic, are shown in Table 1. The current day routes were evaluated with current day communication procedures were explored as the first condition. The current day routes were also evaluated in the second condition with reduced communications, which was assumed due to the presence of a Letter Of Agreement (LOA). The purpose of the LOA was to reduce the verbiage associated with pilots getting clearance to Class B airspace from the controllers, pre-assigning beacons codes to the UAM flights, separate routes by assigning altitudes and speeds to flights going in any one direction. Flights were expected to automatically change frequency when exiting Class B airspace, thus transition points for entry and exit points were also specified in the LOA.

Urban Air Mobility↗

Scheduling and Delivering Aircraft to Departure Fixes in the NY Metroplex with Controller-Managed Spacing Tools

In this paper, successful Time-Based Flow Management (TBFM) scheduling systems for arrivals are considered and adapted to apply to departures. We present a concept of operations that integrates Controller-Managed Spacing tools for departures (CMS-D) with existing tactical departure scheduling tools to coordinate demand at departure fixes in a metroplex environment. We tested our concept in a Human-in-the-Loop simulation and compared the effect of two scheduling conditions: 1) "Departure Scheduling" consisting of an emulation of the Integrated Departure and Arrival Capability (IDAC) where Towers and a Planner (Traffic Management Coordinator at the appropriate facility) coordinate aircraft scheduled takeoff times to departure fixes; and 2) "Arrival Sensitive Departure Scheduling" where, in addition, the Tower and Planner also consider arrival Scheduled Time of Arrivals (STAs) at the airport's dependent runway. Results indicate little difference between the two scheduling conditions, but a large difference between the No Tools and the two scheduling conditions with CMS-D tools. The scheduling/CMS-D tools conditions markedly reduced heading, speed clearances, and workload for controllers who were merging flows at the departure fixes. In the tool conditions, departure controllers conditioned departures earlier rather than later when aircraft were tied near the departure fixes. In the scheduling/CMS-D tools conditions, departures crossed the departure fixes 50 seconds earlier and with an 8% error rate (consisting of time ahead or behind desired time of arrival) compared to a 19% error rate in the No Tool condition. Two exploratory runs showed that similar beneficial effects can be obtained only with the CMS-D tools without scheduling takeoff times, but at the cost of a somewhat higher workload for controllers, indicating the benefits of pre-departure scheduling of aircraft with minimal delays. Hence, we found that CMS-D tools were very beneficial in the metroplex environment we tested but that further research is needed to clarify the benefits of the various scheduling approaches.

terminal airspace↗

En route Spacing Tool: Efficient Conflict-free Spacing to Flow-Restricted Airspace

This paper describes the Air Traffic Management (ATM) problem within the U.S. of flow-restricted en route airspace, an assessment of its impact on airspace users, and a set of near-term tools and procedures to resolve the problem. The FAA is committed, over the next few years, to deploy the first generation of modem ATM decision support tool (DST) technology under the Free-Flight Phase-1 (FFp1) program. The associated en route tools include the User Request Evaluation Tool (URET) and the Traffic Management Advisor (TMA). URET is an initial conflict probe (ICP) capability that assists controllers with the detection and resolution of conflicts in en route airspace. TMA orchestrates arrivals transitioning into high-density terminal airspace by providing controllers with scheduled times of arrival (STA) and delay feedback advisories to assist with STA conformance. However, these FFPl capabilities do not mitigate the en route Miles-In-Trail (MIT) restrictions that are dynamically applied to mitigate airspace congestion. National statistics indicate that en route facilities (Centers) apply Miles-In-Trail (MIT) restrictions for approximately 5000 hours per month. Based on results from this study, an estimated 45,000 flights are impacted by these restrictions each month. Current-day practices for implementing these restrictions result in additional controller workload and an economic impact of which the fuel penalty alone may approach several hundred dollars per flight. To mitigate much of the impact of these restrictions on users and controller workload, a DST and procedures are presented. The DST is based on a simple derivative of FFP1 technology that is designed to introduce a set of simple tools for flow-rate (spacing) conformance and integrate them with conflict-probe capabilities. The tool and associated algorithms are described based on a concept prototype implemented within the CTAS baseline in 1995. A traffic scenario is used to illustrate the controller's use of the tool, and potential display options are presented for future controller evaluation.

Green, S.↗

Identification of Robust Terminal-Area Routes in Convective Weather

Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Traffic flow management algorithms require reliable forecasts of route blockage to schedule and route traffic. This paper demonstrates how raw convective weather forecasts, which provide deterministic predictions of the vertically integrated liquid (the precipitation content in a column of airspace) can be translated into probabilistic forecasts of whether or not a terminal area route will be blocked. Given a flight route through the terminal area, we apply techniques from machine learning to determine the likelihood that the route will be open in actual weather. The likelihood is then used to optimize terminalarea operations by dynamically moving arrival and departure routes to maximize the expected capacity of the terminal area. Experiments using real weather scenarios on stormy days show that our algorithms recommend that a terminal-area route be modified 30% of the time, opening up 13% more available routes that were forecast to be blocked during these scenarios. The error rate is low, with only 5% of cases corresponding to a modified route being blocked in reality, whereas the original route is in fact open. In addition, for routes predicted to be open with probability 0.95 or greater by our method, 96% of these routes (on average over time horizon) are indeed open in the weather that materializes

Pfeil, Diana Michalek↗

Applying Graph Theory to Problems in Air Traffic Management

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

computational complexity↗

Applying Graph Theory to Problems in Air Traffic Management

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it is shown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

precision arrival scheduling↗

Evaluation of Integrated Demand Management Looking into Strategic & Tactical Flow Management

The motivation behind Integrated Demand Management (IDM) research is to explore possible improvements to United States National Airspace System (NAS) performance that could be realized through procedural integration of strategic traffic flow management capabilities, such as the Collaborative Trajectory Options Program (CTOP), and tactical capabilities, such as Time Based Flow Management (TBFM). An initial IDM concept for clear weather operations was developed and evaluated for potential benefits, including efficiency, delay reduction, predictability and throughput, and to identify any major issues that might represent a showstopper for a fielded application. Newark Liberty International Airport (EWR) arrival operations provided a use case for concept development. EWR uses miles-in-trail (MIT) metering to regulate demand into TBFM during high volume operations, and short-haul flights are often penalized with excessive, last-minute ground delays when the overhead stream is saturated. IDM addresses this problem by replacing MIT conditioning with CTOP to better manage the demand delivery to the TBFM entry points. A quasi-real time high-fidelity simulation that would normally involve participants was conducted using heuristic-based procedures that mimicked operators behaviors instead. Five total conditions were compared: two baseline conditions with MIT delivery to TBFM entry points using two different TBFM settings; and three IDM conditions: one with airborne speed control using an Required Time of Arrival (RTA) capability, a second without RTA, and a third with no wind forecast errors. Results suggest that the IDM concept can deliver traffic more efficiently by shifting the delays from airborne to ground for both RTA and non-RTA conditions, while maintaining a target throughput rate. The results also suggest that with good predictability of airport capacity, excessive TBFM ground delay can be minimized by applying more strategic CTOP delay, increasing predictability for the airline operators. Overall, the results indicate that the implementation of an IDM concept under clear weather conditions can improve NAS system performance. Future IDM research aims to expand the concept to address demandcapacity imbalance d severe weather.

Time-Based Flow Management (TBFM)↗

Analysis of Traffic Flow in Structured Urban Airspace Networks with MFD-based Feedback Control

This research delves into applying the Macroscopic Fundamental Diagram (MFD) concept to structured airspace networks for comprehensive aggregate modeling and introduces a feedback-based departure function aimed at optimizing traffic flow. Previous studies have rarely examined structured airspace networks featuring non-stationary vehicles through the MFD perspective. We devised a scenario grounded in practical applications, featuring a multi-lane network with explicit lane-changing behavior. The MFD effectively captured the open-loop response, displaying a low-scatter, unimodal curve on the flow versus occupancy plot. Drawing inspiration from the ground transportation ramp-metering strategies, a proportional-integral-based controller was developed. Extensive simulation outcomes suggest that feedback control, informed by MFD, holds significant potential for managing traffic flow in Urban Air Mobility (UAM) environments; a reduction of 80% in the peak number of vehicles in a holding pattern was observed for a slight reduction in throughput in this study.

MFD↗

Analysis of Traffic Flow in Structured Urban Airspace Networks with MFD-based Feedback Control

This research delves into applying the Macroscopic Fundamental Diagram (MFD) concept to structured airspace networks for comprehensive aggregate modeling and introduces a feedback-based departure function aimed at optimizing traffic flow. Previous studies have rarely examined structured airspace networks featuring non-stationary vehicles through the MFD perspective. We devised a scenario grounded in practical applications, featuring a multi-lane network with explicit lane-changing behavior. The MFD effectively captured the open-loop response, displaying a low-scatter, unimodal curve on the flow versus occupancy plot. Drawing inspiration from the ground transportation ramp-metering strategies, a proportional-integral-based controller was developed. Extensive simulation outcomes suggest that feedback control, informed by MFD, holds significant potential for managing traffic flow in Urban Air Mobility (UAM) environments; a reduction of 80% in the peak number of vehicles in a holding pattern was observed for a slight reduction in throughput in this study.

MFD↗

Probabilistic Analysis of Ground-Holding Strategies

The Ground-Holding Policy Problem (GHPP) has become a matter of great interest in recent years because of the high cost incurred by aircraft suffering from delays. Ground-holding keeps a flight on the ground at the departure airport if it is known it will be unable to land at the arrival airport. The GBPP is determining how many flights should be held on the ground before take-off and for how long, in order to minimize the cost of delays. When the uncertainty associated with airport landing capacity is considered, the GHPP becomes complicated. A decision support system that incorporates this uncertainty, solves the GHPP quickly, and gives good results would be of great help to air traffic management. The purpose of this thesis is to modify and analyze a probabilistic ground-holding algorithm by applying it to two common cases of capacity reduction. A graphical user interface was developed and sensitivity analysis was done on the algorithm, in order to see how it may be implemented in practice. The sensitivity analysis showed the algorithm was very sensitive to the number of probabilistic capacity scenarios used and to the cost ratio of air delay to ground delay. The algorithm was not particularly sensitive to the number of periods that the time horizon was divided into. In terms of cost savings, a ground-holding policy was the most beneficial when demand greatly exceeded airport capacity. When compared to other air traffic flow strategies, the ground-holding algorithm performed the best and was the most consistent under various situations. The algorithm can solve large problems quickly and efficiently on a personal computer.

Sheel, Minakshi↗

Data Mining for Understanding and Impriving Decision-Making Affecting Ground Delay Programs

The continuous growth in the demand for air transportation results in an imbalance between airspace capacity and traffic demand. The airspace capacity of a region depends on the ability of the system to maintain safe separation between aircraft in the region. In addition to growing demand, the airspace capacity is severely limited by convective weather. During such conditions, traffic managers at the FAA's Air Traffic Control System Command Center (ATCSCC) and dispatchers at various Airlines' Operations Center (AOC) collaborate to mitigate the demand-capacity imbalance caused by weather. The end result is the implementation of a set of Traffic Flow Management (TFM) initiatives such as ground delay programs, reroute advisories, flow metering, and ground stops. Data Mining is the automated process of analyzing large sets of data and then extracting patterns in the data. Data mining tools are capable of predicting behaviors and future trends, allowing an organization to benefit from past experience in making knowledge-driven decisions. The work reported in this paper is focused on ground delay programs. Data mining algorithms have the potential to develop associations between weather patterns and the corresponding ground delay program responses. If successful, they can be used to improve and standardize TFM decision resulting in better predictability of traffic flows on days with reliable weather forecasts. The approach here seeks to develop a set of data mining and machine learning models and apply them to historical archives of weather observations and forecasts and TFM initiatives to determine the extent to which the theory can predict and explain the observed traffic flow behaviors.

data mining↗