Search NASASearch

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.

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

At least 19 records

Design Principles and Algorithms for Air Traffic Arrival Scheduling

This report presents design principles and algorithms for building a real-time scheduler of arrival aircraft based on a first-come-first-served (FCFS) scheduling protocol. The algorithms provide the conceptual and computational foundation for the Traffic Management Advisor (TMA) of the Center/terminal radar approach control facilities (TRACON) automation system, which comprises a set of decision support tools for managing arrival traffic at major airports in the United States. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high-altitude airspace far away from the airport and low-altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time. This report is a revision of an earlier paper first presented as part of an Advisory Group for Aerospace Research and Development (AGARD) lecture series in September 1995. The authors, during vigorous discussions over the details of this paper, felt it was important to the air-trafficmanagement (ATM) community to revise and extend the original 1995 paper, providing more detail and clarity and thereby allowing future researchers to understand this foundational work as the basis for the TMA's scheduling algorithms.

Center TRACON

Design Considerations for a New Terminal Area Arrival Scheduler

Design of a terminal area arrival scheduler depends on the interrelationship between throughput, delay and controller intervention. The main contribution of this paper is an analysis of the above interdependence for several stochastic behaviors of expected system performance distributions in the aircraft s time of arrival at the meter fix and runway. Results of this analysis serve to guide the scheduler design choices for key control variables. Two types of variables are analyzed, separation buffers and terminal delay margins. The choice for these decision variables was tested using sensitivity analysis. Analysis suggests that it is best to set the separation buffer at the meter fix to its minimum and adjust the runway buffer to attain the desired system performance. Delay margin was found to have the least effect. These results help characterize the variables most influential in the scheduling operations of terminal area arrivals.

Thipphavong, Jane

Precision Arrival Scheduling for Tactical Reconfiguration

This research adapts the concept of precision arrival scheduling to accommodate reconfiguration operations between two sets of fixed arrival routes modeled for Chicago O'Hare International Airport (ORD). Integrated fixed path routing from en-route to runways was modeled for ORD's top two peak traffic configurations, as well as transition routing between the two configurations. A first-come-first-served multi-point scheduler was adapted to the reconfiguration problem by prioritizing the rescheduling of aircraft within the terminal airspace at the time of reconfiguration notification. Arrival rescheduling was then tested for a range of arrival rates and reconfiguration notification lead-times in fasttime simulation. Reconfigurations with lead-times as short as 10 minutes at a nominal static configuration arrival rate (~25 arrivals per quarter hour) could be accommodated with little impact to throughput. However, as lead-time shortened below 25 minutes, individual aircraft efficiency quickly degraded due to extra flight time at lower altitude and speed. In general, first-come-first-served arrival scheduling on fixed routing for this sample reconfiguration problem is promising if at least 10-15 minutes lead-time is given before the reconfiguration is in effect.

airport reconfiguration

Improvement to Airport Throughput Using Intelligent Arrival Scheduling and an Expanded Planning Horizon

The first phase of this study investigated the amount of time a flight can be delayed or expedited within the Terminal Airspace using only speed changes. The Arrival Capacity Calculator analysis tool was used to predict the time adjustment envelope for standard descent arrivals and then for CDA arrivals. Results ranged from 0.77 to 5.38 minutes. STAR routes were configured for the ACES simulation, and a validation of the ACC results was conducted comparing the maximum predicted time adjustments to those seen in ACES. The final phase investigated full runway-to-runway trajectories using ACES. The radial distance used by the arrival scheduler was incrementally increased from 50 to 150 nautical miles (nmi). The increased Planning Horizon radii allowed the arrival scheduler to arrange, path stretch, and speed-adjust flights to more fully load the arrival stream. The average throughput for the high volume portion of the day increased from 30 aircraft per runway for the 50 nmi radius to 40 aircraft per runway for the 150 nmi radius for a traffic set representative of high volume 2018. The recommended radius for the arrival scheduler s Planning Horizon was found to be 130 nmi, which allowed more than 95% loading of the arrival stream.

Glaab, Patricia C.

Anchorage Arrival Scheduling Under Off-Nominal Weather Conditions

Weather can cause flight diversions, passenger delays, additional fuel consumption and schedule disruptions at any high volume airport. The impacts are particularly acute at the Ted Stevens Anchorage International Airport in Anchorage, Alaska due to its importance as a major international portal. To minimize the impacts due to weather, a multi-stage scheduling process is employed that is iteratively executed, as updated aircraft demand and/or airport capacity data become available. The strategic scheduling algorithm assigns speed adjustments for flights that originate outside of Anchorage Center to achieve the proper demand and capacity balance. Similarly, an internal departure-scheduling algorithm assigns ground holds for pre-departure flights that originate from within Anchorage Center. Tactical flight controls in the form of airborne holding are employed to reactively account for system uncertainties. Real-world scenarios that were derived from the January 16, 2012 Anchorage visibility observations and the January 12, 2012 Anchorage arrival schedule were used to test the initial implementation of the scheduling algorithm in fast-time simulation experiments. Although over 90% of the flights in the scenarios arrived at Anchorage without requiring any delay, pre-departure scheduling was the dominant form of control for Anchorage arrivals. Additionally, tactical scheduling was used extensively in conjunction with the pre-departure scheduling to reactively compensate for uncertainties in the arrival demand. For long-haul flights, the strategic scheduling algorithm performed best when the scheduling horizon was greater than 1,000 nmi. With these long scheduling horizons, it was possible to absorb between ten and 12 minutes of delay through speed control alone. Unfortunately, the use of tactical scheduling, which resulted in airborne holding, was found to increase as the strategic scheduling horizon increased because of the additional uncertainty in the arrival times of the aircraft. Findings from these initial experiments indicate that it is possible to schedule arrivals into Anchorage with minimal delays under low-visibility conditions with less disruption to high-cost, international flights.

Grabbe, Shon

Arrival Scheduling with Shortcut Path Options and Mixed Aircraft Performance

Previous work introduced the concept of using tactical shortcut options to improve schedule conformance in terminal airspace. When a scheduling point is congested, aircraft are scheduled to longer nominal paths, holding shortcut path options in reserve for tactical use if an aircraft is late, thereby improving the schedule conformance, reducing the required scheduling buffer, and increasing throughput. When the scheduling point is less congested, aircraft may be scheduled to the shorter path with original larger scheduling buffers. Previous work focused on a single generic merge point serving aircraft with uniform arrival precision. This paper extends the previous concept to enhance the performance of time-based arrival management and consider mixed aircraft performance. Aircraft equipped to achieve a high degree of schedule conformance may be scheduled to the shorter path under the same conditions that a less equipped aircraft would be scheduled to the longer path, giving the equipped aircraft an advantage that can be seamlessly integrated into the scheduler. The arrival scheduler with shortcut path options for mixed aircraft performance is applied to a model of first-come first-served terminal metering at Los Angeles International Airport. Whereas clear system benefits were found for tactical shortcut routing and higher percentages of equipped aircraft, very little advantage could be seen for equipped over unequipped aircraft that could be used to incentivize early equipage.

Equipage operations

Optimal Routing and Control of Multiple Agents Moving in a Transportation Network and Subject to an Arrival Schedule and Separation Constraints

We address the problem of navigating a set of moving agents, e.g. automated guided vehicles, through a transportation network so as to bring each agent to its destination at a specified time. Each pair of agents is required to be separated by a minimal distance, generally agent-dependent, at all times. The speed range, initial position, required destination, and required time of arrival at destination for each agent are assumed provided. The movement of each agent is governed by a controlled differential equation (state equation). The problem consists in choosing for each agent a path and a control strategy so as to meet the constraints and reach the destination at the required time. This problem arises in various fields of transportation, including Air Traffic Management and train coordination, and in robotics. 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.

Sadovsky, A. V.

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

Clustering Days with Similar Airport Weather Conditions

On any given day, traffic flow managers must often rely on past experience and intuition when developing traffic flow management initiatives that mitigate imbalances between the aircraft demand and the weather impacted airport capacity. The goal of this study was to build on recent efforts to apply data mining classification and clustering algorithms to vast archives of historical weather and air traffic data to identify patterns and past decisions that can ultimately inform day-of-operations decision-making. More specifically, this study identified similar weather impacted days at select U.S. airports, and analyzed the traffic management initiatives implemented on these representative days. The identification of the similar days was accomplished by applying a decision tree algorithm to the hourly Localized Aviation Model Output Statistics Program observations and the arrival delays for Newark Liberty International Airport. The branches from the trained decision tree were subsequently pruned to identify four weather conditions that resulted in medium to high delays for the arrivals scheduled to Newark in 2012. Using these weather conditions, four, daily airport-level Weather Impacted Traffic Index values were calculated using the Localized Aviation Model Output Statistics Program observations and the 2012 scheduled arrival counts from the FAAs Aviation System Performance Metric system. The four, daily Weather Impacted Traffic Index values for 2012 were subsequently clustered using an Expectation Maximization clustering algorithm, and nine unique types of weather days at Newark were identified. By far the most prominent type of day at Newark was a day associated with relatively good weather conditions, where there was little convective activity, winds were low, ceilings and visibility were high and there was little precipitation. Moderate levels of convective activity characterized the next most prominent type of day. Days with persistently high winds or low ceiling and visibility levels were relatively rare in 2012. Lastly, the frequency at which Ground Delay Programs, Ground Stops and Miles-in-Trail restrictions were implemented on each of the typical types of days at Newark were analyzed. Based on the results, it does appear as if the usage of Miles-in-Trail, Ground Delay Program and Ground Stop restrictions correlates well with the severity of the weather associated with each unique type of weather impacted day at Newark. Furthermore, the results demonstrate that it is feasible to use historical weather and air traffic archives to provide guidance on the types of traffic management restrictions to implement in response to the weather conditions impacting an airport.

traffic flow management

Clustering Days with Similar Airport Weather Conditions

On any given day, traffic flow managers must often rely on past experience and intuition when developing traffic flow management initiatives that mitigate imbalances between the aircraft demand and the weather impacted airport capacity. The goal of this study was to build on recent efforts to apply data mining classification and clustering algorithms to vast archives of historical weather and air traffic data to identify patterns and past decisions that can ultimately inform day-of-operations decision-making. More specifically, this study identified similar weather impacted days at select U.S. airports, and analyzed the traffic management initiatives implemented on these representative days. The identification of the similar days was accomplished by applying a decision tree algorithm to the hourly Localized Aviation Model Output Statistics Program observations and the arrival delays for Newark Liberty International Airport. The branches from the trained decision tree were subsequently pruned to identify four weather conditions that resulted in medium to high delays for the arrivals scheduled to Newark in 2012. Using these weather conditions, four, daily airport-level Weather Impacted Traffic Index values were calculated using the Localized Aviation Model Output Statistics Program observations and the 2012 scheduled arrival counts from the FAAs Aviation System Performance Metric system. The four, daily Weather Impacted Traffic Index values for 2012 were subsequently clustered using an Expectation Maximization clustering algorithm, and nine unique types of weather days at Newark were identified. By far the most prominent type of day at Newark was a day associated with relatively good weather conditions, where there was little convective activity, winds were low, ceilings and visibility were high and there was little precipitation. Moderate levels of convective activity characterized the next most prominent type of day. Days with persistently high winds or low ceiling and visibility levels were relatively rare in 2012. Lastly, the frequency at which Ground Delay Programs, Ground Stops and Miles-in-Trail restrictions were implemented on each of the typical types of days at Newark were analyzed. Based on the results, it does appear as if the usage of Miles-in-Trail, Ground Delay Program and Ground Stop restrictions correlates well with the severity of the weather associated with each unique type of weather impacted day at Newark. Furthermore, the results demonstrate that it is feasible to use historical weather and air traffic archives to provide guidance on the types of traffic management restrictions to implement in response to the weather conditions impacting an airport.

weather

Knowledge-based scheduling of arrival aircraft

A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

Krzeczowski, K.

A Human-in-the Loop Evaluation of a Coordinated Arrival Departure Scheduling Operations for Managing Departure Delays at LaGuardia Airport

LaGuardia (LGA) departure delay was identified by the stakeholders and subject matter experts as a significant bottleneck in the New York metropolitan area. Departure delay at LGA is primarily due to dependency between LGA's arrival and departure runways: LGA departures cannot begin takeoff until arrivals have cleared the runway intersection. If one-in one-out operations are not maintained and a significant arrival-to-departure imbalance occurs, the departure backup can persist through the rest of the day. At NASA Ames Research Center, a solution called "Departure-sensitive Arrival Spacing" (DSAS) was developed to maximize the departure throughput without creating significant delays in the arrival traffic. The concept leverages a Terminal Sequencing and Spacing (TSS) operations that create and manage the arrival schedule to the runway threshold and added an interface enhancement to the traffic manager's timeline to provide the ability to manually adjust inter-arrival spacing to build precise gaps for multiple departures between arrivals. A more complete solution would include a TSS algorithm enhancement that could automatically build these multi-departure gaps. With this set of capabilities, inter-arrival spacing could be controlled for optimal departure throughput. The concept was prototyped in a human-in-the- loop (HITL) simulation environment so that operational requirements such as coordination procedures, timing and magnitude of TSS schedule adjustments, and display features for Tower, TRACON and Traffic Management Unit could be determined. A HITL simulation was conducted in August 2014 to evaluate the concept in terms of feasibility, controller workload impact, and potential benefits. Three conditions were tested, namely a Baseline condition without scheduling, TSS condition that schedules the arrivals to the runway threshold, and TSS+DSAS condition that adjusts the arrival schedule to maximize the departure throughput. The results showed that during high arrival demand period, departure throughput could be incrementally increased under TSS and TSS+DSAS conditions without compromising the arrival throughput. The concept, operational procedures, and summary results were originally published in ATM20151 but detailed results were omitted. This paper expands on the earlier paper to provide the detailed results on throughput, conformance, safety, flight time/distance, etc. that provide extra insights into the feasibility and the potential benefits on the concept.

trajectory-based operations

Knowledge-Based Scheduling of Arrival Aircraft in the Terminal Area

A knowledge based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real time simulation. The scheduling system automatically sequences, assigns landing times, and assign runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithm is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reductions, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithm is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper describes the scheduling algorithms, gives examples of their use, and presents data regarding their potential benefits to the air traffic system.

Krzeczowski, K. J.

Human Factors Assessment of Disturbances to Scheduled Performance-Based Navigation Arrival Operations

The introduction of Performance-Based Navigation (PBN) specifications to air traffic management has resulted in many benefits during nominal operations, including shorter flight paths, reduced fuel costs, and improved terminal area arrival rates. However, these benefits become less noticeable during off-nominal operations where aircraft are routinely interrupted from staying on PBN procedures due to disturbances such as missed approaches. This human-in-the-loop (HITL) study used multiple types of disturbance events to perturb the arrival schedule. Perturbed schedules were managed with different types of schedule adjustments, including a condition with no adjustments. The study collected data on a host of dependent variables, including human factors measures on controller workload and system performance measures such as schedule nonconformance (nc). Initial analyses showed strong correlations between aggregated controller workload and aggregated nc, as well as benefits of both automatic and manual schedule adjustments for increasing system performance, such as reduced PBN procedure interruptions. The goal of this paper is to further test these initial findings. The results indicated that an increase in schedule nonconformance correlated with an increase in controller workload at specific time intervals, and automated schedule adjustments consistently reduced controller workload associated with nonconformance.

Human factors

Initial Investigations of Controller Tools and Procedures for Schedule-Based Arrival Operations with Mixed Flight-Deck Interval Management Equipage

NASA's Air Traffic Management Demonstration-1 (ATD-1) is a multi-year effort to demonstrate high-throughput, fuel-efficient arrivals at a major U.S. airport using NASA-developed scheduling automation, controller decision-support tools, and ADS-B-enabled Flight-Deck Interval Management (FIM) avionics. First-year accomplishments include the development of a concept of operations for managing scheduled arrivals flying Optimized Profile Descents with equipped aircraft conducting FIM operations, and the integration of laboratory prototypes of the core ATD-1 technologies. Following each integration phase, a human-in-the-loop simulation was conducted to evaluate and refine controller tools, procedures, and clearance phraseology. From a ground-side perspective, the results indicate the concept is viable and the operations are safe and acceptable. Additional training is required for smooth operations that yield notable benefits, particularly in the areas of FIM operations and clearance phraseology.

Callantine, Todd J.

Interaction Between Strategic and Local Traffic Flow Controls

The loosely coordinated sets of traffic flow management initiatives that are operationally implemented at the national- and local-levels have the potential to under, over, and inconsistently control flights. This study is designed to explore these interactions through fast-time simulations with an emphasis on identifying inequitable situations in which flights receive multiple uncoordinated delays. Two operationally derived scenarios were considered in which flights arriving into the Dallas/Fort Worth International Airport were first controlled at the national-level, either with a Ground Delay Program or a playbook reroute. These flights were subsequently controlled at the local level. The Traffic Management Advisor assigned them arrival scheduling delays. For the Ground Delay Program scenarios, between 51% and 53% of all arrivals experience both pre-departure delays from the Ground Delay Program and arrival scheduling delays from the Traffic Management Advisor. Of the subset of flights that received multiple delays, between 5.7% and 6.4% of the internal departures were first assigned a pre-departure delay by the Ground Delay Program, followed by a second pre-departure delay as a result of the arrival scheduling. For the playbook reroute scenario, Dallas/Fort Worth International Airport arrivals were first assigned pre-departure reroutes based on the MW_2_DALLAS playbook plan, and were subsequently assigned arrival scheduling delays by the Traffic Management Advisor. Since the airport was operating well below capacity when the playbook reroute was in effect, only 7% of the arrivals were observed to receive both rerouting and arrival scheduling delays. Findings from these initial experiments confirm field observations that Ground Delay Programs operated in conjunction with arrival scheduling can result in inequitable situations in which flights receive multiple uncoordinated delays.

Grabbe, Son

Wheels-Off Time Uncertainty Impact on Benefits of Early Call for Release Scheduling

Arrival traffic scenarios with 808 flights from 173 airports to Houston George Bush International airport are simulated to determine if Call For Release flights can receive a benefit in terms of less delay over other flights by scheduling prior to gate pushback (look-ahead in time) as opposed to at gate pushback. Call for Release flights are departures that require approval from Air Route Traffic Control Center prior to release. Realism is brought to the study by including gate departure delay and taxi-out delay uncertainties for the 77 major U. S. airports. Gate departure delay uncertainty is assumed to increase as a function of look-ahead time. Results show that Call For Release flights from an airport within the freeze horizon (a region surrounding the arrival airport) can get an advantage over other flights to a capacity constrained airport by scheduling prior to gate pushback, provided the wheels-off time uncertainty with respect to schedule is controlled to a small value, such as within a three-minute window. Another finding of the study is that system delay, measured as the sum of arrival delays, is smaller when flights are scheduled in the order of arrival compared to in the order of departure. Because flights from airports within the freeze horizon are scheduled in the order of departure, an increase in the number of internal airports with a larger freeze horizon increases system delay. Delay in the given scenario was found to increase by 126% (from 13.8 hours to 31.2 hours) as freeze horizon was increased from 30-minutes to 2-hours in the baseline scenario.

wheels-off time uncertainty