Search NASA⌕ Search

SEARCH · Search NASA

Results for “Trade Tree”

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

Trade Space Assessment for Human Exploration Mission Design

Many human space exploration mission architecture assessments have been performed over the years by diverse organizations and individuals. Direct comparison of metrics among these studies is extremely difficult due to widely varying assumptions involving projected technology readiness, mission goals, acceptable risk criteria, and socio-political environments. However, constant over the years have been the physical laws of celestial dynamics and rocket propulsion systems. A finite diverse yet finite architecture trade space should exist which captures methods of human exploration - particularly of the Moon and Mars - by delineating technical trades and cataloging the physically realizable options of each. A particular architectural approach should then have a traceable path through this "trade tree". It should be pointed out that not every permutation of paths will result in a physically realizable mission approach, but cataloging options that have been examined by past studies should help guide future analysis. This effort was undertaken in two phases by multi-center NASA working groups in the spring and summer of 2004 using more than thirty years of past studies to "flesh out" the Moon-Mars human exploration trade space. The results are presented, not as a "trade tree", which would be unwieldy, but as a "menu" of potential technical options as a function of mission phases. This is envisioned as a tool to aid future mission designers by offering guidance to relevant past analyses.

Joosten, B. Kent↗

Decision Space Modeling: Trade Space Ontology

As the National Aeronautics and Space Administration (NASA) works to develop a crewed Moon to Mars Architecture, it is dealing with a large decision space consisting of the overlay of human exploration architectures for both the Moon and for Mars. Efforts are underway to enable reasoning, analysis, and deliberation on this decision space. A critical first step is to develop a model of the decision space, which will then allow for various methods and techniques to be applied in support of the larger architecture decision-making process. The Trade Space Ontology consists of a set of terminologies and relations (an ontology) and a MagicDraw resource that enables documentation of decisions and alternatives. It also provides a means by which decisions and alternatives can be traced to other Systems Engineering artifacts. For documenting alternatives, the Trade Space Ontology adapts the Morphological Matrix methodology to The Systems Modeling Language (SysML) through a profile; custom diagrams are also implemented to simplify the profile's use. With the profile and custom diagrams, system architects can specify options for architecture attributes, as well as compatibility between them, in a compact visual format. While the approach shares similarities to a trade tree, the emphasis at this stage is less on enumerating specific combinations of options and instead on specifying the options and their compatibility. Enumeration of alternatives is performed by an external analysis that operates on an output file from a model constructed using the Trade Space Ontology. For decisions, the Trade Space Ontology provides a way to model generic precedence relationships as well as documenting inputs and outputs. These may include what alternatives, criteria, and rationale are understood to be relevant for each decision. Importantly, the decision-making side of the Trade Space Ontology is defined at a more general level, such that it can be adapted to the specific terms in use by projects and programs at NASA. However, this adaptability also means that less capability is provided ``out-of-the-box'' from installation. Currently the resource includes plugin functionality to enumerate paths through generic precedence relationships between decisions and to export these paths to a spreadsheet. Custom dependency stereotypes are included in the profile to indicate the cross-cutting relationships between the trade space and the architecture decisions, providing a means to map which parts of the trade space enumerate alternatives for a decision, and to identify how the output of a decision may modify the trade space through pruning or down-selection. While the motivating use case for this resource is in human exploration architectures, the broad applicability of the Morphological Matrix methodology indicates that the Trade Space Ontology should also be useful for other activities and tasks at the agency.

Trade Tree↗

NASA Space Nuclear Propulsion (SNP) MBSE Initiatives

NASA’s Space Nuclear Propulsion (SNP) program is developing several MagicDraw SysML models to support the development of high performance Nuclear Thermal Rocket Engines (NTRE). Currently, the Demonstration Rocket for Agile Cislunar Operations (DRACO) project is aiming to perform the first ever flight demonstration of an NTRE, and NASA is developing a DRACO Insight Project Model Based Systems Engineering (MBSE) model to capture, define, analyze, and report on the flight and ground test system architecture, functional behavior, requirements, risks, and lessons learned. Additional models are in work for engine component trade trees, fault detection sensor coverage analysis using a Goal Function Tree (GFT) plugin, stakeholder engagement, and technology maturation projects. The GFT plugin is the Galois, Inc. Failure Recovery Instruction Generation using Automata derived from Traditional Engineering models (FRIGATE) tool. A new capability for Jira to MagicDraw data sharing using the OpenPDM collaboration platform is under development with partner Victory Solutions, Inc. to enhance risk impact analysis.

Space Nuclear Propulsion (SNP)↗

Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves

One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.

Mengshoel, Ole J.↗

Tree Growth Enhancement Drives a Persistent Biomass Gain in Unmanaged Temperate Forests

While enhanced tree growth over the last decades has been reported in forests across the globe, it remains unclear whether it drives persistent biomass increases of forest stands, particularly in mature forests. Enhanced tree growth and stand-level biomass are often linked with a simultaneous increase in density-driven mortality and a reduction in tree longevity. Identifying empirical evidence regarding the balance between these processes is challenging due to the confounding effects of stand history, management, and environmental changes. Here, we investigate the link between growth and biomass via the negative relationship between average tree size and stand density (tree number per area). We find increasing stand density for a given mean tree size in unmanaged closed-canopy forests in Switzerland over the past six decades and a positive relationship between tree growth and stand density across forest plots—qualitatively consistent with our simulations using a mechanistic, cohort-resolving ecosystem model (BiomeE). Model simulations show that, in the absence of other disturbances, enhanced tree growth persistently increases biomass stocks despite simultaneous decreases in carbon residence time and tree longevity. However, the magnitude of simulated biomass changes for a given growth enhancement critically depends on the shape of the mortality functions. Our analyses reconcile reports of growth-induced reductions of tree longevity with model predictions of persistent biomass increases, and with our finding of trends toward denser forests in response to growth—also in mature stands.

biomass stocks↗

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗

The P-Mesh: A Commodity-based Scalable Network Architecture for Clusters

We designed a new network architecture, the P-Mesh which combines the scalability and fault resilience of a torus with the performance of a switch. We compare the scalability, performance, and cost of the hub, switch, torus, tree, and P-Mesh architectures. The latter three are capable of scaling to thousands of nodes, however, the torus has severe performance limitations with that many processors. The tree and P-Mesh have similar latency, bandwidth, and bisection bandwidth, but the P-Mesh outperforms the switch architecture (a lower bound for tree performance) on 16-node NAB Parallel Benchmark tests by up to 23%, and costs 40% less. Further, the P-Mesh has better fault resilience characteristics. The P-Mesh architecture trades increased management overhead for lower cost, and is a good bridging technology while the price of tree uplinks is expensive.

Nitzberg, Bill↗

Medical Resource Set Bulky Item Trade Space Analysis for Spaceflight Medical Risk

The NASA engineering community utilizes event-driven and fault-tree probabilistic techniques to classify risks in the space environment by taking advantage of the inherent knowledge of complex spaceflight system design and testing to quantify failure risk. In harmonizing the risk of human space flight, answering the question of ‘How do we balance health, performance and resource risks with other engineering risks on long duration space missions?’ remains a deeply challenging and largely qualitative practice. The Medical Extensible Dynamic Probabilistic Risk Assessment Tool (MEDPRAT) is one aspect of the efforts by NASA’s Human Research Program (HRP) to quantitatively assess the impact of health and performance risk. One of MEDPRAT’s key features is its high degree of computational efficiency. Coupled with the HRP High Performance Compute cluster located at NASA’s Glenn Research Center, MEDPRAT runs millions of simulated missions in a matter of minutes. This degree of computational efficiency provides the novel opportunity to explore the relationship between medical set mass, volume, and medical resource size. Of particular interest for future human spaceflight missions are ‘bulky’ items, medical resources like devices, which occupy a large portion of the small, allocated mass and volume for the medical set leaving less room for other resources. This talk will present results showing the quantitative impact of forced inclusion of several bulky items across a variety of medical kit constraints, and the effect that a potential research investment into reducing the bulky item mass and volume may have on risk.

Lauren Mcintyre↗

Tree-mendous Timber Evaluation

Funded and administered by NASA, the Affiliated Research Center (ARC) program transfers geospatial technologies from the Space Agency and participating universities to commercial companies, non-profit and trade organizations, and tribal governments. The origins of the ARC program date back to 1988, when NASA's Stennis Space Center initiated the Visiting Investigator Program to bring industry closer to spatial information technologies. The success of this trial program led to an expansion into the ARC program, whose goal is to enhance competitiveness of U.S. industries through more efficient use of remote sensing and related technologies. NASA's ARC program served as the foundation for the development of International Hardwood Resources, which then grew into Falcon Informatics with the acquisition of a technology from a European software company and a change of business models. Doylestown, Pennsylvania-based Falcon Informatics is now a world-leading information services company that combines in-depth timber industry experience with state-of-the-art software to serve the needs of national governments, international paper companies, and timber-investment management organizations.

Source record↗

Proposed reliability cost model

The research investigations which were involved in the study include: cost analysis/allocation, reliability and product assurance, forecasting methodology, systems analysis, and model-building. This is a classic example of an interdisciplinary problem, since the model-building requirements include the need for understanding and communication between technical disciplines on one hand, and the financial/accounting skill categories on the other. The systems approach is utilized within this context to establish a clearer and more objective relationship between reliability assurance and the subcategories (or subelements) that provide, or reenforce, the reliability assurance for a system. Subcategories are further subdivided as illustrated by a tree diagram. The reliability assurance elements can be seen to be potential alternative strategies, or approaches, depending on the specific goals/objectives of the trade studies. The scope was limited to the establishment of a proposed reliability cost-model format. The model format/approach is dependent upon the use of a series of subsystem-oriented CER's and sometimes possible CTR's, in devising a suitable cost-effective policy.

Delionback, L. M.↗

The Kepler Mission: A Search for Terrestrial Planets - Development Status

We have embarked on a mission to detect terrestrial planets. The space mission has been optimized to search for earth-size planets (0.5 to 10 earth masses) in the habitable zone (HZ) of solar-like stars. Given this design, the mission will necessarily be capable of not only detecting Earth analogs, but a wide range of planetary types and characteristics ranging from Mercury-size objects with orbital periods of days to gas-giants in decade long orbits that have undeniable signatures even with only one transit detected. The mission is designed to survey the full range of spectral-type dwarf stars. The approach is to detect the periodic signal of transiting planets. Three or more transits of a star exceeding a combined threshold of eight sigma with a statistically consistent period, brightness change and duration provide a rigorous method of detection. From the relative brightness change the planet size can be calculated. From the period the orbital size can be calculated and its location relative to the HZ determined. Presented here are: the mission goals, the top level system design requirements derived from these goals that drive the flight system design, a number of the trades that have lead to the mission concept, expected photometric performance dependence on stellar brightness and spectral type based on the system 'noise tree' analysis. Updated estimates are presented of the numbers of detectable planets versus size, orbit, stellar spectral type and distances based on a planet frequency hypothesis. The current project schedule and organization are given.

Koch, David↗

Sequential Testing Algorithms for Multiple Fault Diagnosis

In this paper, we consider the problem of constructing optimal and near-optimal test sequencing algorithms for multiple fault diagnosis. The computational complexity of solving the optimal multiple-fault isolation problem is super-exponential, that is, it is much more difficult than the single-fault isolation problem, which, by itself, is NP-hard. By employing concepts from information theory and AND/OR graph search, we present several test sequencing algorithms for the multiple fault isolation problem. These algorithms provide a trade-off between the degree of suboptimality and computational complexity. Furthermore, we present novel diagnostic strategies that generate a diagnostic directed graph (digraph), instead of a diagnostic tree, for multiple fault diagnosis. Using this approach, the storage complexity of the overall diagnostic strategy reduces substantially. The algorithms developed herein have been successfully applied to several real-world systems. Computational results indicate that the size of a multiple fault strategy is strictly related to the structure of the system.

Shakeri, Mojdeh↗

Sequential Test Strategies for Multiple Fault Isolation

In this paper, we consider the problem of constructing near optimal test sequencing algorithms for diagnosing multiple faults in redundant (fault-tolerant) systems. The computational complexity of solving the optimal multiple-fault isolation problem is super-exponential, that is, it is much more difficult than the single-fault isolation problem, which, by itself, is NP-hard. By employing concepts from information theory and Lagrangian relaxation, we present several static and dynamic (on-line or interactive) test sequencing algorithms for the multiple fault isolation problem that provide a trade-off between the degree of suboptimality and computational complexity. Furthermore, we present novel diagnostic strategies that generate a static diagnostic directed graph (digraph), instead of a static diagnostic tree, for multiple fault diagnosis. Using this approach, the storage complexity of the overall diagnostic strategy reduces substantially. Computational results based on real-world systems indicate that the size of a static multiple fault strategy is strictly related to the structure of the system, and that the use of an on-line multiple fault strategy can diagnose faults in systems with as many as 10,000 failure sources.

Shakeri, M.↗

Modeling In-Space Aborts for NASA Human Exploration Missions

NASA is developing new capabilities to send humans beyond low Earth orbit (LEO) for the first time in several decades with the new Multi-purpose Crew Vehicle (MPCV) Orion spacecraft and Space Launch System (SLS) launch vehicle. As part of these capabilities, NASA is developing means to terminate missions prior to reaching mission destinations in order to save the crew in the event of critical life-threatening failures. This abort capability exists for both ascent and in-space operations. While the risk associated with ascent aborts has been modeled in detail, less has been done in the area of in-space aborts (e.g. Apollo 13). Recent efforts have started to better assess the risk associated with in-space aborts. This paper will describe these efforts. The in-space abort model described in this paper is part of a larger Cross-Program PRA (XPRA) model of exploration missions planned in the next few years to the vicinity of the Moon. The model consists of linked event trees and fault trees and associated rules built using the Systems Analysis Program for Hands-On Integrated Reliability Evaluations (SAPHIRE) tool. This model structure is being built with flexibility in mind in order to perform risk trades and further expansion of the model.

Bigler, Mark A.↗

Trade Studies of Space Launch Architectures using Modular Probabilistic Risk Analysis

A top-down risk assessment in the early phases of space exploration architecture development can provide understanding and intuition of the potential risks associated with new designs and technologies. In this approach, risk analysts draw from their past experience and the heritage of similar existing systems as a source for reliability data. This top-down approach captures the complex interactions of the risk driving parts of the integrated system without requiring detailed knowledge of the parts themselves, which is often unavailable in the early design stages. Traditional probabilistic risk analysis (PRA) technologies, however, suffer several drawbacks that limit their timely application to complex technology development programs. The most restrictive of these is a dependence on static planning scenarios, expressed through fault and event trees. Fault trees incorporating comprehensive mission scenarios are routinely constructed for complex space systems, and several commercial software products are available for evaluating fault statistics. These static representations cannot capture the dynamic behavior of system failures without substantial modification of the initial tree. Consequently, the development of dynamic models using fault tree analysis has been an active area of research in recent years. This paper discusses the implementation and demonstration of dynamic, modular scenario modeling for integration of subsystem fault evaluation modules using the Space Architecture Failure Evaluation (SAFE) tool. SAFE is a C++ code that was originally developed to support NASA s Space Launch Initiative. It provides a flexible framework for system architecture definition and trade studies. SAFE supports extensible modeling of dynamic, time-dependent risk drivers of the system and functions at the level of fidelity for which design and failure data exists. The approach is scalable, allowing inclusion of additional information as detailed data becomes available. The tool performs a Monte Carlo analysis to provide statistical estimates. Example results of an architecture system reliability study are summarized for an exploration system concept using heritage data from liquid-fueled expendable Saturn V/Apollo launch vehicles.

Mathias, Donovan L.↗

Comparative Analysis of Static and Dynamic Probabilistic Risk Assessment

This study examines three different methodologies for producing loss-of-mission (LOM) and loss-of-crew (LOC) risks estimates for probabilistic risk assessments (PRA) of crewed spacecraft. The three bottom-up, component-based PRA approaches examined are a traditional static fault tree, a dynamic Monte Carlo simulation, and a fault tree hybrid that incorporates some dynamic elements. These approaches were used to model the reaction control system thruster pod of a generic crewed spacecraft and mission, and a comparative analysis of the methods is presented. The methodologies are assessed in terms of the process of modeling a system, the actionable information produced for the design team, and the overall fidelity of the quantitative risk evaluation generated. The system modeling process is compared in terms of the effort required to generate the initial model, update the model in response to design changes, and support mass-versus-risk trade studies. The results are compared by examining the top-level LOM/LOC estimates and the relative risk driver rankings at the failure mode level. The fidelity of each modeling methodology is discussed in terms of its capability to handle real-world system dynamics such as cold-sparing, changes in mission operations due to loss of redundancy, and common cause failure modes. The paper also discusses the applicability of each methodology to different phases of system development and shows that a single methodology may not be suitable for all of the many purposes of a spacecraft PRA. The fault tree hybrid approach is shown to be best suited to the needs of early assessments during conceptual design phases. As the design begins to mature, the level of detail represented in the risk model must go beyond redundancy and nominal mission operations to include dynamic, time- and state-dependent system responses as well as diverse system capabilities. This is best accomplished using the dynamic simulation approach, since these phenomena are not easily captured by static methods. Ultimately, once the design has been finalized and the goal of the PRA is to provide design validation and requirement verification, more traditional, static fault tree approaches may become as appropriate as the simulation method.

Mattenberger, Christopher J.↗

Goal-Function Tree Modeling for Systems Engineering and Fault Management

The draft NASA Fault Management (FM) Handbook (2012) states that Fault Management (FM) is a "part of systems engineering", and that it "demands a system-level perspective" (NASAHDBK- 1002, 7). What, exactly, is the relationship between systems engineering and FM? To NASA, systems engineering (SE) is "the art and science of developing an operable system capable of meeting requirements within often opposed constraints" (NASA/SP-2007-6105, 3). Systems engineering starts with the elucidation and development of requirements, which set the goals that the system is to achieve. To achieve these goals, the systems engineer typically defines functions, and the functions in turn are the basis for design trades to determine the best means to perform the functions. System Health Management (SHM), by contrast, defines "the capabilities of a system that preserve the system's ability to function as intended" (Johnson et al., 2011, 3). Fault Management, in turn, is the operational subset of SHM, which detects current or future failures, and takes operational measures to prevent or respond to these failures. Failure, in turn, is the "unacceptable performance of intended function." (Johnson 2011, 605) Thus the relationship of SE to FM is that SE defines the functions and the design to perform those functions to meet system goals and requirements, while FM detects the inability to perform those functions and takes action. SHM and FM are in essence "the dark side" of SE. For every function to be performed (SE), there is the possibility that it is not successfully performed (SHM); FM defines the means to operationally detect and respond to this lack of success. We can also describe this in terms of goals: for every goal to be achieved, there is the possibility that it is not achieved; FM defines the means to operationally detect and respond to this inability to achieve the goal. This brief description of relationships between SE, SHM, and FM provide hints to a modeling approach to provide formal connectivity between the nominal (SE), and off-nominal (SHM and FM) aspects of functions and designs. This paper describes a formal modeling approach to the initial phases of the development process that integrates the nominal and off-nominal perspectives in a model that unites SE goals and functions of with the failure to achieve goals and functions (SHM/FM). This methodology and corresponding model, known as a Goal-Function Tree (GFT), provides a means to represent, decompose, and elaborate system goals and functions in a rigorous manner that connects directly to design through use of state variables that translate natural language requirements and goals into logical-physical state language. The state variable-based approach also provides the means to directly connect FM to the design, by specifying the range in which state variables must be controlled to achieve goals, and conversely, the failures that exist if system behavior go out-of-range. This in turn allows for the systems engineers and SHM/FM engineers to determine which state variables to monitor, and what action(s) to take should the system fail to achieve that goal. In sum, the GFT representation provides a unified approach to early-phase SE and FM development. This representation and methodology has been successfully developed and implemented using Systems Modeling Language (SysML) on the NASA Space Launch System (SLS) Program. It enabled early design trade studies of failure detection coverage to ensure complete detection coverage of all crew-threatening failures. The representation maps directly both to FM algorithm designs, and to failure scenario definitions needed for design analysis and testing. The GFT representation provided the basis for mapping of abort triggers into scenarios, both needed for initial, and successful quantitative analyses of abort effectiveness (detection and response to crew-threatening events).

Patterson, Jonathan D.↗

Comparative Analysis of Static and Dynamic Probabilistic Risk Assessment

Implementation of risk-informed design allows the design team to thoroughly explore the risks of a system while iterating the operations concept, design, and requirements until the system meets mission objects and is achievable within constraints. To arrive at a space system design that is likely to meet all constraints placed upon mass, cost, performance and risk, the system requirements must be understood and traded against each other as early as the conceptual design phase. Depending on the project phase and the goals of the risk analysis, various PRA methodologies could be used to produce quantitative risk estimates to enable such a process. In order to better understand the applicability, advantages, and limitations of various PRA methodologies, a comparative analysis of three bottom-up, component-based PRA approaches was performed. The three methods examined are a traditional static fault tree, a fault tree hybrid, and a dynamic Monte Carlo simulation. Each approach was used to assess a generic reaction control system (RCS) thruster pod and mission. The methods are assessed in terms of the process of modeling a system, the actionable information produced for the design team, and the overall fidelity of the quantitative risk evaluation generated. The paper also discusses the applicability of each methodology to the different phases of system development.

Probablistic↗