Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochasticity”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Bayesian filtering for model predictive control of stochastic gene expression in single cells

This study describes a method for controlling the production of protein in individual cells using stochastic models of gene expression. By combining modern microscopy platforms with optogenetic gene expression, experimentalists are able to accurately apply light to individual cells, which can induce protein production. Here we use a finite state projection based stochastic model of gene expression, along with Bayesian state estimation to control protein copy numbers within individual cells. We compare this method to previous methods that use population based approaches. We also demonstrate the ability of this control strategy to ameliorate discrepancies between the predictions of a deterministic model and stochastic switching system.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Demand Response Under Stochastic, Price-Dependent User Behavior

This letter focuses on price-based demand response (DR) implemented through dynamic adjustments of electricity prices. It extends existing DR models to a stochastic framework in which customer response is represented by price-dependent random variables, leveraging models and tools from the theory of stochastic optimization with decision-dependent distributions. The inherent epistemic uncertainty in the customers' responses renders open-loop, model-based DR strategies impractical. We propose a stochastic, feedback-based pricing strategy to compensate for estimation errors and uncertainty in customer response, establish theoretical results demonstrating the stability and near-optimality of the proposed approach, and validate its effectiveness through numerical simulations.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Will Stochastic Devices Play Nice With Others in Neuromorphic Hardware?: There’s More to a Probabilistic System Than Noisy Devices

Achieving brain-like efficiency in computing requires a co-design between the development of neural algorithms, brain-inspired circuit design, and careful consideration of how to use emerging devices. The recognition that leveraging device-level noise as a source of controlled stochasticity represents an exciting prospect of achieving brain-like capabilities in probabilistic neural algorithms, but the reality of integrating stochastic devices with deterministic devices in an already-challenging neuromorphic circuit design process is formidable. Here, we explore how the brain combines different signaling modalities into its neural circuits as well as consider the implications of more tightly integrated stochastic, analog, and digital circuits. Further, by acknowledging that a fully CMOS implementation is the appropriate baseline, we conclude that if mixing modalities is going to be successful for neuromorphic computing, it will be critical that device choices consider strengths and limitations at the overall circuit level.

42 ENGINEERING↗
DOE OSTI2020

Scenario Creation and Power-Conditioning Strategies for Operating Power Grids with Two-Stage Stochastic Economic Dispatch

A significant difficulty associated with the use of stochastic programming to solve optimal power flow problems on a 5-minute timescale is the quality of renewable energy scenarios input by the user. This is especially true when considering power systems with high penetrations of renewable energy, e.g. wind power. This paper introduces the use of stochastic programming to solve the DC optimal power flow problem with scenarios drawn directly from high-fidelity data sets. Hence, the proposed method avoids the problem of lost physics by finding high-fidelity analogs that can describe future states of the system. Furthermore, this method can be simply extended to output multi-period scenarios to the stochastic program. We demonstrate the effectiveness of this technique by simulating dispatch operations on a synthetic test system over the course of a week.

94 GMLC - Grid Modernization Laboratory Consortium↗
DOE OSTI2025

Stochastic Model Predictive Control With Gaussian Wind Direction Preview for Wake Steering

This article addresses the problem of wake steering control for wind farms that explicitly consider the tradeoff between farm-level power generation and yaw duty cycle under variable and uncertain wind conditions. A novel stochastic model predictive control (MPC) algorithm is presented, which utilizes a stochastic model of the freestream wind field components in a receding horizon framework to compute optimal yaw set points that maximize the expected value of the farm power while constraining the yaw actuation. Different configurations of the algorithm are evaluated using a steady-state wind farm simulator. The proposed stochastic MPC algorithm can plan control actions over a future prediction horizon based on probabilistic estimates of the incoming wind magnitude and direction.

17 WIND ENERGY↗
DOE OSTI2021

Observability Analysis of a Power System Stochastic Dynamic Model Using a Derivative-Free Approach

Serving as a prerequisite to power system dynamic state estimation, the observability analysis of a power system dynamic model has recently attracted the attention of many power engineers. However, because this model is typically nonlinear and large-scale, the analysis of its observability is a challenge to the traditional derivative-based methods. Indeed, the linear-approximation-based approach may provide unreliable results while the nonlinear-technique-based approach inevitably faces extremely complicated derivations. Furthermore, because power systems are intrinsically stochastic, the traditional deterministic approaches may lead to inaccurate observability analyses. In this work, facing these challenges, we propose a novel polynomial-chaos-based derivative-free observability analysis approach that not only is free of any linear approximations, but also accounts for the stochasticity of the dynamic model while bringing a low implementation complexity. Furthermore, this approach enables us to quantify the degree of observability of a stochastic model, what conventional deterministic methods cannot do. The excellent performance of the proposed method has been demonstrated by performing extensive simulations using a synchronous generator model with IEEE-DC1A exciter and the TGOV1 turbine governor.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Stochastic Learning Approach for Binary Optimization: Application to Bayesian Optimal Design of Experiments

Here, we present a novel stochastic approach to binary optimization suited for optimal experimental design (OED) for Bayesian inverse problems governed by mathematical models such as partial differential equations. The OED utility function, namely, the regularized optimality criterion, is cast into a stochastic objective function in the form of an expectation over a multivariate Bernoulli distribution. The probabilistic objective is then solved by using a stochastic optimization routine to find an optimal observational policy. This formulation (a) is generally applicable to binary optimization problems with soft constraints and is ideal for OED and sensor placement problems; (b) does not require differentiability of the original objective function (e.g., a utility function in OED applications) with respect to the design variable, and thus it enables direct employment of sparsity-enforcing penalty functions such as $\ell_0$, without needing to utilize a continuation procedure or apply a rounding technique; (c) exhibits much lower computational cost than traditional gradient-based relaxation approaches; and (d) can be applied to both linear and nonlinear OED problems with proper choice of the utility function. The proposed approach is analyzed from an optimization perspective with detailed convergence analysis of the optimization approach and is also analyzed from a machine learning perspective with correspondence to policy gradient reinforcement learning. The approach is demonstrated numerically by using an idealized two-dimensional Bayesian linear inverse problem and validated by extensive numerical experiments carried out for sensor placement in a parameter identification setup.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Stochastic Continuous-time Flexibility Scheduling and Pricing in Wholesale Electricity Markets

Large-scale integration of intermittent renewable energy sources (RES) is calling for additional flexibility resources as well as more advanced modeling and optimization techniques to account for the increasing uncertainty and variability in power systems operation. As the RES integration gains momentum, the magnitude and frequency of their variations increase, which may trigger ramping scarcity events in real-time power systems operation. This necessitates revisiting the present definition of power systems flexibility and reserve services to reflect their robustness and adequacy towards sub-interval variations of the load and RES, as well as adjusting the operation models to accommodate the new reserve services. This project took a fundamental approach and aimed at developing continuous-time scheduling and pricing model that accurately models the continuous-time variations of load and RES and efficiently deploys the ramping capability of flexible resources to compensate the sources of variability and uncertainty in the market. In this regard, this project pursued the following goals: Developing stochastic multi-fidelity continuous-time optimization models for scheduling of energy storage (ES) systems and flexible loads in wholesale energy markets; Developing the theory and practices of continuous-time locational marginal pricing for valuating energy storage systems and flexible loads in wholesale energy markets; Developing function space solution approach to convert the proposed stochastic multi-fidelity continuous-time optimization models into tractable mixed-integer linear optimization models; and Defining flexibility reserve as a new type of reserve in markets that would enable ultimate participation of energy storage devices in provision of services to compensate the variability and uncertainty of RES in electricity markets. This project successfully completed all five major tasks defined in the SOPO, and produced 8 high-impact journal papers, 6 conference papers, 3 published U.S. patents, and one web-based software for continuous-time operation optimization of power systems. The application of the proposed flexibility reserve and the stochastic multi-fidelity continuous-time operation scheduling models would modify the forward commitment and schedule of generating units, ES devices and flexible loads, and would line up the resources in such a way that the composition of available resources is better prepared to respond to the sub-hourly variations of the load and renewable resources in real-time operation. Therefore, this project paves the way to sustainable, reliable, and economic integration of renewable energy resources in power system, supporting the progress towards reaching the national targets on energy independence. Even if the proposed models offers a radically different point of view as compared to existing models, it does not alter fundamentally the architecture of power systems operations, nor the complexity of the scheduling problem, so the integration of this project in power systems is extremely practical.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Statistical Learning for Nonlinear Model Reduction from Local Simulations of Stochastic and Particle- and Agent-Based Systems

Stochastic physical systems across the sciences that have very high-dimensional state spaces, with a large number of fast degrees of freedom that force direct simulators to proceed by integration steps that are orders of magnitude smaller than events of interests (e.g., particle collisions). Examples range from molecular motion to dynamics of large populations of cells. A grand challenge in the simulation and understanding of such systems is the systematic construction of accurate, interpretable, reduced models, enabling faster simulations, revealing fundamental properties of the dynamics, and predicting phenomena of interest that the original simulator could not reached with sufficient accuracy or within a given computational budget. In this projected we developed novel statistical estimation/machine learning techniques for analyzing and building empirical reduced models for important families of high-dimensional stochastic systems, in particular: - we developed techniques for estimating interaction kernels in interacting particle- and agent-based systems, which are ubiquitous in Physics, Biology and many other sciences, given observed trajectories of the system; - we developed techniques for nonlinear model reduction for high-dimensional stochastic systems that have a small number of unknown, nonlinear slow variables, and a large number of fast modes, that are possibly of large magnitude, given observed short trajectories of the system in the form of bursts of trajectories from different initial conditions; - we developed novel techniques for estimating linear dynamical systems on graphs when both the dynamics and the underlying graph are unknown, and we have a sparse set of space-time observations; - we considered the problem of estimating an unknown nonlinear observation function of a standard process (e.g. Brownian motion), so that we can recognized if an observed dynamics is "just" a nonlinear version of a known dynamics; we also developed benchmarks for learning algorithms aimed at learning and classifying diffusion processes.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Discrete Deterministic and Stochastic Petri Nets

Petri nets augmented with timing specifications gained a wide acceptance in the area of performance and reliability evaluation of complex systems exhibiting concurrency, synchronization, and conflicts. The state space of time-extended Petri nets is mapped onto its basic underlying stochastic process, which can be shown to be Markovian under the assumption of exponentially distributed firing times. The integration of exponentially and non-exponentially distributed timing is still one of the major problems for the analysis and was first attacked for continuous time Petri nets at the cost of structural or analytical restrictions. We propose a discrete deterministic and stochastic Petri net (DDSPN) formalism with no imposed structural or analytical restrictions where transitions can fire either in zero time or according to arbitrary firing times that can be represented as the time to absorption in a finite absorbing discrete time Markov chain (DTMC). Exponentially distributed firing times are then approximated arbitrarily well by geometric distributions. Deterministic firing times are a special case of the geometric distribution. The underlying stochastic process of a DDSPN is then also a DTMC, from which the transient and stationary solution can be obtained by standard techniques. A comprehensive algorithm and some state space reduction techniques for the analysis of DDSPNs are presented comprising the automatic detection of conflicts and confusions, which removes a major obstacle for the analysis of discrete time models.

MATHEMATICAL MODELS↗
NASA NTRS2019

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

stochastic calculus↗
DOE OSTI2020

STOCHASTIC OPTIMIZATION FOR LONG TERM CAPITAL STRUCTURES, SYSTEMS, AND COMPONENTS REFURBISHMENT AND REPLACEMENT

As commercial nuclear power plants (NPPs) pursue extended plant operations in the form of Second License Renewals (SLRs), opportunities exist for these plants to provide capital investments to ensure long-term, safe, and economic performance. Several utilities have already announced their intention to pursue extended operations for one or more of their NPPs via SLR2. The goal of this research is to develop a riskinformed approach to evaluate and prioritize plant capital investments made in preparation for, and during the period of, extended plant operations to support decisions in NPP operations. In order to prioritize project selection via a riskinformed approach we developed a single decision-making tool that integrates safety/reliability, cost, and stochastic optimization models to provide users with data analysis capabilities to more cost effectively manage plant assets. Both stochastic analysis methods—such as Monte Carlo-based sampling strategies—and multi-stage stochastic optimization strategies are employed to provide priority lists to decisionmakers in support of risk-informed decisions. We applied the proposed method to a trial application of projected replacement/refurbishment expenditures for plant capital assets (i.e., Structures, Systems, and Components [SSCs]). The objective is to optimize the SSC replacement/refurbishment schedule in terms of economic constraints, data uncertainties, and SSC reliability data, as well to generate a priority list for maximizing returns on investment.

42 ENGINEERING↗
DOE OSTI2020

Scenario Creation and Power-Conditioning Strategies for Operating Power Grids with Two-Stage Stochastic Economic Dispatch: Preprint

A significant difficultly associated with the use of stochastic programming to solve optimal power flow problems on a 5-minute timescale is the quality of renewable energy scenarios input by the user. This is especially true when considering power systems with high penetrations of renewable energy, e.g. wind power. This paper introduces the use of stochastic programming to solve the DCOPF problem with scenarios drawn directly from high-fidelity data sets. Hence, the proposed method avoids the problem of lost physics by finding high-fidelity analogs that can describe future states of the system. Furthermore, this method can be simply extended to output multi-period scenarios to the stochastic program. We demonstrate the effectiveness of this technique on simulated dispatch operations of the RTS-GMLC over a week.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Observation of spatter-induced stochastic lack-of-fusion in laser powder bed fusion using in situ process monitoring

Material produced via additive manufacturing (AM) continues to exhibit variable mechanical properties despite apparent optimization of processing parameters, inhibiting qualification efforts and limiting use in critical applications. Stochastic lack-of-fusion flaws may help explain this variability, but the origin of these seemingly random defects has to this point remained unclear. In this work, we show that spatter particles, material ejected from the laser melt pool, are directly responsible for generating stochastic lack-of-fusion in laser-based powder bed fusion components through the application of spatial statistics. Herein a statistically significant, causal relationship between spatter particles and stochastic lack-of-fusion is established, and the spatial and morphological relationships between spatter and internal flaws are investigated. The occurrence of spatter-induced lack-of-fusion in relation to the inert gas flow and laser trajectory direction is also investigated, and recommendations for mitigating the occurrence of spatter are evaluated.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Risk-Averse Bi-Level Stochastic Network Interdiction Model for Cyber-Security Risk Management

Security of cyber networks is crucial; recent severe cyber-attacks have had a devastating effect on many large organizations. The attack graph, which maps the potential attack paths of a cyber network, is a popular tool for analyzing cyber system vulnerability. In this study, we propose a bi-level stochastic network interdiction model on an attack graph to enable a risk-averse, resource constrained cyber network defender to optimally deploy security countermeasures that protect against attackers with an uncertain budget. This risk- averse conditional-value-at-risk (CVaR) model minimizes a weighted sum of the expected maximum loss over all scenarios and the expected maximum loss from the most damaging attack scenarios. We develop a customized constraint and column generation algorithm to solve our model as well as several acceleration techniques to improve the computational efficiency. Numerical experiments demonstrate that the acceleration techniques enable the solution of relatively large problems within a reasonable amount of time: applying all the acceleration techniques also reduces the average computation time of the basic algorithm by 71% for 100-node graphs. Using metrics called mean-risk value of stochastic solution and value of risk-aversion, computational results suggest that our stochastic risk-averse model significantly outperforms deterministic and risk-neutral models when 1) the distribution of attacker budget is heavy-right-tailed and 2) the defender is highly risk-averse.

Bhuiyan, Tanveer H.↗
DOE OSTI2024

SDYN-GANs: Adversarial learning methods for multistep generative models for general order stochastic dynamics

We introduce adversarial learning methods for data-driven generative modeling of dynamics of nth-order stochastic systems. Our approach builds on Generative Adversarial Networks (GANs) with generative model classes based on stable m-step stochastic numerical integrators. From observations of trajectory samples, we introduce methods for learning long-time predictors and stable representations of the dynamics. Our approaches use discriminators based on Maximum Mean Discrepancy (MMD), training protocols using both conditional and marginal distributions, and methods for learning dynamic responses over different time-scales. We show how our approaches can be used for modeling physical systems to learn force-laws, damping coefficients, and noise-related parameters. Our adversarial learning approaches provide methods for obtaining stable generative models for dynamic tasks including long-time prediction and developing simulations for stochastic systems.

• Artificial intelligence (AI) / machine learning ↗
DOE OSTI2020

Probabilistic evolution of stochastic dynamical systems: A meso-scale perspective

Stochastic dynamical systems arise naturally across nearly all areas of science and engineering. Typically, a dynamical system model is based on some prior knowledge about the underlying dynamics of interest in which probabilistic features are used to quantify and propagate uncertainties associated with the initial conditions, external excitations, etc. From a probabilistic modeling standing point, two broad classes of methods exist, i.e. macro-scale methods and micro-scale methods. Classically, macro-scale methods such as statistical moments-based strategies are usually too coarse to capture the multi-mode shape or tails of a non-Gaussian distribution. Micro-scale methods such as random samples-based approaches, on the other hand, become computationally very challenging in dealing with high-dimensional stochastic systems. In view of these potential limitations, a meso-scale scheme is proposed here that utilizes a meso-scale statistical structure to describe the dynamical evolution from a probabilistic perspective. The significance of this statistical structure is twofold. First, it can be tailored to any arbitrary random space. Second, it not only maintains the probability evolution around sample trajectories but also requires fewer meso-scale components than the micro-scale samples. To demonstrate the efficacy of the proposed meso-scale scheme, a set of examples of increasing complexity are provided. Connections to the benchmark stochastic models as conservative and Markov models along with practical implementation guidelines are presented.

97 MATHEMATICS AND COMPUTING↗