Search NASA⌕ Search

SEARCH · Search NASA

Results for “scenario framework”

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 37 records · Page 2

Development of a Flexible Framework of Common Hypersonic Navier-Strokes Meshes for the Space Shuttle Orbiter

A flexible framework for the development of block structured volume grids for hypersonic Navier-Stokes flow simulations was developed for analysis of the Shuttle Orbiter Columbia. The development of the flexible framework, resulted in an ability to quickly generate meshes to directly correlate solutions contributed by participating groups on a common surface mesh, providing confidence for the extension of the envelope of solutions and damage scenarios. The framework draws on the experience of NASA Langely and NASA Ames Research Centers in structured grid generation, and consists of a grid generation process that is implemented through a division of responsibilities. The nominal division of labor consisted of NASA Johnson Space Center coordinating the damage scenarios to be analyzed by the Aerothermodynamics Columbia Accident Investigation (CAI) team, Ames developing the surface grids that described the computational volume about the orbiter, and Langely improving grid quality of Ames generated data and constructing the final volume grids. Distributing the work among the participants in the Aerothermodynamic CIA team resulted in significantly less time required to construct complete meshes than possible by any individual participant. The approach demonstrated that the One-NASA grid generation team could sustain the demand for new meshes to explore new damage scenarios within a aggressive timeline.

Alter, Stephen J.↗

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗

The Los Angeles 100% Renewable Energy Study (LA100): Chapter 2. Study Approach

The City of Los Angeles has set ambitious goals to transform its electricity supply, aiming to achieve a 100% renewable energy power system by 2045, along with aggressive electrification targets for buildings and vehicles. To reach these goals, and assess the implications for jobs, electricity rates, the environment, and environmental justice, the Los Angeles City Council passed a series of motions directing the Los Angeles Department of Water and Power (LADWP) to determine the technical feasibility and investment pathways of a 100% renewable energy portfolio standard. The Los Angeles 100% Renewable Energy Study (LA100) is a first-of-its-kind objective, rigorous, and science-based power systems analysis to determine what investments could be made to achieve these goals. The LA100 final report is presented as a collection of 12 chapters and an executive summary, each of which is available as an individual download. This chapter describes the LA100 study approach, including the modeling framework and scenarios.

100% Renewable↗

Automation life-cycle cost model

The problem domain being addressed by this contractual effort can be summarized by the following list: Automation and Robotics (A&R) technologies appear to be viable alternatives to current, manual operations; Life-cycle cost models are typically judged with suspicion due to implicit assumptions and little associated documentation; and Uncertainty is a reality for increasingly complex problems and few models explicitly account for its affect on the solution space. The objectives for this effort range from the near-term (1-2 years) to far-term (3-5 years). In the near-term, the envisioned capabilities of the modeling tool are annotated. In addition, a framework is defined and developed in the Decision Modelling System (DEMOS) environment. Our approach is summarized as follows: Assess desirable capabilities (structure into near- and far-term); Identify useful existing models/data; Identify parameters for utility analysis; Define tool framework; Encode scenario thread for model validation; and Provide transition path for tool development. This report contains all relevant, technical progress made on this contractual effort.

Gathmann, Thomas P.↗

Designing Agent Collectives For Systems With Markovian Dynamics

The "Collective Intelligence" (COIN) framework concerns the design of collectives of agents so that as those agents strive to maximize their individual utility functions, their interaction causes a provided "world" utility function concerning the entire collective to be also maximized. Here we show how to extend that framework to scenarios having Markovian dynamics when no re-evolution of the system from counter-factual initial conditions (an often expensive calculation) is permitted. Our approach transforms the (time-extended) argument of each agent's utility function before evaluating that function. This transformation has benefits in scenarios not involving Markovian dynamics, in particular scenarios where not all of the arguments of an agent's utility function are observable. We investigate this transformation in simulations involving both linear and quadratic (nonlinear) dynamics. In addition, we find that a certain subset of these transformations, which result in utilities that have low "opacity (analogous to having high signal to noise) but are not "factored" (analogous to not being incentive compatible), reliably improve performance over that arising with factored utilities. We also present a Taylor Series method for the fully general nonlinear case.

Wolpert, David H.↗

The Design of Collectives of Agents to Control Non-Markovian Systems

The 'Collective Intelligence' (COIN) framework concerns the design of collectives of reinforcement-learning agents such that their interaction causes a provided 'world' utility function concerning the entire collective to be maximized. Previously, we applied that framework to scenarios involving Markovian dynamics where no re-evolution of the system from counter-factual initial conditions (an often expensive calculation) is permitted. This approach sets the individual utility function of each agent to be both aligned with the world utility, and at the same time, easy for the associated agents to optimize. Here we extend that approach to systems involving non-Markovian dynamics. In computer simulations, we compare our techniques with each other and with conventional-'team games'. We show whereas in team games performance often degrades badly with time, it steadily improves when our techniques are used. We also investigate situations where the system's dimensionality is effectively reduced. We show that this leads to difficulties in the agents' ability to learn. The implication is that 'learning' is a property only of high-enough dimensional systems.

Lawson, John W.↗

Designing Agent Collectives For Systems With Markovian Dynamics

The Collective Intelligence (COIN) framework concerns the design of collectives of agents so that as those agents strive to maximize their individual utility functions, their interaction causes a provided world utility function concerning the entire collective to be also maximized. Here we show how to extend that framework to scenarios having Markovian dynamics when no re-evolution of the system from counter-factual initial conditions (an often expensive calculation) is permitted. Our approach transforms the (time-extended) argument of each agent's utility function before evaluating that function. This transformation has benefits in scenarios not involving Markovian dynamics of an agent's utility function are observable. We investigate this transformation in simulations involving both hear and quadratic (nonlinear) dynamics. In addition, we find that a certain subset of these transformations, which result in utilities that have low opacity (analogous to having high signal to noise) but are not factored (analogous to not being incentive compatible), reliably improve performance over that arising with factored utilities. We also present a Taylor Series method for the fully general nonlinear case.

Wolpert, David H.↗

The Design of Collectives of Agents to Control Non-Markovian Systems

The Collective Intelligence (COIN) framework concerns the design of collectives of reinforcement-learning agents such that their interaction causes a provided "world" utility function concerning the entire collective to be maximized. Previously, we applied that framework to scenarios involving Markovian dynamics where no re-evolution of the system from counter-factual initial conditions (an often expensive calculation) is permitted. This approach sets the individual utility function of each agent to be both aligned with the world utility, and at the same time, easy for the associated agents to optimize. Here we extend that approach to systems involving non-Markovian dynamics. In computer simulations, we compare our techniques with each other and with conventional "team games". We show whereas in team games performance often degrades badly with time, it steadily improves when our techniques are used. We also investigate situations where the system's dimensionality is effectively reduced. We show that this leads to difficulties in the agents ability to learn. The implication is that learning is a property only of high-enough dimensional systems.

Lawson, John W.↗

Combinatorial Auction-Based Strategic Deconfliction of Federated UTM Airspace

Unmanned Aerial Vehicles (UAVs) have become commonly used to perform a wide range of commercial activities such as cinematography and medical supply delivery. Consequently, regulators have become interested in designing UAV Traffic Management systems (UTMs) to coordinate UAV traffic among a collection of UAV operators. One framework which has been recently proposed for a UTM system is a combinatorial auction. In this framework, airspace is modelled as a 4D grid of space-time cells. UAV operators bid on cells which collectively form paths for their UAVs. Ideally, an airspace auction should reveal information about the current price of flight paths to bidders, allowing bidders to identify and bid on a select number of paths instead of placing as many bids as possible in the hopes of stumbling on a cheap path. Revealing too much information, however, can allow bad actors to place bids which are intended not to win but to raise the price that a rival bidder must pay. We address these twin challenges with a new information revelation framework which provides bidders with wide-ranging pricing information while suppressing bad actors. We evaluate our framework on scenarios based on a Japan Aerospace Exploration Agency (JAXA) case study and find that it can scale to thousands of bids.

Christopher J C Leet↗

Network Emulation Testbed Capabilities for Prototyping Space DTN Software and Protocols

This paper delves into network emulation tools essential for evaluating and designing Delay Tolerant Networking (DTN) protocols in space and satellite networking. It surveys and assesses the capability of current testbeds to create realistic test environments crucial for developing and evaluating DTN protocols. Specifically, this study provides a comprehensive overview of key DTN protocol stacks and related network emulation platforms and a detailed exploration of NASA’s research facilities. Finally, the paper underscores the fundamental emulation capabilities and the importance of a standardized framework for scenario creation, highlighting its vital role in evaluating and advancing future emulation platforms for space DTN.

Network Emulation and Simulation↗

GCAP 2.0: A Global 3-D Chemical-Transport Model Framework for Past, Present, and Future Climate Scenarios

This manuscript describes version 2.0 of the Global Change and Air Pollution (GCAP 2.0) model framework, a one-way offline coupling between version of the NASA Goddard Institute for Space Studies (GISS) general circulation model (GCM) and the GEOS-Chem global 3-D chemical-transport model (CTM). Meteorology for driving GEOS-Chem has been archived from the E2.1 contributions to Phase 6 of the Coupled Model Intercomparison Project (CMIP6) for the preindustrial and recent past. In addition, meteorology is available for the near future and end-of-the century for seven future scenarios ranging from extreme mitigation to extreme warming. Emissions and boundary conditions have been prepared for input to GEOS-Chem that are consistent with the CMIP6 experimental design. The model meteorology, emissions, transport and chemistry are evaluated in the recent past and found to be largely consistent with GEOS-Chem driven by the Modern-Era Retrospective analysis for Research and Applications Version 2 (MERRA-2) product and with observational constraints.

Global Change and Air Pollution (GCAP 2.0) model↗

GCAP 2.0: A Global 3-D Chemical-Transport Model Framework for Past, Present, and Future Climate Scenarios

This paper describes version 2.0 of the Global Change and Air Pollution (GCAP 2.0) model framework, a one-way offline coupling between version E2.1 of the NASA Goddard Institute for Space Studies (GISS) general circulation model (GCM) and the GEOS-Chem global 3-D chemical-transport model (CTM). Meteorology for driving GEOS-Chem has been archived from the E2.1 contributions to phase 6 of the Coupled Model Intercomparison Project (CMIP6) for the pre-industrial era and the recent past. In addition, meteorology is available for the near future and end of the century for seven future scenarios ranging from extreme mitigation to extreme warming. Emissions and boundary conditions have been prepared for input to GEOS-Chem that are consistent with the CMIP6 experimental design. The model meteorology, emissions, transport, and chemistry are evaluated in the recent past and found to be largely consistent with GEOS-Chem driven by the Modern-Era Retrospective analysis for Research and Applications version 2 (MERRA-2) product and with observational constraints.

Global Change and Air Pollution (GCAP 2.0) model↗

Nominal and adversarial synthetic PMU data for standard IEEE test systems

GridSTAGE (Spatio-Temporal Adversarial scenario GEneration) is a framework for the simulation of adversarial scenarios and the generation of multivariate spatio-temporal data in cyber-physical systems. GridSTAGE is developed based on Matlab and leverages Power System Toolbox (PST) where the evolution of the power network is governed by nonlinear differential equations. Using GridSTAGE, one can create several event scenarios that correspond to several operating states of the power network by enabling or disabling any of the following: faults, AGC control, PSS control, exciter control, load changes, generation changes, and different types of cyber-attacks. Standard IEEE bus system data is used to define the power system environment. GridSTAGE emulates the data from PMU and SCADA sensors. The rate of frequency and location of the sensors can be adjusted as well. Detailed instructions on generating data scenarios with different system topologies, attack characteristics, load characteristics, sensor configuration, control parameters are available in the Github repository - https://github.com/pnnl/GridSTAGE. There is no existing adversarial data-generation framework that can incorporate several attack characteristics and yield adversarial PMU data. The GridSTAGE framework currently supports simulation of False Data Injection attacks (such as a ramp, step, random, trapezoidal, multiplicative, replay, freezing) and Denial of Service attacks (such as time-delay, packet-loss) on PMU data. Furthermore, it supports generating spatio-temporal time-series data corresponding to several random load changes across the network or corresponding to several generation changes. A Koopman mode decomposition (KMD) based algorithm to detect and identify the false data attacks in real-time is proposed in https://ieeexplore.ieee.org/document/9303022. Machine learning-based predictive models are developed to capture the dynamics of the underlying power system with a high level of accuracy under various operating conditions for IEEE 68 bus system. The corresponding machine learning models are available at https://github.com/pnnl/grid_prediction.

99 GENERAL AND MISCELLANEOUS↗

Evaluating long-term model-based scenarios of the energy system

Energy-economic models are used to provide science-based decision support in a variety of contexts. Analyses using these tools often involve defining a “reference” scenario, which serves as a counterfactual against which alternative scenarios are compared. Evaluating scenarios, including reference scenarios, is critical for establishing the credibility of the analyses these models support. We propose a framework for evaluating energy system scenarios which consists of three parts – a qualitative storyline, quantitative metrics, and evaluation criteria. We apply this framework to the reference scenario for GCAM-USA, a version of the global human-Earth system model GCAM (Global Change Assessment Model) with state-level detail in the United States, focusing on the evolution of the electric power sector. We develop new visual analytic tools to facilitate the evaluation of model outcomes in 51 sub-national regions, and demonstrate how scenario performance can be tracked and compared across four quantifications of the GCAM-USA reference scenario.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Learning to Simulate Aerosol Dynamics with Graph Neural Networks

Aerosol effects on climate, weather, and air quality depend on characteristics of individual particles, which are tremendously diverse and change in time. Particle-resolved models are the only models able to capture this diversity in particle physiochemical properties, and these models are computationally expensive. As a strategy for accelerating particle-resolved microphysics models, we introduce Graph-based Learning of Aerosol Dynamics (GLAD) and use this model to train a surrogate of the particle-resolved model PartMC-MOSAIC. GLAD implements a Graph Network-based Simulator (GNS), a machine learning framework that has been used to simulate particle-based fluid dynamics models. In GLAD, each particle is represented as a node in a graph, and the evolution of the particle population over time is simulated through learned message passing. Here, we demonstrate our GNS approach on a simple aerosol system that includes condensation of sulfuric acid onto particles composed of sulfate, black carbon, organic carbon, and water. A graph with particles as nodes is constructed, and a graph neural network (GNN) is then trained using the model output from PartMC-MOSAIC. The trained GNN can then be used for simulating and predicting aerosol dynamics over time. Results demonstrate the framework's ability to accurately learn chemical dynamics and generalize across different scenarios, achieving efficient training and prediction times. We evaluate the performance across four scenarios, highlighting the framework's robustness and adaptability in modeling aerosol microphysics and chemistry.

aerosol chemistry dynamics↗

Establishing the Framework for e-VTOL Flight Mission Scenario Development for Urban Air Mobility Research using Cognitive Task Analysis

This paper focuses on applying specific protocol aspects of Cognitive Task Analysis (CTA) methods to formulate non-routine flight mission use-case scenarios in support of a potential research study at the National Aeronautics and Space Administration (NASA) Langley Research Center under the Air Traffic Management – eXploration (ATM-X) Urban Air Mobility (UAM) sub-project. The objective of use-case scenarios is to provide a hypothetical situation to elicit expert knowledge and feedback in a specific subject matter area. Use-case scenarios in the field of aviation, including UAM, can help to support the safe integration of these vehicles into the National Airspace System (NAS) through the examination of airspace procedures during non-routine events. Inherent in this type of research is the need to study in-flight non-routine scenarios that the UAM vehicle could encounter. Situations categorized as non-routine events are any events that occur outside of the original flight plan such as a mechanical malfunction or other in-flight emergency requiring special procedures, which can include diversions to a specified, or non-specified, emergency landing area. In specific instances, some non-routine events could be considered as “routine” during in-flight operations, such as the need to perform a go-around due to a balked landing. As the rate of technological expansion surrounding UAM grows rapidly in modern aviation, so does the need for research that focuses on the safe integration of these vehicles including research with a focus on the methods and development of airspace operational procedures. Research rooted in CTA methods provides a framework for developing use-case scenarios appropriate for environments where mental demands are substantial. Substantial mental demands exist while operating in the NAS for pilots, airline dispatchers, and air traffic controllers among many others. With the focus on UAM in mind, it is critical to frame a baseline use-case scenario using information as it pertains to current-day airspace operations. According to Dr. Robert R. Hoffman’s “Protocols for Cognitive Task Analysis,” one of the first steps to applying CTA methods to research is the concept of “bootstrapping” in which the researcher(s) familiarize themselves with the domain that is being studied. To formulate the non-routine flight mission use-case scenarios for the purpose of this potential NASA ATM-X UAM research study, and to inform the baseline use-case scenario, the practice of bootstrapping was utilized to acquire knowledge of current-day airspace procedures.

Heidi S Glaudel↗

CO2ROpt (Feedstock Allocation Optimization Model) [SWR-22-13]

Reducing greenhouse gas emissions remains a critical challenge for the transportation and chemical sectors. The electrochemical reduction of carbon dioxide is a potential pathway for production of fuels and chemicals that uses atmospheric carbon dioxide as a feedstock. Here we present an analysis of the potential for carbon dioxide captured from point sources and via direct air capture to be utilized in electrochemical reduction under different market scenarios. Using a numerical optimization framework and national data sets, scenarios for nationwide production of ethylene, formate, and carbon monoxide are evaluated at scales comparable to current production of these molecules in the United States. We show that developing a network for production of these products at scale requires capture and utilization of significant portions of the carbon dioxide that is currently emitted from large stationary point sources. Because carbon dioxide point sources are spatially and compositionally variable, their use for carbon dioxide reduction depends on electricity prices, capture cost, and location. If the power sector in the United States is decarbonized, carbon dioxide supply decreases significantly, increasing the importance of utilizing other carbon dioxide streams, and increasing the likelihood that direct air capture plays a role in supplying carbon dioxide feedstocks. These findings provide a first insight into the feedstock and energy constraints for carbon dioxide reduction.

Badgett, Alex↗

Coevolutionary Free Lunches

Recent work on the foundations of optimization has begun to uncover its underlying rich structure. In particular, the "No Free Lunch" (NFL) theorems [WM97] state that any two algorithms are equivalent when their performance is averaged across all possible problems. This highlights the need for exploiting problem-specific knowledge to achieve better than random performance. In this paper we present a general framework covering most search scenarios. In addition to the optimization scenarios addressed in the NFL results, this framework covers multi-armed bandit problems and evolution of multiple co-evolving agents. As a particular instance of the latter, it covers "self-play" problems. In these problems the agents work together to produce a champion, who then engages one or more antagonists in a subsequent multi-player game In contrast to the traditional optimization case where the NFL results hold, we show that in self-play there are free lunches: in coevolution some algorithms have better performance than other algorithms, averaged across all possible problems. However in the typical coevolutionary scenarios encountered in biology, where there is no champion, NFL still holds.

Wolpert, David H.↗