Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic systems”

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 595 records · Page 33

Charging-driven coarsening and melting of a colloidal nanoparticle monolayer at an ionic liquid–vacuum interface

In this work, we induce and investigate the coarsening and melting dynamics of an initially static nanoparticle colloidal monolayer at an ionic liquid–vacuum interface, driven by a focused, scanning electron beam. Coarsening occurs through grain interface migration and larger-scale motions such as grain rotations, often facilitated by sliding dislocations. The progressive decrease in area fraction that drives melting of the monolayer is explained using an electrowetting model whereby particles at the interface are solvated once their accumulating charge recruits sufficient counterions to subsume the particle. Subject to stochastic particle removal from the monolayer, melting is recapitulated in simulations with a Lennard-Jones potential. This new driving mechanism for colloidal systems, whose dynamical timescales we show can be controlled with the accelerating voltage, opens the possibility to manipulate particle interactions dynamically without need to vary particle intrinsic properties or surface treatments. Furthermore, the decrease in particle size availed by electron imaging presents opportunities to observe force and time scales in a lesser-explored regime intermediate between typical colloidal and molecular systems.

36 MATERIALS SCIENCE↗

An investigation of Newton-Sketch and subsampled Newton methods

Sketching, a dimensionality reduction technique, has received much attention in the statistics community. In this paper, we study sketching in the context of Newton's method for solving finite-sum optimization problems in which the number of variables and data points are both large. In this work, we study two forms of sketching that perform dimensionality reduction in data space: Hessian subsampling and randomized Hadamard transformations. Each has its own advantages, and their relative tradeoffs have not been investigated in the optimization literature. Additionally, our study focuses on practical versions of the two methods in which the resulting linear systems of equations are solved approximately, at every iteration, using an iterative solver. The advantages of using the conjugate gradient method vs. a stochastic gradient iteration are revealed through a set of numerical experiments, and a complexity analysis of the Hessian subsampling method is presented.

97 MATHEMATICS AND COMPUTING↗

Patchy nuclear chain reactions

Stochastic fluctuations of the neutron population within a nuclear reactor are typically prevented by operating the core at a sufficient power, since a deterministic (i.e., exactly predictable) behavior of the neutron population is required by automatic safety systems to detect unwanted power excursions. In order to characterize the reactor operating conditions at which the fluctuations vanish, an experiment was designed and took place in 2017 at the Rensselaer Polytechnic Institute Reactor Critical Facility. This experiment however revealed persisting fluctuations and striking patchy spatial patterns in neutron spatial distributions. Here we report these experimental findings, interpret them by a stochastic modeling based on branching random walks, and extend them using a “numerical twin” of the reactor core. Consequences on nuclear safety will be discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A meshless stochastic method for Poisson–Nernst–Planck equations

A plethora of biological, physical, and chemical phenomena involve transport of charged particles (ions). Its continuum-scale description relies on the Poisson–Nernst–Planck (PNP) system, which encapsulates the conservation of mass and charge. The numerical solution of these coupled partial differential equations is challenging and suffers from both the curse of dimensionality and difficulty in efficiently parallelizing. We present a novel particle-based framework to solve the full PNP system by simulating a drift–diffusion process with time- and space-varying drift. We leverage Green’s functions, kernel-independent fast multipole methods, and kernel density estimation to solve the PNP system in a meshless manner, capable of handling discontinuous initial states. The method is embarrassingly parallel, and the computational cost scales linearly with the number of particles and dimension. We use a series of numerical experiments to demonstrate both the method’s convergence with respect to the number of particles and computational cost vis-à-vis a traditional partial differential equation solver.

Chemistry↗

Modeling frequency instability in high-quality resonant experiments

Modern resonant sensing tools can achieve increasingly high quality factors, which correspond to extremely narrow linewidths. In such systems, time variation of the resonator’s natural frequency can potentially impact its ability to accumulate power and its resulting sensitivity. One such example is the Dark SRF experiment, which utilizes superconducting radio frequency (SRF) cavities with quality factors of Q ∼ 10 10 . Microscopic deformations of the cavity lead to stochastic jittering of its resonant frequency with amplitude 20 times its linewidth. Naively, one may expect this to lead to a large suppression in accumulated power. In this work, we study in detail the effects of frequency instability on high-quality resonant systems, utilizing the Dark SRF experiment as a case study. We show that the timescale of jittering is crucial to determining its effect on power accumulation. Namely, when the resonant frequency varies sufficiently quickly, the system accumulates power as if there were no jittering at all. This implies that the sensitivity of a jittering resonator is comparable to that of a stable resonator. In the case of Dark SRF, we find that jittering only induces a ∼ 10 % loss in power. Our results allow the dark-photon exclusion bound from Dark SRF’s pathfinder run to be refined, leading to a constraint that is an order of magnitude stronger than previously reported (corresponding to a signal-to-noise ratio that is four orders of magnitude larger). This result represents the world-leading constraint on dark photons over a wide range of masses below 6 μ eV and translates to the best laboratory-based limits on the photon mass m γ < 2.9 × 10 - 48 g .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty

The overall objective for this project was to develop and demonstrate a set of methods for solving the transmission investment problem for a large network considering many possible scenarios of future conditions and multiple decision points when investments can be made. Project sub-objectives achieved this goal through a succession of extending the methods to apply to problems with increasing complexity or additional features, including the number of decision points, whether generation and transmission are co-optimized, and whether AC or DC power flow is used. A transmission model was developed for the Western Electric Coordinating Council (WECC) region, the high-voltage transmission system that serves the western third of the continental U.S. Using a dataset provided by WECC and by researchers from John Hopkins University, we have validated and demonstrated the model and used it to compare the new method for solving multi-stage stochastic transmission planning to several state-of-the-art techniques. The project has resulted in several key outcomes and achievements: The covariance-based method for choosing a small set of hours to represent short-term variability has superior performance in terms of accuracy to existing methods, including K-means clustering and Importance Sampling; The combined partitioning method for long-term uncertainty with the nested clustering approach for choosing representative hours for each long-term group has superior accuracy for equivalent computational effort compared with existing methods; Using the partitioning/clustering method combined with Sample Average Approximation provides both statistical bounds on the quality of the solution and at the same time, a complete investment plan for all contingencies in the full uncertainty set; no existing methods can provide both at the same time; The method is demonstrated to work well for choosing both transmission and generation investments; A variant on the method allows for both scenario selection and simultaneous correction for the error from the DC power flow approximation to provide a tractable method for AC power flow-based transmission planning under uncertainty; The method applied to the WECC case study demonstrates the additional value to the system operator and the consumer of identifying flexible investment options in the near-term decisions. In particular, the case study exhibits significant option value in postponing some transmission additions that appear useful but in some long-term system states create new congestion problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Uncertainty Quantification for Multiphase Computational Fluid Dynamics Closure Relations with a Physics-Informed Bayesian Approach

Multiphase Computational Fluid Dynamics (MCFD) based on the two-fluid model is considered a promising tool to model complex two-phase flow systems. MCFD simulation can predict local flow features without resolving interfacial information. As a result, the MCFD solver relies on closure relations to describe the interaction between the two phases. Those empirical or semi-mechanistic closure relations constitute a major source of uncertainty for MCFD predictions. In this paper, we leverage a physics-informed uncertainty quantification (UQ) approach to inversely quantify the closure relations’ model form uncertainty in a physically consistent manner. This proposed approach considers the model form uncertainty terms as stochastic fields that are additive to the closure relation outputs. Combining dimensionality reduction and Gaussian processes, the posterior distribution of the stochastic fields can be effectively quantified within the Bayesian framework with the support of experimental measurements. As this UQ approach is fully integrated into the MCFD solving process, the physical constraints of the system can be naturally preserved in the UQ results. Here, in a case study of adiabatic bubbly flow, we demonstrate that this UQ approach can quantify the model form uncertainty of the MCFD interfacial force closure relations, thus effectively improving the simulation results with relatively sparse data support.

42 ENGINEERING↗

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Particle Swarm Optimisation for group structure optimization for radiotherapy shielding

Neutron transport simulations are ubiquitous in nuclear engineering because they allow one to model experimental systems and render a model platform for easy perturbation of experimental designs. In addition, simulations allow one to gain experimental insight without actually having to go through the trouble of building a physical experiment. Neutron transport simulations can be stochastic or deterministic based. Stochastic neutron transport simulations are typically simulated using the Monte Carlo method and yield very accurate solutions but are computationally expensive, while deterministic methods are typically faster but can be less accurate. Here we focus on optimizing the accuracy of deterministic neutron transport simulations for radiotherapy simulations. Deterministic neutron transport requires discretization of angle, energy, and space to appropriately analyze the system one is trying to model. Discretization of energy is challenging because of the highly variable neutron flux at certain neutron energies. Improper discretization of energy in the transport model can lead to erroneous results and therefore inaccurate interpretations of the solution. In this study, we evaluate Particle Swarm Optimization (PSO) as a mechanism for selecting optimal group structures for radiotherapy shielding. We tested the particle swarm optimization algorithm on radiotherapy shielding problems using Los Alamos National Laboratory's (LANL) main deterministic transport code PARTISN. Results show that the optimized energy group structures generated from the optimization algorithm outperformed LANL's standard energy group structures, and therefore demonstrate utility in using PSO to expedite computation times due to the increased accuracy obtained with a smaller but optimized group structure. (authors)

43 PARTICLE ACCELERATORS↗

Patchy snapshots of nuclear chain reactions

Stochastic fluctuations of the neutron population within a nuclear reactor are typically prevented by operating the core at a sufficiently high power. This regime, where the evolution of the neutron density is essentially deterministic, is key for automatic protection and safety systems to safely detect unwanted power excursions during an accident, and to rapidly initiate a reactor trip procedure in case it is needed. Recent works, supported by numerical simulations, have however reported that, for large reactors, the branching nature of the fission reactions might induce strongly non-Poissonian patterns in the neutron spatial distribution, and that stochastic fluctuations might still persist at reactor powers close to operating conditions (startup phase). An international program conducted by LANL, IRSN and CEA was therefore setup to experimentally detect and characterize such fluctuations and correlations. An experiment took place in 2017 at the Reactor Critical Facility (RCF) of the Rensselaer Polytechnic Institute (USA). In this paper we will report the main findings of this experimental program, supported by stochastic models and by the development of a dedicated high-fidelity Monte Carlo simulation code. We will in particular describe and explain the strong patchiness in neutron power distributions measured at the RCF, as well as a peculiar ‘blinking’ behavior of the core, and discuss the consequences of these findings on nuclear safety.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An agent-based blackboard system for multi-objective optimization

In the field of multi-objective optimization, there are a multitude of algorithms from which to choose. Each algorithm has strengths and weaknesses associated with the mechanics for finding the Pareto front. Recently, researchers have begun to examine how multi-agent environments can be used to help solve multi-objective optimization problems. In this work, we propose a multi-objective optimization algorithm based on a multi-agent blackboard system (MABS). The MABS framework allows for multiple agents to read and write pertinent optimization problem data to a central blackboard agent. Agents can stochastically search the design space, use previously discovered solutions to explore local optima, or update and prune the Pareto front. A centralized blackboard framework allows the optimization problem to be solved in a cohesive manner and permits stopping, restarting, or updating the optimization problem. The MABS framework is tested against three alternative optimization algorithms across a suite of engineering design problems and typically outperforms the other algorithms in discovering the Pareto front. A parallelizability study is performed where we find that the MABS is able to evaluate a set number of designs, which require an evaluation time ranging from 0 to 300 seconds, quicker than a traditional optimization algorithm: this fact becomes more apparent the longer it takes to evaluate a design. To provide context for the benefits provided by MABS, a real-world nuclear engineering design problem is examined. MABS is used to examine the placement of experiments in a nuclear reactor, where we are able to evaluate hundreds of configurations for experimental placement while maintaining a strict set of safety constraints.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Deterministic Quantum Trajectory via Imaginary Time Evolution

Stochastic quantum trajectories, such as pure state evolutions under unitary dynamics and random measurements, offer a crucial ensemble description of many-body open system dynamics. Recent studies have highlighted that individual quantum trajectories also encode essential physical information. Prominent examples include measurement-induced phase transitions, where a pure quantum state corresponding to fixed measurement outcomes (trajectories) exhibits distinct entanglement phases, depending on the measurement rate. However, direct observation of this effect is hindered by an exponential postselection barrier, whereby the probability of realizing a specific trajectory is exponentially small. We propose a deterministic method to efficiently prepare quantum trajectories in polynomial time using imaginary time evolution and, thus, overcome this fundamental challenge. Here, we demonstrate that our method applies to a certain class of quantum states, and argue that universal approaches do not exist for any quantum trajectories. Our result paves the way for experimentally exploring the physics of individual quantum trajectories at scale and enables direct observation of certain postselection-dependent phenomena.

Mittal, Shivan [Los Alamos National Laboratory (LA↗

Structured interactions drive abrupt transitions in the spatial organization of microbial communities

Bacteria possess diverse mechanisms to regulate their motility in response to environmental and physiological signals, enabling them to navigate complex habitats and adapt their behavior. Some of these mechanisms are species specific and enable cells to modulate their movement based on the ecological identity of neighboring species. Here, we introduce a model in which bacteria interact via local signals that either enhance or suppress the motility of neighboring cells depending on species type. Through large-scale simulations and a coarse-grained stochastic model, we demonstrate the emergence of a sharp transition driven by nucleation processes: increasing the density of motility-suppressing interactions drives the system from a fully mixed, motile phase to a state characterized by large, stationary bacterial clusters. Remarkably, in systems with a large number of interacting species, this transition can be triggered solely by altering the structure of the motility-regulation interaction matrix while maintaining species and interaction densities constant. In particular, we find that heterogeneous and modular interactions promote the transition more readily than homogeneous random ones. These findings add a dimension to the theory of motility-induced phase separation and contribute to the ongoing effort to understand microbial interactions, suggesting that structured, nonrandom ones may be key to reproducing commonly observed spatial patterns in microbial communities.

bacterial communities↗

Network Reconfiguration for Enhanced Operational Resilience Using Reinforcement Learning

This paper proposes a reinforcement learning-based approach for distribution network reconfiguration(DNR) to enhance the resilience of the electric power supply. Resilience enhancements usually require solving large-scale stochastic optimization problems that are computationally expensive and sometimes infeasible. The exceptional performance of reinforcement learning techniques has encouraged their adoption in various power system control studies, specifically resilience-based real-time applications. In this paper, a single agent framework is developed using an Actor-Critic algorithm (ACA) to determine statuses of tie-switches in a distribution feeder impacted by an extreme weather event. The proposed approach provides a fast-acting control algorithm that reconfigures the feeder topology to reduce or even avoid load shedding. The problem is formulated as a discrete Markov decision process in such a way that a system state captures the system topology and its operational characteristics. An action is made to open or close a specific set of tie-switches after which a reward is calculated to evaluate the practicality and advantage of that action. The iterative Markov process is used to train the proposed ACA under diverse failure scenarios and is demonstrated on the 33-node distribution feeder system. Results show the capability of the proposed ACA to determine proper switching action of tie-switches with accuracy exceeding 93%.

actor critic↗

Optimization with Neural Network Feasibility Surrogates: Formulations and Application to Security-Constrained Optimal Power Flow

In many areas of constrained optimization, representing all possible constraints that give rise to an accurate feasible region can be difficult and computationally prohibitive for online use. Satisfying feasibility constraints becomes more challenging in high-dimensional, non-convex regimes which are common in engineering applications. A prominent example that is explored in the manuscript is the security-constrained optimal power flow (SCOPF) problem, which minimizes power generation costs, while enforcing system feasibility under contingency failures in the transmission network. In its full form, this problem has been modeled as a nonlinear two-stage stochastic programming problem. In this work, we propose a hybrid structure that incorporates and takes advantage of both a high-fidelity physical model and fast machine learning surrogates. Neural network (NN) models have been shown to classify highly non-linear functions and can be trained offline but require large training sets. In this work, we present how model-guided sampling can efficiently create datasets that are highly informative to a NN classifier for non-convex functions. We show how the resultant NN surrogates can be integrated into a non-linear program as smooth, continuous functions to simultaneously optimize the objective function and enforce feasibility using existing non-linear solvers. Overall, this allows us to optimize instances of the SCOPF problem with an order of magnitude CPU improvement over existing methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Simulating Impacts of Extreme Events on Grids with High Penetrations of Wind Power Resources

As extreme weather events become more frequent and intense, the demand for connecting grid operation and infrastructure planning with extreme event models will increase as well. We present a methodology for creating damage contingencies and scenarios for electric transmission grids during a hurricane strike. Included is an example case study: Hurricane Dolly damaging a synthetic 2000 bus test system during its landing in Southern Texas. Using WIND Toolkit meteorological data in conjunction with fragility curves for various electric grid elements, we generate stochastic damage scenarios that can be used for short- and long-term planning problems including emergency asset management. We perform statistical analysis of damages and quantify topological effects on example synthetic grid. Also, we investigate loss-of-load events during two-day economic dispatch experiment. Finally, we point out various shortcomings of our method and suggest how it can be improved.

data-driven forecasting↗

Simulating Impacts of Extreme Events on Grids with High Penetrations of Wind Power Resources: Preprint

As extreme weather events become more frequent and intense, the demand for connecting grid operation and infrastructure planning with extreme event models will increase as well. We present a methodology for creating damage contingencies and scenarios for electric transmission grids during a hurricane strike. Included is an example case study: Hurricane Dolly damaging a synthetic 2000 bus test system during its landing in Southern Texas. Using WIND Toolkit meteorological data in conjunction with fragility curves for various electric grid elements, we generate stochastic damage scenarios that can be used for short- and long-term planning problems including emergency asset management. We perform statistical analysis of damages and quantify topological effects on example synthetic grid. Also, we investigate loss-of-load events during two-day economic dispatch experiment. Finally, we point out various shortcomings of our method and suggest how it can be improved.

contingencies↗