Search

Flight testing has been the historical standard for determining aircraft airworthiness. However, increases in the cost of flight testing and the accuracy of inexpensive CFD encourage the adoption of certification by analysis to reduce or replace flight testing. A framework is introduced to predict the performance in the special case of a modification to an existing, previously certified aircraft. This framework uses a combination of existing flight tests or high fidelity data of the original aircraft as well as lower fidelity data from CFD or wind tunnel testing of the original and modified configurations to create 6-DOF flight dynamics models. Two methods are presented which generate an updated flight dynamics model and estimate the model form uncertainty for the modified aircraft configuration using knowledge of the original aircraft. This updated dynamics model and uncertainty estimate are then used to conduct non-deterministic simulations with wind turbulence included. The framework is applied to an example aircraft system to demonstrate the ability to predict the performance and associated model from the uncertainty of modified aircraft configurations. Published version

Current rapidly-exploring random tree (RRT) algorithms rely on proximity query packages that often include collision checkers, tolerance verification, and distance computation algorithms for the generation of safe paths. In this paper, we broaden the information available to the path-planning algorithm by incorporating silhouette information of nearby obstacles in conflict. A silhouette-informed tree (SIT) is generated through the flight-safe region of a wire maze for a single unmanned aerial system (UAS). The silhouette is used to extract local geometric information of nearby obstacles and provide path alternatives around these obstacles. Thus, focusing the search for the generation of new tree branches near these obstacles, and decreasing the number of samples required to explore the narrow corridors within the wire maze. The SIT is then processed to extract a path that connects the initial location of the UAS with the goal, reduce the number of line segments in this path if possible, and smooth the resulting path using Pythagorean Hodograph Bezier curves. To ensure that the smoothed path remains in the flight-safe region of the configuration space, a tolerance verification algorithm for Bezier curves and convex polytopes in three dimensions is proposed. Lastly, temporal specifications are imposed on the smoothed path in the shape of an arbitrary speed profile.

Rising traffic density, along with autonomy and diversity of vehicles in the air, will fundamentally change the safety environment of the future air transportation system. The change in risk is two-fold: increasing chances of mid-air collisions with non-cooperative objects and increasing chances of crashes over highly populated areas. The changing nature of the vehicles populating the airspace means that civilian aircraft design must now explicitly include considerations of survivability in the event of collision with other vehicles, as well as prevention of damage to people, animals and property on the ground, to a much greater extent than today. This paper offers a preliminary perspective on how MDAO could contribute toward these goals. One of the conclusions is that, in contrast to traditional vehicle design, to accommodate the complexity of the future airspace safely and efficiently, vehicle design requirements, modeling, and design optimization must be closely connected to the properties of the airspace, including those of other vehicles in the air. Thus, the total measure of a vehicle's survivability should include the traditional survivability in malfunction scenarios, combined with new considerations of survivability in collisions and survivability of the public on the ground.

A new research platform, the Air Traffic Monotonic Lagrangian Grid, has been developed to serve as a simulation tool for easy and fast testing of various air traffic system concepts. The underlying algorithm is the Monotonic Lagrangian Grid, which is a fast nearest-neighbors interaction algorithm used for sorting and tracking many moving and interacting objects. The nodes of the Monotonic Lagrangian Grid represent the locations of individual aircraft, and the grid moves at each time step as the aircraft move. The model is used to simulate a 24 h period of air traffic flow in the National Airspace System, during which there are 41,594 flights, and this requires only 79 s of wall-clock time on a single processor of a 1.3 GHz Altix. An analysis is presented of the number of nearest-neighbor nodes that must be checked to ensure adequate separation among aircraft. An investigation of the effect of removing waypoints from aircraft trajectories indicates that this may result in a significant reduction in total f...

Rapidly expanding unmanned air traffic includes and will continue to include non-cooperative participants. Non-cooperative behavior may be due to technical failure, a lack of appropriate equipment, a careless or malicious operator. Regardless of the cause, the outcome remains: growing density of non-cooperative traffic will increase the risk of collision between unmanned vehicles and aircraft carrying humans. As a result, the degraded safety of airspace may limit access to airspace, with adverse consequences for the traveling public and the economy. Because encounters with small non-cooperative objects, such as birds or wayward drones, can happen too rapidly for an external control system to mitigate them, it is imperative that the aircraft that carry humans survive encounters with non-cooperative vehicles. To-date, design for survivability has been practiced explicitly in the military domain. Survivability against collisions in civil aviation has been limited to tolerances against bird strikes; and these tolerances have proved inadequate on occasion. The growing risk of collision with unmanned vehicles now requires the development of survivability discipline for civilian transport aircraft. The new discipline must be infused into multidisciplinary design methods, on par with traditional disciplines. In this paper, we report on a preliminary study of survivability considerations for the civil aviation domain.

Incremental approaches to air transportation system development inherit current architectural constraints, which, in turn, place hard bounds on system capacity, efficiency of performance, and complexity. To enable airspace operations of the future, a clean-slate (ab initio) airspace design(s) must be considered. This ab initio National Airspace System (NAS) must be capable of accommodating increased traffic density, a broader diversity of aircraft, and on-demand mobility. System and subsystem designs should scale to accommodate the inevitable demand for airspace services that include large numbers of autonomous Unmanned Aerial Vehicles and a paradigm shift in general aviation (e.g., personal air vehicles) in addition to more traditional aerial vehicles such as commercial jetliners and weather balloons. The complex and adaptive nature of ab initio designs for the future NAS requires new approaches to validation, adding a significant physical experimentation component to analytical and simulation tools. In addition to software modeling and simulation, the ability to exercise system solutions in a flight environment will be an essential aspect of validation. The NASA Langley Research Center (LaRC) Autonomy Incubator seeks to develop a flight simulation infrastructure for ab initio modeling and simulation that assumes no specific NAS architecture and models vehicle-to-vehicle behavior to examine interactions and emergent behaviors among hundreds of intelligent aerial agents exhibiting collaborative, cooperative, coordinative, selfish, and malicious behaviors. The air transportation system of the future will be a complex adaptive system (CAS) characterized by complex and sometimes unpredictable (or unpredicted) behaviors that result from temporal and spatial interactions among large numbers of participants. A CAS not only evolves with a changing environment and adapts to it, it is closely coupled to all systems that constitute the environment. Thus, the ecosystem that contains the system and other systems evolves with the CAS as well. The effects of the emerging adaptation and co-evolution are difficult to capture with only combined mathematical and computational experimentation. Therefore, an ab initio flight simulation environment must accommodate individual vehicles, groups of self-organizing vehicles, and large-scale infrastructure behavior. Inspired by Massively Multiplayer Online Role Playing Games (MMORPG) and Serious Gaming, the proposed ab initio simulation environment is similar to online gaming environments in which player participants interact with each other, affect their environment, and expect the simulation to persist and change regardless of any individual player's active participation.

DOI: 10.2514/1.53975 Policy decisions that target effective utilization of the national airspace often relate to the capacities of individual airports in the system, and decisions to increase or reduce capacity (e.g., via slot restrictions) must be supported quantitatively. It is of particular interest to assess global impacts of capacity adjustments, because addressing congestion issues at one airport may have a“ripple effect” on the utilization of capacity elsewhere in the network. In this paper, an analytical model was developed that addresses system-wide implications of capacity decisions at the levelofinteractionsbetweenOperationalEvolutionPartnership35airports.Twomainelementscomprisethemodel: 1) a network flow model that describes both the capacities of Operational Evolution Partnership 35 airports and the demand for aircraft serving origin–destination traffic across the network and 2) a novel mathematical program referred to as the minimax node utilization problem that, when solved, minimizes the worst-case capacity utilization across all of the airports in the network. Both elements combine to allow quick assessment of both local and global effects of airport capacity adjustments. The analytical model is evaluated via case studies, including two capacity reduction scenarios and one capacity expansion scenario, focusing on the model’s ability to describe how capacity influences airport utilization throughout a network representing actual origin–destination demands in the airspace. The results from these scenarios indicate that the model provides a simple and effective technique for describing impacts of airport capacity perturbations, providing valuable high-level insight into airport utilization patterns.

Analytical features of multidisciplinary optimization (MDO) problem formulations have significant practical consequences for the ability of nonlinear programming algorithms to solve the resulting computational optimization problems reliably and efficiently. We explore this important but frequently overlooked fact using the notion of disciplinary autonomy. Disciplinary autonomy is a desirable goal in formulating and solving MDO problems; however, the resulting system optimization problems are frequently difficult to solve. We illustrate the implications of MDO problem formulation for the tractability of the resulting design optimization problem by examining a representative class of MDO problem formulations known as collaborative optimization. We also discuss an alternative problem formulation, distributed analysis optimization, that yields a more tractable computational optimization problem.

This workdiscussesan approach,e rst-orderapproximation and modelmanagementoptimization (AMMO), for solving design optimization problems that involve computationally expensive simulations. AMMO maximizes the use of lower-e delity, cheaper models in iterative procedures with occasional, but systematic, recourse to highere delity, more expensive models for monitoring the progress of design optimization. A distinctive feature of the approach is thatit is globally convergent to a solution oftheoriginal, high-e delity problem. VariantsofAMMObased on three nonlinear programming algorithms are demonstrated on a three-dimensional aerodynamic wing optimization problemand atwo-dimensionalairfoiloptimizationproblem. Euleranalysisonmeshesof varying degrees of ree nement provides a suite of variable-e delity models. Preliminary results indicate threefold savings in terms of high-e delity analyses for the three-dimensional problem and twofold savings for the two-dimensional problem.

First-order approximation/model management optimization (AMMO) is a rigorous methodology for solving high-fidelity optimization problems with minimal expense in high-fidelity function and derivative evaluation. AMMO is a general approach that is applicable to any derivative based optimization algorithm and any combination of high-fidelity and low-fidelity models. This paper gives an overview of the principles that underlie AMMO and puts the method in perspective with other similarly motivated methods. AMMO is first illustrated by an example of a scheme for solving bound-constrained optimization problems. The principles can be easily extrapolated to other optimization algorithms. The applicability to general models is demonstrated on two recent computational studies of aerodynamic optimization with AMMO. One study considers variable-resolution models, where the high-fidelity model is provided by solutions on a fine mesh, while the corresponding low-fidelity model is computed by solving the same differential equations on a coarser mesh. The second study uses variable-fidelity physics models, with the high-fidelity model provided by the Navier-Stokes equations and the low-fidelity model—by the Euler equations. Both studies show promising savings in terms of high-fidelity function and derivative evaluations. The overview serves to introduce the reader to the general concept of AMMO and to illustrate the basic principles with current computational results.

The complexity of the present system for managing air traffic has led to "discreteness" in approaches to creating new concepts: new concepts are created as point designs, based on experience, expertise, and creativity of the proposer. Discrete point designs may be highly successful but they are difficult to substantiate in the face of equally strong substantiation of competing concepts, as well as the state of the art in concept evaluation via simulations. Hybrid concepts may present a compromise - the golden middle. Yet a hybrid of sometimes in principle incompatible concepts forms another point design that faces the challenge of substantiation and validation. We are faced with the need to re-design the air transportation system ab initio. This is a daunting task, especially considering the problem of transitioning from the present system to any fundamentally new system. However, design from scratch is also an opportunity to reconsider approaches to new concept development. In this position paper we propose an approach, Optimized Parametric Functional Design, for systematic development of concepts for management and control of airspace systems, based on optimization formulations in terms of required system functions and states. This reasoning framework, realizable in the context of ab initio system design, offers an approach to deriving substantiated airspace management and control concepts. With growing computational power, we hope that the approach will also yield a methodology for actual dynamic control of airspace

The Air Traffic Monotonic Lagrangian Grid (ATMLG) is used to simulate a 24 hour period of air traffic flow in the National Airspace System (NAS). During this time period, there are 41,594 flights over the United States, and the flight plan information (departure and arrival airports and times, and waypoints along the way) are obtained from an Federal Aviation Administration (FAA) Enhanced Traffic Management System (ETMS) dataset. Two simulation procedures are tested and compared: one based on the Monotonic Lagrangian Grid (MLG), and the other based on the stationary Latitude-Longitude (LatLong) grid. Simulating one full day of air traffic over the United States required the following amounts of CPU time on a single processor of an SGI Altix: 88 s for the MLG method, and 163 s for the Lat-Long grid method. We present a discussion of the amount of CPU time required for each of the simulation processes (updating aircraft trajectories, sorting, conflict detection and resolution, etc.), and show that the main advantage of the MLG method is that it is a general sorting algorithm that can sort on multiple properties. We discuss how many MLG neighbors must be considered in the separation assurance procedure in order to ensure a five-mile separation buffer between aircraft, and we investigate the effect of removing waypoints from aircraft trajectories. When aircraft choose their own trajectory, there are more flights with shorter duration times and fewer CD&R maneuvers, resulting in significant fuel savings.

The Air Traffic Monotonic Lagrangian Grid (ATMLG) is presented as a tool to evaluate new air traffic system concepts. The model, based on an algorithm called the Monotonic Lagrangian Grid (MLG), can quickly sort, track, and update positions of many aircraft, both on the ground (at airports) and in the air. The underlying data structure is based on the MLG, which is used for sorting and ordering positions and other data needed to describe N moving bodies and their interactions. Aircraft that are close to each other in physical space are always near neighbors in the MLG data arrays, resulting in a fast nearest-neighbor interaction algorithm that scales as N. Recent upgrades to ATMLG include adding blank place-holders within the MLG data structure, which makes it possible to dynamically change the MLG size and also improves the quality of the MLG grid. Additional upgrades include adding FAA flight plan data, such as way-points and arrival and departure times from the Enhanced Traffic Management System (ETMS), and combining the MLG with the state-of-the-art strategic and tactical conflict detection and resolution algorithms from the NASA-developed Stratway software. In this paper, we present results from our early efforts to couple ATMLG with the Stratway software, and we demonstrate that it can be used to quickly simulate air traffic flow for a very large ETMS dataset.

This paper describes the continued development of a dynamic air-traffic model, ATMLG, intended for rapid evaluation of rules and methods to control and optimize transport systems. The underlying data structure is based on the Monotonic Lagrangian Grid (MLG), which is used for sorting and ordering positions and other data needed to describe N moving bodies, and their interactions. In ATMLG, the MLG is combined with algorithms for collision avoidance and updating aircraft trajectories. Aircraft that are close to each other in physical space are always near neighbors in the MLG data arrays, resulting in a fast nearest-neighbor interaction algorithm that scales as N. In this paper, we use ATMLG to examine how the ability to maintain a required separation between aircraft decreases as the number of aircraft in the volume increases. This requires keeping track of the primary and subsequent collision avoidance maneuvers necessary to maintain a five mile separation distance between all aircraft. Simulation results show that the number of collision avoidance moves increases exponentially with the number of aircraft in the volume.

The promise of the Next Generation Air Transportation System (NextGen) is strongly tied to the concept of trajectory-based operations in the national airspace system. Existing efforts to develop trajectory management concepts are largely focused on individual trajectories, optimized independently, then de-conflicted among each other, and individually re-optimized, as possible. The benefits in capacity, fuel, and time are valuable, though perhaps could be greater through alternative strategies. The concept of agent-based trajectories offers a strategy for automation of simultaneous multiple trajectory management. The anticipated result of the strategy would be dynamic management of multiple trajectories with interacting and interdependent outcomes that satisfy multiple, conflicting constraints. These constraints would include the business case for operators, the capacity case for the Air Navigation Service Provider (ANSP), and the environmental case for noise and emissions. The benefits in capacity, fuel, and time might be improved over those possible under individual trajectory management approaches. The proposed approach relies on computational agent-based modeling (ABM), combinatorial mathematics, as well as application of "traffic physics" concepts to the challenge, and modeling and simulation capabilities. The proposed strategy could support transforming air traffic control from managing individual aircraft behaviors to managing systemic behavior of air traffic in the NAS. A system built on the approach could provide the ability to know when regions of airspace approach being "full," that is, having non-viable local solution space for optimizing trajectories in advance.

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

This paper is one of a set of papers, developed simultaneously and presented within a single conference session, that are intended to highlight systems analysis and design capabilities within the Systems Analysis and Concepts Directorate (SACD) of the National Aeronautics and Space Administration (NASA) Langley Research Center (LaRC). This paper focuses on the specific capabilities of uncertainty/risk analysis, quantification, propagation, decomposition, and management, robust/reliability design methods, and extensions of these capabilities into decision analysis methods within SACD. These disciplines are discussed together herein under the name of Decision Support Methods and Tools. Several examples are discussed which highlight the application of these methods within current or recent aerospace research at the NASA LaRC. Where applicable, commercially available, or government developed software tools are also discussed

This work is motivated by the need to reconsider the methods for the analysis and design of air transportation networks in order to meet increasing demands in the face of the current hub-and-spoke network near-saturation. In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike traditional random networks. Three properties—small-world, power law, and constant clustering coefficient—describe what are now most commonly referred to as scale-free networks. How do scale-free networks form? It is well documented that a network generated by adding nodes and edges preferentially will be scale-free. Are there other mechanisms? Why do networks organize themselves in this way? What causes a scale-free network to degrade? The focus of our research is to understand what drives a collection of nodes to organize as a scale-free network. Furthermore, once a network is scale-free what disrupts this apparently natural structure. To answer these questions we build a discrete-event simulation, nominally of an air transport system. The simulation is written in C.

Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a collection of processes that provide a means for dynamic reasoning about MDO problems in a range of contexts. The approach may be summarized as follows. Description of disciplinary data according to the rules of a grammar, followed by lexical analysis and compilation, yields basic computational components that can be assembled into various MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. The range of contexts for reasoning about MDO spans tasks from error checking and derivative computation to formulation and reformulation of optimization problem statements. In highly structured contexts, reconfigurability can mean a straightforward transformation among problem formulations with a single operation. We hope that REMS will enable experimentation with a variety of problem formulations in research environments, assist in the assembly of MDO test problems, and serve as a pre-processor in computational frameworks in production environments. Part 1 of two companion papers, discusses the fundamentals of REMS. This paper, Part 2 illustrates the methodology in more detail.