Search NASA⌕ Search

Engineering topics

Neuman, Frank

Publications and source records attributed to Neuman, Frank.

11 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

A Fast-Time Simulation Tool for Analysis of Airport Arrival Traffic

The basic objective of arrival sequencing in air traffic control automation is to match traffic demand and airport capacity while minimizing delays. The performance of an automated arrival scheduling system, such as the Traffic Management Advisor developed by NASA for the FAA, can be studied by a fast-time simulation that does not involve running expensive and time-consuming real-time simulations. The fast-time simulation models runway configurations, the characteristics of arrival traffic, deviations from predicted arrival times, as well as the arrival sequencing and scheduling algorithm. This report reviews the development of the fast-time simulation method used originally by NASA in the design of the sequencing and scheduling algorithm for the Traffic Management Advisor. The utility of this method of simulation is demonstrated by examining the effect on delays of altering arrival schedules at a hub airport.

Erzberger, Heinz↗
NASA NTRS1998

A Fast-Time Study of Aircraft Reordering in Arrival Sequencing and Scheduling

In order to ensure that the safe capacity of the terminal area is not exceeded, Air Traffic Management ATM often places restrictions on arriving flights transitioning from en route airspace to terminal airspace. This restriction of arrival traffic is commonly referred to as arrival flow management, and includes techniques such as metering, vectoring, fix-load balancing, and the imposition of miles-in-trail separations. These restrictions are enacted without regard for the relative priority which airlines may be placing on individual flights based on factors such as crew criticality, passenger connectivity, critical turn times, gate availability, on-time performance, fuel status, or runway preference. The development of new arrival flow management techniques which take into consideration priorities expressed by air carriers will likely reduce the economic impact of ATM restrictions on the airlines and lead to increased airline economic efficiency by allowing airlines to have greater control over their individual arrival banks of aircraft. NASA and the Federal Aviation Administration (FAA) have designed and developed a suite of software decision support tools (DSTs) collectively known as the Center TRACON Automation System (CTAS). One of these tools, the Traffic Management Advisor (TMA) is currently being used at the Fort Worth Air Route Traffic Control Center to perform arrival flow management of traffic into the Dallas/Fort Worth airport (DFW). The TMA is a time-based strategic planning tool that assists Traffic Management Coordinators (TMCs) and En Route Air Traffic Controllers in efficiently balancing arrival demand with airport capacity. The primary algorithm in the TMA is a real-time scheduler which generates efficient landing sequences and landing times for arrivals within about 200 no a. from touchdown. This scheduler will sequence aircraft so that they arrive in a first- come - first-served (FCFS) order. While FCFS sequencing establishes a fair order based on estimated times of arrival, it does not take into account individual airline priorities among incoming flights. NASA is exploring the possibility of allowing airlines to express relative arrival priorities to air traffic management through the development of new CTAS scheduling algorithms which take into consideration airline arrival preferences. The accommodation of airline priorities in arrival sequencing and scheduling would under most circumstances result in a deviation from a "natural" or FCFS arrival order. As a First step toward developing airline influenced sequencing algorithms, an investigation was conducted to determine the feasibility of reordering arrival traffic from a strict FCFS sequence. A fast-time simulation has been developed which allows statistical evaluation of sequencing and scheduling algorithms for arrival traffic at the Dallas/Fort Worth Airport. In contrast to real-time simulation or field tests, which would require on the order of ninety minutes to examine a single traffic rush period, the fast-time simulation allows examination of multiple rush periods in a matter of seconds.

Carr, Greg↗
NASA NTRS1994

CTAS data analysis program

The analysis program (AN) is specifically designed to produce graphic and tabular information to aid in the design and checkout of the Center TRACON Automation System (CTAS). To best reveal CTAS operation and possible problems, data are plotted in many different ways both in detail and summary form. AN has been designed to analyze both radar surveillance data and output data from CTAS. AN has been extensively used to debug and refine CTAS. It is also being used in the field to monitor and assess CTAS performance. AN is continuously refined to keep up with changing needs. The present version of AN grew out of analysis of Denver Center data. However, the AN software has been written to be adaptable to any other facility Center or TRACON. Presently, one can select Denver Stapleton, Denver International, Dallas/Fort Worth International Airport, and Dallas Love Field.

Neuman, Frank↗
NASA NTRS1991

Analysis of delay reducing and fuel saving sequencing and spacing algorithms for arrival traffic

The air traffic control subsystem that performs sequencing and spacing is discussed. The function of the sequencing and spacing algorithms is to automatically plan the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several algorithms are described and their statistical performance is examined. Sequencing brings order to an arrival sequence for aircraft. First-come-first-served sequencing (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the arriving traffic, gaps will remain in the sequence of aircraft. Delays are reduced by time-advancing the leading aircraft of each group while still preserving the FCFS order. Tightly spaced groups of aircraft remain with a mix of heavy and large aircraft. Spacing requirements differ for different types of aircraft trailing each other. Traffic is reordered slightly to take advantage of this spacing criterion, thus shortening the groups and reducing average delays. For heavy traffic, delays for different traffic samples vary widely, even when the same set of statistical parameters is used to produce each sample. This report supersedes NASA TM-102795 on the same subject. It includes a new method of time-advance as well as an efficient method of sequencing and spacing for two dependent runways.

Neuman, Frank↗
NASA NTRS1991

Computing The No-Escape Envelope Of A Short-Range Missile

Method for computing no-escape envelope of short-range air-to-air missile devised. Useful for analysis of both strategies for avoidance and strategies for attack. With modifications, also useful in analysis of control strategies for one-on-one air-to-air combat, or wherever multiple control strategies considered.

Neuman, Frank↗
NASA NTRS1990

Analysis of sequencing and scheduling methods for arrival traffic

The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.

Neuman, Frank↗
NASA NTRS1990

The Traffic Management Advisor

The traffic management advisor (TMA) is comprised of algorithms, a graphical interface, and interactive tools for controlling the flow of air traffic into the terminal area. The primary algorithm incorporated in it is a real-time scheduler which generates efficient landing sequences and landing times for arrivals within about 200 n.m. from touchdown. A unique feature of the TMA is its graphical interface that allows the traffic manager to modify the computer-generated schedules for specific aircraft while allowing the automatic scheduler to continue generating schedules for all other aircraft. The graphical interface also provides convenient methods for monitoring the traffic flow and changing scheduling parameters during real-time operation.

Nedell, William↗
NASA NTRS1988

Methodology for determination and use of the no-escape envelope of an air-to-air-missile

A large gap exists between optimal control and differential-game theory and their applications. The purpose of this paper is to show how this gap may be bridged. Missile-avoidance of realistically simulated infrared heat-seeking, fire-and-forget missile is studied. In detailed simulations, sweeping out the discretized initial condition space, avoidance methods based on pilot experience are combined with those based on simplified optimal control analysis to derive an approximation to the no-escape missile envelopes. The detailed missile equations and no-escape envelopes were then incorporated into an existing piloted simulation of air-to-air combat to generate missile firing decisions as well as missile avoidance commands. The use of these envelopes was found to be effective in both functions.

Neuman, Frank↗
NASA NTRS1987

A two-dimensional air-to-air combat game - Toward an air-combat advisory system

Air-to-air combat is modeled as a discrete differential game, and by constraining the game to searching for the best guidance laws from the sets of those considered for each opponent, feedback and outcome charts are obtained which can be used to turn one of the automatic opponents into an intelligent opponent against a human pilot. A one-on-one two-dimensional fully automatic, or manned versus automatic, air-to-air combat game has been designed which includes both attack and evasion alternatives for both aircraft. Guidance law selection occurs by flooding the initial-condition space with four simulated fights for each initial condition, depicting the various attack/evasion strategies for the two opponents, and recording the outcomes. For each initial condition, the minimax method from differential games is employed to determine the best choice from the available strategies.

Neuman, Frank↗