An effective hybrid decomposition approach to solve the network-constrained stochastic unit commitment problem in large-scale power systems
Not Available
SEARCH · Engineering Papers
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.
Not Available
Not Available
Abstract not provided.
Abstract not provided.
We describe the application of a sweeping gradient method for ordinary differential equations with events (SGM) and linear covariance analysis (LinCov) to the co-optimization of navigation system requirement generation and robust trajectory design. SGM is a method for computing the gradient of trajectory analyses defined by performance indices over initial value problems with events with respect to static parameters. LinCov is an analytic technique for predicting stochastic behavior of dynamical systems. By combining SGM and LinCov, it is possible use efficient, off-the-shelf, gradient-based optimizers to solve a combined robust optimal trajectory and navigation system design problem. In this paper, we formulate the required models to apply the combined SGM and LinCov techniques to a Near-Rectilinear Halo Orbit rendezvous approach scenario and show results for several intermediate problems.
The explosive growth in data collection and the need to process it efficiently, as well as the desire to automate increasingly complex tasks in transportation, medical care, manufacturing, security and many other fields have motivated a growing interest in neuromorphic computing. Unlike the binary, transistorbased ON/OFF logic gates and separate logic and memory functionalities employed in digital computing, neuromorphic computing is inspired by animal brains that use interconnected synapses and neurons to perform processing, storage and transmission of information at the same location, while only consuming ~20 W or less of power. Motivated by the brain’s efficiency, adaptability, self-learning and resiliency qualities, neuromorphic computing can be broadly defined as an approach to processing and storing information using hardware and algorithms inspired by models of biological neural systems. Present research in neuromorphic computing encompasses approaches that vary significantly in their degree of neuro-inspiration, from systems that only incorporate features such as asynchronous, event-driven operation or use crossbar arrays of non-volatile memory (NVM) elements to accelerate deep neural networks (DNNs), to designs that embrace the extreme parallelism, sparsity, reconfigurability, adaptability, complexity and stochasticity observed in nervous systems. The term ‘neuromorphic’ computing is often credited to Carver Mead, who in the 1980s investigated Si-based analog electronics to replicate functions of the animal retina. Earlier important advances in this field include the work of Frank Rosenblatt, who proposed the concept of the perceptron, Bernard Widrow, who used this concept to build one of the first analog neural networks, the Adaline and many other researchers (see ref. 6 for an historical perspective on neuromorphic computing). With the recent increase in the use of artificial intelligence and large language models, and rising concerns over the associated energy costs, interest in neuromorphic hardware has expanded rapidly. According to some estimates, driven largely by the drastic growth in the training use of artificial intelligence (AI) models using the current computing architectures, the energy cost of computing is projected to reach the energy supply worldwide by 2045. Furthermore, while this is not a realistic outcome, it means that, if more efficient computing technologies are not developed -- soon -- the world will soon become one where demand for energy and market constraints limit the continued increase of societal access to AI and cloud services from data centers. Data centers used for training and use of these models consume hundreds of terawatt hours of electricity, already past 4% of the US electricity demand.
Sensors are one of the fundamental components for sensor-rich controls in buildings but are prone to different errors. Existing studies show that sensor errors hold a place among top-priority faults in building systems. Before we take countermeasures to mitigate the sensor errors, it is vital to prioritize key sensors and quantify the collective impacts of concurrent sensor errors. In response to this, a simulation-based methodology is introduced to conduct a comprehensive sensor error impact analysis in building systems, which adds a stochastic sensor prioritization through a sensitivity analysis on top of a commonly used deterministic sensor error quantification. The synergies of these two parts help better interpret the sensor error impacts on building energy consumption, ventilation performance, thermal comfort, etc. A sensor-rich CO2-based Demand-Controlled Ventilation system is used as a case study to demonstrate the viability of the methodology as a proof-of-the-concept. The results show that the energy savings potential and ventilation performance are mostly influenced by the accuracy of the AHU outdoor airflow sensors. The accuracy of zone level airflow sensors has a negligible impact on both energy savings and ventilation performance. The accuracy of zone CO2 sensors has more influence on the ventilation performance compared with the accuracy of zone airflow sensors. Compared with the baseline case with zero errors, the largest deviation percentages could reach 16.90% and 94.32%, respectively, in terms of the Heating, Ventilation, and Air-Conditioning (HVAC) annual energy consumption and the Outdoor Air Ratio (OAR) when multiple key sensors suffer from normal error intensities simultaneously.
Optimal mitigation planning for highly disruptive contingencies to a transmission-level power system requires optimization with dynamic power system constraints, due to the key role of dynamics in system stability to major perturbations. We formulate a generalized disjunctive program to determine optimal grid component hardening choices for protecting against major failures, with differential algebraic constraints representing system dynamics (specifically, differential equations representing generator and load behavior and algebraic equations representing instantaneous power balance over the transmission system). We optionally allow stochastic optimal pre-positioning across all considered failure scenarios, and optimal emergency control within each scenario. This novel formulation allows, for the first time, analyzing the resilience interdependencies of mitigation planning, preventive control, and emergency control. Using all three strategies in concert is particularly effective at maintaining robust power system operation under severe contingencies, as we demonstrate on the Western System Coordinating Council (WSCC) 9-bus test system using synthetic multi-device outage scenarios. Towards integrating our modeling framework with real threats and more realistic power systems, we explore applying hybrid dynamics to power systems. Our work is applied to basic RL circuits with the ultimate goal of using the methodology to model protective tripping schemes in the grid. Finally, we survey mitigation techniques for HEMP threats and describe a GIS application developed to create threat scenarios in a grid with geographic detail.
A novel extension of the Probabilistic Learning on Manifolds (PLoM) is presented. It makes it possible to synthesize solutions to a wide range of nonlinear stochastic boundary value problems described by partial differential equations (PDEs) for which a stochastic computational model (SCM) is available and which depend on a vector-valued random control parameter. The cost of a single numerical evaluation of this SCM is assumed to be such that only a limited number of points can be computed for constructing the training dataset (small data). Each point of the training dataset is made up of realizations from a vector-valued stochastic process (the stochastic solution) and the associated random control parameter on which it depends. The presented PLoM constrained by PDE allows for generating a large number of learned realizations of the stochastic process and its corresponding random control parameter. These learned realizations are generated so as to minimize the vector-valued random residual of the PDE in the mean-square sense. Appropriate novel methods are developed to solve this challenging problem. Three applications are presented. The first one is a simple uncertain nonlinear dynamical system with a nonstationary stochastic excitation. The second one concerns the 2D nonlinear unsteady Navier–Stokes equations for incompressible flows in which the Reynolds number is the random control parameter. Here, the last one deals with the nonlinear dynamics of a 3D elastic structure with uncertainties. The results obtained make it possible to validate the PLoM constrained by stochastic PDE but also provide further validation of the PLoM without constraint.
Uncertainties arising from complicated natural and market environments pose great challenges for the efficient operation of cascaded hydroelectric systems. To overcome these challenges, this paper studies the day-ahead scheduling of cascaded hydroelectric systems in a restructured electricity market with the presence of uncertainties in electricity price and natural water inflow. To properly model the uncertainty, we consider the unique characteristics of these two types of uncertainties and capture them via the uncertainty set and stochastic scenarios, respectively. Further, a hybrid robust-stochastic optimization model is developed to simultaneously hedge against these two types of uncertainties, which is formulated as a large-scale non-convex optimization problem with mixed integer recourse. After introducing linearization of nonlinear terms, a tailored hybrid decomposition scheme combining Lagrangian relaxation and Dantzig-Wolfe decomposition is adopted to achieve efficient computation of the proposed model. Two real-world cases are conducted to demonstrate the capability and characteristics of the proposed model and algorithms.
The problem of identifying linear dynamical systems is studied by considering structural and deterministic properties of linear systems that have an impact on stochastic identification algorithms. In particular considered is parametrization of linear systems so that there is a unique solution and all systems in appropriate class can be represented. It is assumed that a parametrization of system matrices has been established from a priori knowledge of the system, and the question is considered of when the unknown parameters of this system can be identified from input/output observations. It is assumed that the transfer function can be asymptotically identified, and the conditions are derived for the local, global and partial identifiability of the parametrization. Then it is shown that, with the right formulation, identifiability in the presence of feedback can be treated in the same way. Similarly the identifiability of parametrizations of systems driven by unobserved white noise is considered using the results from the theory of spectral factorization.
The operation of cyber-physical-human (CPH) systems is subject to various epistemic and aleatory uncertainties. Overall trustworthiness of CPH systems relies on the trustworthiness of its components and their interactions. It is important that computational models comprising the cyber component of CPH provide predictions accompanied by a measure of confidence in model outcomes. Uncertainty quantification (UQ) and propagation are especially important in safety critical CPH systems. Gradient-boosted trees is a modeling approach capable both of learning the dynamics of a system and performing UQ. In this paper, we devise a method for using gradient boosting to learn the dynamics of a second order differential equation and estimate uncertainty at the same time. We do this by creating a custom loss function that trains the model to approximate the second derivative of a noisy time series, and to penalize based on a parameter that corresponds to the desired quantile. The resulting gradient boosting model can simulate stochastic trajectories of the system given a single starting point, that is, it can estimate both the expected trajectory and its uncertainty. We show that the uncertainty estimation is well calibrated and that the model can learn the dynamics even in the presence of noise. We demonstrate the approach on a simple cartpole system.
The PSAM (Probabilistic Structural Analysis Methods) program is developing a probabilistic structural risk assessment capability for the SSME components. An advanced probabilistic structural analysis software system, NESSUS (Numerical Evaluation of Stochastic Structures Under Stress), is being developed as part of the PSAM effort to accurately simulate stochastic structures operating under severe random loading conditions. One of the challenges in developing the NESSUS system is the development of the probabilistic algorithms that provide both efficiency and accuracy. The main probability algorithms developed and implemented in the NESSUS system are efficient, but approximate in nature. In the last six years, the algorithms have improved very significantly.
PLoM (Probabilistic Learning on Manifolds) is a method introduced in 2016 for handling small training datasets by projecting an Itô equation from a stochastic dissipative Hamiltonian dynamical system, acting as the MCMC generator, for which the KDE-estimated probability measure with the training dataset is the invariant measure. PLoM performs a projection on a reduced-order vector basis related to the training dataset, using the diffusion maps (DMAPS) basis constructed with a time-independent isotropic kernel. In this paper, we propose a new ISDE projection vector basis built from a transient anisotropic kernel, providing an alternative to the DMAPS basis to improve statistical surrogates for stochastic manifolds with heterogeneous data. The construction ensures that for times near the initial time, the DMAPS basis coincides with the transient basis. For larger times, the differences between the two bases are characterized by the angle of their spanned vector subspaces. The optimal instant yielding the optimal transient basis is determined using an estimation of mutual information from Information Theory, which is normalized by the entropy estimation to account for the effects of the number of realizations used in the estimations. Consequently, this new vector basis better represents statistical dependencies in the learned probability measure for any dimension. Three applications with varying levels of statistical complexity and data heterogeneity validate the proposed theory, showing that the transient anisotropic kernel improves the learned probability measure.
Nonlinear stochastic differential equations are used to model wind shear, and extended Kalman filters are used to generate state estimates from measurements received from a Doppler radar onboard an aircraft. Likelihood-ratio tests are then used to detect the presence of wind shear. The performance of the system is evaluated by deriving theoretical expressions for the false alarm and miss error probabiilties. The approach uses a Fokker-Planck equation. The overall methodology is general and should be of interest in other applications.
The application of multiobjective optimization techniques to structural design problems involving uncertain parameters and random processes is studied. The design of a cantilever beam with a tip mass subjected to a stochastic base excitation is considered for illustration. Several of the problem parameters are assumed to be random variables and the structural mass, fatigue damage, and negative of natural frequency of vibration are considered for minimization. The solution of this three-criteria design problem is found by using global criterion, utility function, game theory, goal programming, goal attainment, bounded objective function, and lexicographic methods. It is observed that the game theory approach is superior in finding a better optimum solution, assuming the proper balance of the various objective functions. The procedures used in the present investigation are expected to be useful in the design of general dynamic systems involving uncertain parameters, stochastic process, and multiple objectives.
With shifting environmental trends, many Earth system elements may be poised to undergo critical transitions or ‘tipping’. Reliable anticipation of these tipping elements is vital to inform policy decisions. Many of the current methods for tipping point detection are based on loss of resilience or ‘critical slowdown’ of the system as it approaches a tipping point. However, these methods are prone to false alarms; the detected slowdown may be an artifact of nonstationary noise unrelated to tipping behavior. Here, we explore the efficacy of early warning signs based on a nonequilibrium thermodynamics framework. The model-free detection method relies on the increased intrinsic time-irreversibility due to detailed balance breaking, preceding the onset of tipping or instabilities. We demonstrate that these EWSs are effective for tipping point detection and robust against false alarms due to nonstationary noise, using idealized models for two key elements of the Earth system that are prone to tipping: the Atlantic Meridional Overturning Circulation and Arctic sea-ice loss.
Intercalated metal nanoclusters (NCs) can be formed under the surface of graphite after sputtering to generate surface “portal” defects that allow deposited atoms to reach the subsurface gallery. Although, there is a competition between formation of supported NCs on top of the surface and intercalated NCs under the surface, the latter only dominating at sufficiently high temperature. A stochastic model incorporating appropriate system thermodynamics and kinetics is developed to capture this complex and competitive nucleation and growth process. Kinetic Monte Carlo simulation shows that the model captures experimental trends observed for Cu and other metals and reveals that higher temperatures are needed to facilitate detachment of atoms from supported NCs enabling them to reach the gallery.