SEARCH · Search NASA

Results for “arrival scheduling”

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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

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 NTRS2011

Modeling Off-Nominal Recovery in NextGen Terminal-Area Operations

Robust schedule-based arrival management requires efficient recovery from off-nominal situations. This paper presents research on modeling off-nominal situations and plans for recovering from them using TRAC, a route/airspace design, fast-time simulation, and analysis tool for studying NextGen trajectory-based operations. The paper provides an overview of a schedule-based arrival-management concept and supporting controller tools, then describes TRAC implementations of methods for constructing off-nominal scenarios, generating trajectory options to meet scheduling constraints, and automatically producing recovery plans.

Callantine, Todd J.↗

NASA NTRS2013

Scheduling and Separating Departures Crossing Arrival Flows in Shared Airspace

Flight efficiency and reduction of flight delays are among the primary goals of NextGen. In this paper, we propose a concept of shared airspace where departures fly across arrival flows, provided gaps are available in these flows. We have explored solutions to separate departures temporally from arrival traffic and pre-arranged procedures to support controllers' decisions. We conducted a Human-in-the-Loop simulation and assessed the efficiency and safety of 96 departures from the San Jose airport (SJC) climbing across the arrival airspace of the Oakland and San Francisco arrival flows. In our simulation, the SJC tower had a tool to schedule departures to fly across predicted gaps in the arrival flow. When departures were mistimed and separation could not be ensured, a safe but less efficient route was provided to the departures to fly under the arrival flows. A coordination using a point-out procedure allowed the arrival controller to control the SJC departures right after takeoff. We manipulated the accuracy of departure time (accurate vs. inaccurate) as well as which sector took control of the departures after takeoff (departure vs. arrival sector) in a 2x2 full factorial plan. Results show that coordination time decreased and climb efficiency increased when the arrival sector controlled the aircraft right after takeoff. Also, climb efficiency increased when the departure times were more accurate. Coordination was shown to be a critical component of tactical operations in shared airspace. Although workload, coordination, and safety were judged by controllers as acceptable in the simulation, it appears that in the field, controllers would need improved tools and coordination procedures to support this procedure.

shared airspace↗

NASA NTRS2016

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.

departure scheduling↗

NASA NTRS2005

An Initial Study of Airport Arrival Heinz Capacity Benefits Due to Improved Scheduling Accuracy

The long-term growth rate in air-traffic demand leads to future air-traffic densities that are unmanageable by today's air-traffic control system. I n order to accommodate such growth, new technology and operational methods will be needed in the next generation air-traffic control system. One proposal for such a system is the Automated Airspace Concept (AAC). One of the precepts of AAC is to direct aircraft using trajectories that are sent via an air-ground data link. This greatly improves the accuracy in directing aircraft to specific waypoints at specific times. Studies of the Center-TRACON Automation System (CTAS) have shown that increased scheduling accuracy enables increased arrival capacity at CTAS equipped airports.

Meyn, Larry↗

NASA NTRS2015

Optimizing Integrated Arrival, Departure and Surface Operations Under Uncertainty

In airports and surrounding terminal airspaces, the integration of arrival, departure and surface scheduling and routing have the potential to improve the operations efficiency. Recent research had developed mixed-integer-linear programming algorithm-based scheduler for integrated arrival and departure operations in the presence of uncertainty. This paper extends to the surface previous research performed by the authors to integrate taxiway and runway operations. The developed algorithm is capable of computing optimal aircraft schedules and routings that reflects the integration of air and ground operations. A preliminary study case is conducted for a set of thirteen aircraft evolving in a model of the Los Angeles International airport and surrounding terminal areas. Using historical data, a representative traffic scenario is constructed and probabilistic distributions of pushback delay and arrival gate delay are obtained. To assess the benefits of optimization, a First- Come-First-Serve algorithm approach comparison is realized. Evaluation results demonstrate that the optimization can help identifying runway sequencing and schedule that reduce gate waiting time without increasing average taxi times.

Bosson, Christabelle↗

NASA NTRS1990

Real-time adaptive aircraft scheduling

One of the most important functions of any air traffic management system is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the air traffic control (ATC) system should be postponed in order to reduce the likelihood and extent of airborne delays. An analysis is presented for the fundamental case in which flights from many destinations must be scheduled for arrival at a single congested airport; the formulation is also useful in scheduling the landing of airborne flights within the extended terminal area. A set of approaches is described for addressing a deterministic and a probabilistic version of this problem. For the deterministic case, where airport capacities are known and fixed, several models were developed with associated low-order polynomial-time algorithms. For general delay cost functions, these algorithms find an optimal solution. Under a particular natural assumption regarding the delay cost function, an extremely fast (O(n ln n)) algorithm was developed. For the probabilistic case, using an estimated probability distribution of airport capacities, a model was developed with an associated low-order polynomial-time heuristic algorithm with useful properties.

Kolitz, Stephan E.↗

NASA NTRS2011

Optimal Time Advance In Terminal Area Arrivals: Throughput vs. Fuel Savings

The current operational practice in scheduling air traffic arriving at an airport is to adjust flight schedules by delay, i.e. a postponement of an aircrafts arrival at a scheduled location, to manage safely the FAA-mandated separation constraints between aircraft. To meet the observed and forecast growth in traffic demand, however, the practice of time advance (speeding up an aircraft toward a scheduled location) is envisioned for future operations as a practice additional to delay. Time advance has two potential advantages. The first is the capability to minimize, or at least reduce, the excess separation (the distances between pairs of aircraft immediately in-trail) and thereby to increase the throughput of the arriving traffic. The second is to reduce the total traffic delay when the traffic sample is below saturation density. A cost associated with time advance is the fuel expenditure required by an aircraft to speed up. We present an optimal control model of air traffic arriving in a terminal area and solve it using the Pontryagin Maximum Principle. The admissible controls allow time advance, as well as delay, some of the way. The cost function reflects the trade-off between minimizing two competing objectives: excess separation (negatively correlated with throughput) and fuel burn. A number of instances are solved using three different methods, to demonstrate consistency of solutions.

Sadovsky, Alexander V .↗

NASA NTRS1994

Conflict-free trajectory planning for air traffic control automation

As the traffic demand continues to grow within the National Airspace System (NAS), the need for long-range planning (30 minutes plus) of arrival traffic increases greatly. Research into air traffic control (ATC) automation at ARC has led to the development of the Center-TRACON Automation System (CTAS). CTAS determines optimum landing schedules for arrival traffic and assists controllers in meeting those schedules safely and efficiently. One crucial element in the development of CTAS is the capability to perform long-range (20 minutes) and short-range (5 minutes) conflict prediction and resolution once landing schedules are determined. The determination of conflict-free trajectories within the Center airspace is particularly difficult because of large variations in speed and altitude. The paper describes the current design and implementation of the conflict prediction and resolution tools used to generate CTAS advisories in Center airspace. Conflict criteria (separation requirements) are defined and the process of separation prediction is described. The major portion of the paper will describe the current implementation of CTAS conflict resolution algorithms in terms of the degrees of freedom for resolutions as well as resolution search techniques. The tools described in this paper have been implemented in a research system designed to rapidly develop and evaluate prototype concepts and will form the basis for an operational ATC automation system.

Slattery, Rhonda↗

NASA NTRS2018

Comparison of First-Come First-Served and Optimization Based Scheduling Algorithms for Integrated Departure and Arrival Management

Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA) are investigating scheduling algorithms that will be a part of an integrated arrival and departure management system. Inha University, one of the Korean collaborators of KARI, developed an Extended First-Come First-Served (EFCFS) algorithm that is robust and efficient. However, since the EFCFS algorithm sequentially computes the schedule based on priority, the end results may not be optimal for system efficiency. The approach based on Mixed Integer Linear Programming (MILP) originally developed by NASA and modified by KARI is known to produce better schedules at the expense of computational cost. In this paper, the two different scheduling approaches are compared using common traffic scenarios and constraints at Incheon International Airport. Capabilities to apply weight class based wake turbulence runway separation minima and Miles-in-Trail (MIT) restrictions at selected meter fixes are added to the previously developed EFCFS scheduler. Based on historic data, 40 departures and 20 arrivals are chosen in a one-hour period and 100 scenarios were created by randomly assigning gate numbers, gate departure times, and runway landing times. With the current runway separation requirements, MILP resulted in about ten to twenty percent smaller average delays depending on the constraints. With artificially increased separation minima, the difference between MILP and EFCFS became more noticeable. However, the EFCFS was about ten times faster with smaller variations among different scenarios and constraints. The comparison suggests that the MILP-based algorithm has a small advantage at the current traffic level; however, has potential to be more effective in higher demand or severe weather situations. The EFCFS algorithm may be better suited for real-time applications or investigating larger scale scheduling problems.

air traffic optimization↗

NASA NTRS2019

ATD-3 Dynamic Routes for Arrivals in Weather (DRAW) Operational Concept, V2.0

NASA's Airspace Technology Demonstration-3 (ATD-3) is the applied traffic flow management activity, and third in the series of ATD projects. ATD-3 provides a suite of en route automation tools, both ground and flight-deck based, that focus on improving the efficiency of en route operation from initial cruise to arrival into the Terminal Radar Approach Control (TRACON). Dynamic Routes for Arrivals in Weather (DRAW) is a technology in the ATD-3 suite that is designed to provide Traffic Managers with a capability to efficiently manage arrival traffic flow and help sustain metering operations when weather is impacting arrivals into major airports. DRAW mitigates convective weather impact on arrival metering operations by providing tools to Traffic Managers that enable efficient reroutes free of convective weather conflicts, and integrated with the arrival metering schedule(s).

terminal airspace↗

NASA NTRS2000

A Comparison of Center/TRACON Automation System and Airline Time of Arrival Predictions

Benefits from information sharing between an air traffic service provider and a major air carrier are evaluated. Aircraft arrival time schedules generated by the NASA/FAA Center/TRACON Automation System (CTAS) were provided to the American Airlines System Operations Control Center in Fort Worth, Texas, during a field trial of a specialized CTAS display. A statistical analysis indicates that the CTAS schedules, based on aircraft trajectories predicted from real-time radar and weather data, are substantially more accurate than the traditional airline arrival time estimates, constructed from flight plans and en route crew updates. The improvement offered by CTAS is especially advantageous during periods of heavy traffic and substantial terminal area delay, allowing the airline to avoid large predictive errors with serious impact on the efficiency and profitability of flight operations.

Heere, Karen R.↗

NASA NTRS2015

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↗

NASA NTRS2018

Distributed Consensus to Enable Merging and Spacing of UAS in an Urban Environment

This paper presents a novel approach to enable multiple Unmanned Aerial Systems approaching a common intersection to independently schedule their arrival time while maintaining a safe separation. Aircraft merging at a common intersection are grouped into a network and each aircraft broadcasts its arrival time interval to the network. A distributed consensus algorithm elects a leader among the aircraft approaching the intersection and helps synchronize the information received by each aircraft. The consensus algorithm ensures that each aircraft computes a schedule with the same input information. The elected leader also dictates when a schedule must be computed, which may be triggered when a new aircraft joins the network. Preliminary results illustrating the collaborative behavior of the vehicles are presented.

Balachandran, Swee↗

DOE OSTI2025

EVI-EnSitePy (Electric Vehicle Infrastructure – Energy Estimation and Site Optimization Tool in Python) [EVI-X Modeling Suite] [SWR-25-07]

EVI-EnSitePy is a comprehensive agent-based tool designed for the analysis and design of high-power charging sites, encompassing a wide array of site agents including Electric Vehicles (EVs), chargers, energy storage units (ESS), renewable energy resources (DER), and loads. This versatile tool offers diverse functionalities and a modular modeling approach, allowing detailed configuration of agents based on power ratings, port numbers, energy capacities, demand requirements, charger interfaces, and flexibility to customize the tool for project specific goals. By simulating agent interactions and employing various metrics, EVI-EnSitePy enables the assessment of site performance, exploration of energy management systems (EMS), and implementation of innovative EV charging policies. Utilizing EV charge schedules and arrival states, the tool performs thorough charging site simulations, with outputs consisting of agent and site-level power profiles and statistical metrics. Employing a tree graph structure, EVI-EnSitePy supports nested site structures and power distribution modeling. The tool's ability to generate charging schedules deterministically or via stochastic analysis further enhances its versatility. Through its features and capabilities, EVI-EnSitePy offers a powerful platform for informed decision-making in the realm of high-power charging site design and operation.

Jackson, Derek [National Renewable Energy Laborato↗

NASA NTRS2021

Progress in Scheduling Algorithms for a Collaborative Distributed System for Flight Planning

This Technical Memorandum describes four contributions made by the authors to a larger team effort toward developing a distributed system for scheduling commercial flights at navigation fixes and/or airport runways. These contributions are as follows: (1) a proof of correctness for a scheduling algorithm published previously by Meyn, (2) an improvement of Meyn's algorithm from quadratic to linear time, (3) two independent implementations of the algorithm with test results identical to those published, and (4) an extension of Meyn's algorithm to support minimum usable time intervals.

arrival scheduling↗

NASA NTRS1988

A traveling-salesman-based approach to aircraft scheduling in the terminal area

An efficient algorithm is presented, based on the well-known algorithm for the traveling salesman problem, for scheduling aircraft arrivals into major terminal areas. The algorithm permits, but strictly limits, reassigning an aircraft from its initial position in the landing order. This limitation is needed so that no aircraft or aircraft category is unduly penalized. Results indicate, for the mix of arrivals investigated, a potential increase in capacity in the 3 to 5 percent range. Furthermore, it is shown that the computation time for the algorithm grows only linearly with problem size.

Luenberger, Robert A.↗

NASA NTRS1994

Grid resolution and solution convergence for Mars Pathfinder forebody

As part of the Discovery Program, NASA Plans to launch a series of probes to Mars. The Mars Pathfinder project is the first of this series with a scheduled Mars arrival in July 1997. The entry vehicle will perform a direct entry into the atmosphere and deliver a lander to the surface. Predicting the entry vehicle's flight performance and designing the forebody heatshield requires knowledge of the expected aerothermodynamic environment. Much of this knowledge can be obtained through computational fluid dynamic (CFD) analysis.

Nettelhorst, Heather L.↗