Engineering topics

Butler, Ricky W.

Publications and source records attributed to Butler, Ricky W..

At least 19 records

NASA NTRS2019

Mission Planner Algorithm for Urban Air Mobility – Initial Performance Characterization

In this paper, an initial characterization was performed of the Mission Planner algorithm developed by NASA for Urban Air Mobility (UAM) operations research. The algorithm plans conflict-free trajectories for flights to support a given set of UAM passenger trips. The UAM trips are planned in an on-demand, first-come, first-served manner, such that any given trip is subject to the constraints imposed by previously planned trips. For this analysis, the mission planning algorithm considered only the trajectory constraints from previously-planned trips in one test condition and added vertiport constraints for the second test condition. The conflict and constraint resolution strategies used by the Mission Planner were characterized by their percentage contribution to planning iterations, their percentage effectiveness in those iterations, and their contributions to the departure delay applied to each UAM trip’s flight. With the exception of the climb and descent vertical speed strategies, most strategies showed reasonable or good performance in all test scenarios. In the test condition with vertipad constraints enabled, both the total number of iterations executed, and the number of flights that required planning iterations, was reduced for all scenarios. This was the result of the natural conditioning of the traffic achieved with scheduling and the additional information available to the Mission Planner from the vertiport scheduler. The next steps for this work will include improvements to the mission planning strategies and analyses with additional constraints and under other demand scenarios.

Guerreiro, Nelson M.↗

NASA NTRS2017

An Efficient Universal Trajectory Language

The Efficient Universal Trajectory Language (EUTL) is a language for specifying and representing trajectories for Air Traffic Management (ATM) concepts such as Trajectory-Based Operations (TBO). In these concepts, the communication of a trajectory between an aircraft and ground automation is fundamental. Historically, this trajectory exchange has not been done, leading to trajectory definitions that have been centered around particular application domains and, therefore, are not well suited for TBO applications. The EUTL trajectory language has been defined in the Prototype Verification System (PVS) formal specification language, which provides an operational semantics for the EUTL language. The hope is that EUTL will provide a foundation for mathematically verified algorithms that manipulate trajectories. Additionally, the EUTL language provides well-defined methods to unambiguously determine position and velocity information between the reported trajectory points. In this paper, we present the EUTL trajectory language in mathematical detail.

Hagen, George E.↗

NASA NTRS2017

An Advanced Trajectory-Based Operations Prototype Tool and Focus Group Evaluation

Trajectory-based operations (TBO) is a key concept in the Next Generation Air Transportation System transformation of the National Airspace System (NAS) that will increase the predictability and stability of traffic flows, support a common operational picture through the use of digital data sharing, facilitate more effective collaborative decision making between airspace users and air navigation service providers, and enable increased levels of integrated automation across the NAS. The National Aeronautics and Space Administration (NASA) has been developing trajectory-based systems to improve the efficiency of the NAS during specific phases of flight and is now also exploring Advanced 4-Dimensional Trajectory (4DT) operational concepts that will integrate these technologies and incorporate new technology where needed to create both automation and procedures to support gate-to-gate TBO. A TBO Prototype simulation toolkit has been developed that demonstrates initial functionality that may reside in an Advanced 4DT TBO concept. Pilot and controller subject matter experts (SMEs) were brought to the Air Traffic Operations Laboratory at NASA Langley Research Center for discussions on an Advanced 4DT operational concept and were provided an interactive demonstration of the TBO Prototype using four example scenarios. The SMEs provided feedback on potential operational, technological, and procedural opportunities and concerns. After viewing the interactive demonstration scenarios, the SMEs felt the operational capabilities demonstrated would be useful for performing TBO while maintaining situation awareness and low mental workload. The TBO concept demonstrated produced defined routings around weather which resulted in a more organized, consistent flow of traffic where it was clear to both the controller and pilot what route the aircraft was to follow. In general, the controller SMEs felt that traffic flow management should be responsible for generating and negotiating the operational constraints demonstrated, in cooperation with the Air Traffic Control System Command Center, while air traffic control should be responsible for the implementation of those constraints. The SMEs also indicated that digital data communications would be very beneficial for TBO operations and would result in less workload due to reduced communications, would eliminate issues due to language barriers and frequency problems, and would make receiving, loading, accepting, and executing clearances easier, less ambiguous, and more expeditious. This paper describes an Advanced 4DT operational concept, the TBO Prototype, the demonstration scenarios and methods used, and the feedback obtained from the pilot and controller SMEs in this focus group evaluation.

Guerreiro, Nelson M.↗

NASA NTRS2017

Prototype Tool and Focus Group Evaluation for an Advanced Trajectory-Based Operations Concept

Guerreiro, Nelson M.↗

NASA NTRS2016

The Stratway Program for Strategic Conflict Resolution: User's Guide

Stratway is a strategic conflict detection and resolution program. It provides both intent-based conflict detection and conflict resolution for a single ownship in the presence of multiple traffic aircraft and weather cells defined by moving polygons. It relies on a set of heuristic search strategies to solve conflicts. These strategies are user configurable through multiple parameters. The program can be called from other programs through an application program interface (API) and can also be executed from a command line.

Hagen, George E.↗

NASA NTRS2016

Parametric Analysis of Surveillance Quality and Level and Quality of Intent Information and Their Impact on Conflict Detection Performance

A loss-of-separation (LOS) is said to occur when two aircraft are spatially too close to one another. A LOS is the fundamental unsafe event to be avoided in air traffic management and conflict detection (CD) is the function that attempts to predict these LOS events. In general, the effectiveness of conflict detection relates to the overall safety and performance of an air traffic management concept. An abstract, parametric analysis was conducted to investigate the impact of surveillance quality, level of intent information, and quality of intent information on conflict detection performance. The data collected in this analysis can be used to estimate the conflict detection performance under alternative future scenarios or alternative allocations of the conflict detection function, based on the quality of the surveillance and intent information under those conditions.Alternatively, this data could also be used to estimate the surveillance and intent information quality required to achieve some desired CD performance as part of the design of a new separation assurance system.

Guerreiro, Nelson M.↗

NASA NTRS2015

Software Validation via Model Animation

This paper explores a new approach to validating software implementations that have been produced from formally-verified algorithms. Although visual inspection gives some confidence that the implementations faithfully reflect the formal models, it does not provide complete assurance that the software is correct. The proposed approach, which is based on animation of formal specifications, compares the outputs computed by the software implementations on a given suite of input values to the outputs computed by the formal models on the same inputs, and determines if they are equal up to a given tolerance. The approach is illustrated on a prototype air traffic management system that computes simple kinematic trajectories for aircraft. Proofs for the mathematical models of the system's algorithms are carried out in the Prototype Verification System (PVS). The animation tool PVSio is used to evaluate the formal models on a set of randomly generated test cases. Output values computed by PVSio are compared against output values computed by the actual software. This comparison improves the assurance that the translation from formal models to code is faithful and that, for example, floating point errors do not greatly affect correctness and safety properties.

Dutle, Aaron M.↗

NASA NTRS2015

Conflict Detection Performance Analysis for Function Allocation Using Time-Shifted Recorded Traffic Data

The performance of the conflict detection function in a separation assurance system is dependent on the content and quality of the data available to perform that function. Specifically, data quality and data content available to the conflict detection function have a direct impact on the accuracy of the prediction of an aircraft's future state or trajectory, which, in turn, impacts the ability to successfully anticipate potential losses of separation (detect future conflicts). Consequently, other separation assurance functions that rely on the conflict detection function - namely, conflict resolution - are prone to negative performance impacts. The many possible allocations and implementations of the conflict detection function between centralized and distributed systems drive the need to understand the key relationships that impact conflict detection performance, with respect to differences in data available. This paper presents the preliminary results of an analysis technique developed to investigate the impacts of data quality and data content on conflict detection performance. Flight track data recorded from a day of the National Airspace System is time-shifted to create conflicts not present in the un-shifted data. A methodology is used to smooth and filter the recorded data to eliminate sensor fusion noise, data drop-outs and other anomalies in the data. The metrics used to characterize conflict detection performance are presented and a set of preliminary results is discussed.

Guerreiro, Nelson M.↗

NASA NTRS2014

Towards a Formal Semantics of Flight Plans and Trajectories

In the National Airspace System, ight plans are often used only as a planning tool by air trac controllers and aircraft operators. These plans are implicitly translated into trajectories by the pilot or by the ight management system, and subsequently own by the aircraft. This translation process inevitably introduces di erences between the plan and the trajectory. However, given the current intended usage, exact correspondence between the plan and the trajectory is not needed. To achieve greater capacity and eciency, future air trac management concepts are being designed around the use of trajectories where predictability is extremely important. In this paper, a mathematical relationship between ight plans and trajectories is explored with the goal of making feasible, highly accurate predictions of future positions and velocities of aircraft. The goal here is to describe, in mathematically precise detail, a formal language of trajectories, whereby all receivers of the trajectory information will be able to arrive at precisely the same trajectory predication and to do this without having aircraft broadcast a large amount of data. Although even a four-dimensional ight plan is simple in structure, this paper will show that it is inherently ambiguous and will explore these issues in detail. In e ect, we propose that a rigorous semantics for ight plans can be developed and this will serve as an important stepping stone towards trajectory-based operations in the National Airspace System.

Hagen, George E.↗

NASA NTRS2013

A Turn-Projected State-Based Conflict Resolution Algorithm

State-based conflict detection and resolution (CD&R) algorithms detect conflicts and resolve them on the basis on current state information without the use of additional intent information from aircraft flight plans. Therefore, the prediction of the trajectory of aircraft is based solely upon the position and velocity vectors of the traffic aircraft. Most CD&R algorithms project the traffic state using only the current state vectors. However, the past state vectors can be used to make a better prediction of the future trajectory of the traffic aircraft. This paper explores the idea of using past state vectors to detect traffic turns and resolve conflicts caused by these turns using a non-linear projection of the traffic state. A new algorithm based on this idea is presented and validated using a fast-time simulator developed for this study.

Butler, Ricky W.↗

NASA NTRS2013

The Chorus Conflict and Loss of Separation Resolution Algorithms

The Chorus software is designed to investigate near-term, tactical conflict and loss of separation detection and resolution concepts for air traffic management. This software is currently being used in two different problem domains: en-route self- separation and sense and avoid for unmanned aircraft systems. This paper describes the core resolution algorithms that are part of Chorus. The combination of several features of the Chorus program distinguish this software from other approaches to conflict and loss of separation resolution. First, the program stores a history of state information over time which enables it to handle communication dropouts and take advantage of previous input data. Second, the underlying conflict algorithms find resolutions that solve the most urgent conflict, but also seek to prevent secondary conflicts with the other aircraft. Third, if the program is run on multiple aircraft, and the two aircraft maneuver at the same time, the result will be implicitly co-ordinated. This implicit coordination property is established by ensuring that a resolution produced by Chorus will comply with a mathematically-defined criteria whose correctness has been formally verified. Fourth, the program produces both instantaneous solutions and kinematic solutions, which are based on simple accel- eration models. Finally, the program provides resolutions for recovery from loss of separation. Different versions of this software are implemented as Java and C++ software programs, respectively.

Butler, Ricky W.↗

NASA NTRS2013

The Simplified Aircraft-Based Paired Approach With the ALAS Alerting Algorithm

This paper presents the results of an investigation of a proposed concept for closely spaced parallel runways called the Simplified Aircraft-based Paired Approach (SAPA). This procedure depends upon a new alerting algorithm called the Adjacent Landing Alerting System (ALAS). This study used both low fidelity and high fidelity simulations to validate the SAPA procedure and test the performance of the new alerting algorithm. The low fidelity simulation enabled a determination of minimum approach distance for the worst case over millions of scenarios. The high fidelity simulation enabled an accurate determination of timings and minimum approach distance in the presence of realistic trajectories, communication latencies, and total system error for 108 test cases. The SAPA procedure and the ALAS alerting algorithm were applied to the 750-ft parallel spacing (e.g., SFO 28L/28R) approach problem. With the SAPA procedure as defined in this paper, this study concludes that a 750-ft application does not appear to be feasible, but preliminary results for 1000-ft parallel runways look promising.

Perry, Raleigh B.↗

NASA NTRS2012

The Search for Effective Algorithms for Recovery from Loss of Separation

Our previous work presented an approach for developing high confidence algorithms for recovering aircraft from loss of separation situations. The correctness theorems for the algorithms relied on several key assumptions, namely that state data for all local aircraft is perfectly known, that resolution maneuvers can be achieved instantaneously, and that all aircraft compute resolutions using exactly the same data. Experiments showed that these assumptions were adequate in cases where the aircraft are far away from losing separation, but are insufficient when the aircraft have already lost separation. This paper describes the results of this experimentation and proposes a new criteria specification for loss of separation recovery that preserves the formal safety properties of the previous criteria while overcoming some key limitations. Candidate algorithms that satisfy the new criteria are presented.

Butler, Ricky W.↗

NASA NTRS2011

Stratway: A Modular Approach to Strategic Conflict Resolution

In this paper we introduce Stratway, a modular approach to finding long-term strategic resolutions to conflicts between aircraft. The modular approach provides both advantages and disadvantages. Our primary concern is to investigate the implications on the verification of safety-critical properties of a strategic resolution algorithm. By partitioning the problem into verifiable modules much stronger verification claims can be established. Since strategic resolution involves searching for solutions over an enormous state space, Stratway, like most similar algorithms, searches these spaces by applying heuristics, which present especially difficult verification challenges. An advantage of a modular approach is that it makes a clear distinction between the resolution function and the trajectory generation function. This allows the resolution computation to be independent of any particular vehicle. The Stratway algorithm was developed in both Java and C++ and is available through a open source license. Additionally there is a visualization application that is helpful when analyzing and quickly creating conflict scenarios.

Hagen, George E.↗

NASA NTRS2010

How Formal Methods Impels Discovery: A Short History of an Air Traffic Management Project

In this paper we describe a process of algorithmic discovery that was driven by our goal of achieving complete, mechanically verified algorithms that compute conflict prevention bands for use in en route air traffic management. The algorithms were originally defined in the PVS specification language and subsequently have been implemented in Java and C++. We do not present the proofs in this paper: instead, we describe the process of discovery and the key ideas that enabled the final formal proof of correctness

Butler, Ricky W.↗

NASA NTRS2009

A Mathematical Analysis of Conflict Prevention Information

In air traffic management, conflict prevention information refers to the guidance maneuvers, which if taken, ensure that an aircraft's path is conflict-free. These guidance maneuvers take the form of changes to track angle or ground speed. Conflict prevention information may be assembled into prevention bands that advise the crew on maneuvers that should not be taken. Unlike conflict resolution systems, which presume that the aircraft already has a conflict, conflict prevention systems show conflicts for any maneuver, giving the pilot confidence that if a maneuver is made, then no near-term conflicts will result. Because near-term conflicts can lead to safety concerns, strong verification of information correctness is required. This paper presents a mathematical framework to analyze the correctness of algorithms that produce conflict prevention information incorporating an arbitrary number of traffic aircraft and with both a near-term and intermediate-term lookahead times. The framework is illustrated with a formally verified algorithm for 2-dimensional track angle prevention bands.

Maddalon, Jeffrey M.↗

NASA NTRS2009

Formally Verified Practical Algorithms for Recovery from Loss of Separation

In this paper, we develop and formally verify practical algorithms for recovery from loss of separation. The formal verification is performed in the context of a criteria-based framework. This framework provides rigorous definitions of horizontal and vertical maneuver correctness that guarantee divergence and achieve horizontal and vertical separation. The algorithms are shown to be independently correct, that is, separation is achieved when only one aircraft maneuvers, and implicitly coordinated, that is, separation is also achieved when both aircraft maneuver. In this paper we improve the horizontal criteria over our previous work. An important benefit of the criteria approach is that different aircraft can execute different algorithms and implicit coordination will still be achieved, as long as they all meet the explicit criteria of the framework. Towards this end we have sought to make the criteria as general as possible. The framework presented in this paper has been formalized and mechanically verified in the Prototype Verification System (PVS).

Butler, Ricky W.↗

NASA NTRS2009

A Mathematical Basis for the Safety Analysis of Conflict Prevention Algorithms

In air traffic management systems, a conflict prevention system examines the traffic and provides ranges of guidance maneuvers that avoid conflicts. This guidance takes the form of ranges of track angles, vertical speeds, or ground speeds. These ranges may be assembled into prevention bands: maneuvers that should not be taken. Unlike conflict resolution systems, which presume that the aircraft already has a conflict, conflict prevention systems show conflicts for all maneuvers. Without conflict prevention information, a pilot might perform a maneuver that causes a near-term conflict. Because near-term conflicts can lead to safety concerns, strong verification of correct operation is required. This paper presents a mathematical framework to analyze the correctness of algorithms that produce conflict prevention information. This paper examines multiple mathematical approaches: iterative, vector algebraic, and trigonometric. The correctness theories are structured first to analyze conflict prevention information for all aircraft. Next, these theories are augmented to consider aircraft which will create a conflict within a given lookahead time. Certain key functions for a candidate algorithm, which satisfy this mathematical basis are presented; however, the proof that a full algorithm using these functions completely satisfies the definition of safety is not provided.

Maddalon, Jeffrey M.↗