Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic optimizations”

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

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Theory Manual (V.6.15)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis (V.6.16 User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

A hybrid data-driven and model-based approach for computationally efficient stochastic unit commitment and economic dispatch under wind and solar uncertainty

Stochastic unit commitment (UC) and economic dispatch (ED) are imperative in dealing with uncertainty in renewable forecast for power system operation and planning such that the overall expected production cost is minimized over the planning horizon. However, accurate calculation of the expected production cost requires assessment of a very large number of different scenarios of uncertain renewable resources, such as solar and wind, which is practically infeasible to simulate in real time. This article proposes a hybrid datadriven and physics-based model-predictive paradigm to efficiently solve for stochastic unit commitment and economic dispatch considering uncertainty in wind and solar power forecasts. Here, the novelty of the approach lies in decoupling the production cost estimation from the unit commitment and economic dispatch optimization problems under uncertainty without compromising on the fidelity of the solutions. A data-driven machine learning model is first developed to predict the mean optimal production cost. A physics-based inverse problem is then solved to get the stochastic UC and ED profiles from the expected cost. The presented approach considers, for the first time, solar uncertainty in UC/ED determination and enables efficient and accurate propagation of wind and solar uncertainty to estimate the statistics of the production cost. The effectiveness of the developed approach is demonstrated systematically on a stylized RTS-GMLC single-node system. The overall framework predicts the expected cost 62.5% more accurately than the existing state-of-the-art, on unforeseen days during the entire year, and yields, for the first time, the associated physically consistent UC and ED profiles. The solutions are also shown to be flexible in providing adequate daily reserves to address any statistical deviations from probabilistic power forecasts. The computational time associated with the presented method is only about 10 s compared to over 24 h needed for a conventional stochastic UC/ED determination under uncertainty on an Intel Core i9 processor with 32 GB of RAM.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

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↗

A bilevel multistage stochastic self-scheduling model with indivisibilities for trading in the continuous intraday electricity market

In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.

Bilevel multistage stochastic programming problem↗

A stochastic regulator for integrated communication and control systems. I - Formulation of control law. II - Numerical analysis and simulation

A state feedback control law for integrated communication and control systems (ICCS) is formulated by using the dynamic programming and optimality principle on a finite-time horizon. The control law is derived on the basis of a stochastic model of the plant which is augmented in state space to allow for the effects of randomly varying delays in the feedback loop. A numerical procedure for synthesizing the control parameters is then presented, and the performance of the control law is evaluated by simulating the flight dynamics model of an advanced aircraft. Finally, recommendations for future work are made.

Liou, Luen-Woei↗

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Data-Driven Global Sensitivity Analysis Framework for Three-Phase Distribution System with PVs

Global sensitivity analysis (GSA) of distribution systems with respect to stochastic PV and load variations plays an important role in designing optimal voltage control schemes. This paper proposes a data-driven framework for GSA of distribution systems. In particular, two representative surrogate modeling-based approaches are developed, including the traditional Gaussian process-based and the analysis of variance (ANOVA) kernel ones. The key idea is to develop a surrogate model that captures the hidden global relationship between voltage and real and reactive power injections from the historical data. With the surrogate model, the Sobol indices can be conveniently calculated through either the sampling-based method or the analytical method to assess the global sensitivity of voltage to variations of PV and load power injections. The sampling-based method approximates the Sobol indices using Monte Carlo simulations while the analytical method calculates them by resorting to the ANOVA expansion framework. Comparison results with other model-based GSA methods on the unbalanced three-phase IEEE 37-bus and 123-bus distribution systems show that the proposed framework can achieve much higher computational efficiency with negligible loss of accuracy. The results on a real 240-node distribution system using actual smart meter data further validate the feasibility and scalability of the proposed framework.

14 SOLAR ENERGY↗

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↗

Application of Sequential Design of Experiments (SDoE) to Large Pilot-Scale Solvent-Based CO2 Capture Process at Technology Centre Mongstad (TCM)

The United States Department of Energy’s Carbon Capture Simulation for Industry Impact (CCSI2) program has developed a framework for sequential design of experiments (SDoE) that aims to maximize knowledge gained from budget- and schedule-limited pilot scale testing. SDoE was applied to the planning and execution of campaigns for testing CO2 capture systems at pilot-scale in order to optimally allocate resources available for the testing. In this methodology, a stochastic process model is developed by quantifying the parametric uncertainty in submodels of interest; for a solvent-based CO2 capture system, these may include physical properties and equipment performance submodels (e.g., mass transfer, interfacial area). This uncertainty is propagated through the full process model, over variable operating conditions, for estimating the resulting uncertainty in key model outputs (e.g., percentage of CO2 capture, solvent regeneration energy requirement). In developing a data collection plan, the predicted output uncertainty is incorporated into an algorithm that seeks simultaneously to select process operating conditions for which the predicted uncertainty is relatively high and to ensure that the entire space of operation is well represented. This test plan is then used to guide operation of the pilot plant at varying steady-state conditions, with resulting process data incorporated into the existing model using Bayesian inference to refine parameter distributions. The updated stochastic model, with reduced parametric uncertainty from data collected, is then used to guide additional data collection, thus the sequential nature of the experimental design. The SDoE process was implemented at the pilot test unit (12 MWe in scale) at Norway’s Technology Centre Mongstad (TCM) in a summer 2018 test campaign with aqueous monoethanolamine (MEA). During the test campaign, the varied operating conditions included the flowrates of circulated solvent, flue gas, and reboiler steam and the CO2 concentration in the flue gas. The process data were used to update probability distributions of mass transfer and interfacial area parameters of a stochastic process model developed by the CCSI2 team. Two iterations of the SDoE process were executed, resulting in the uncertainty in model predicted CO2 capture percentage decreasing by an average of 58.0 ± 4.7% over the full input space of interest. This work demonstrates the potential of the SDoE process for model refinement through reduction in process model parametric uncertainty, and ultimately risk in scale-up, in CO2 capture technology performance.

carbon capture↗

Nonlinear filtering for random signals in statistically unknown noise.

Natural and effective formulation of the filtering problem involved in satellite orbit determination, aircraft navigation, and missile tracking. The problem arises because the environment of the sensor keeps changing from time to time, and it is quite impractical and sometimes impossible to collect the statistical data of the noise incurred in the observation. Computable filtering equations are deduced. The idea of invariant imbedding along with stochastic differential calculus is used to derive differential equations for the optimal estimate.

Loo, J. T.↗

Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander

Plan execution in unknown environments poses a number of challenges: uncertainty in domain modeling, stochasticity at execution time, and the presence of exogenous events. These challenges motivate an integrated approach to planning and execution that is able to respond intelligently to variation. We examine this problem in the context of the Europa Lander mission concept, and evaluate a planning and execution framework that responds to feedback and task failure using two techniques: flexible execution and replanning with plan optimization. We develop a theoretical framework to estimate gains from these techniques, and we compare these predictions to empirical results generated in simulation. These results indicate that an integrated approach to planning and execution leveraging flexible execution, replanning, and utility maximization shows significant promise for future tightly-constrained space missions that must address significant uncertainty.

Chien, Steve↗

Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander

Plan execution in unknown environments poses a number of challenges: uncertainty in domain modeling, stochasticity at execution time, and the presence of exogenous events. These challenges motivate an integrated approach to planning and execution that is able to respond intelligently to variation. We examine this problem in the context of the Europa Lander mission concept, and propose a planning and execution framework that responds to feedback and task failure using two techniques: flexible execution and replanning with plan optimization. We develop a theoretical framework to predict the value of each of these techniques, and we compare these predictions to empirical results generated in simulation. We demonstrate that an integrated approach to planning and execution that is grounded in flexible execution, replanning, and utility maximization will be an enabling technology for future tightly-constrained planetary surface missions.

Chien, Steve↗

Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander

Plan execution in unknown environments poses a number of challenges: uncertainty in domain modeling, stochasticity at execution time, and the presence of exogenous events. These challenges motivate an integrated approach to planning and execution that is able to respond intelligently to variation. We examine this problem in the context of the Europa Lander mission concept, and propose a planning and execution framework that responds to feedback and task failure using two techniques: flexible execution and replanning with plan optimization. We develop a theoretical framework to predict the value of each of these techniques, and we compare these predictions to empirical results generated in simulation. We demonstrate that an integrated approach to planning and execution that is grounded in flexible execution, replanning, and utility maximization will be an enabling technology for future tightly-constrained planetary surface missions.

Basich, Connor↗

Hybrid Differential Dynamic Programming with Stochastic Search

Differential dynamic programming (DDP) has been demonstrated as a viable approach to low-thrust trajectory optimization, namely with the recent success of NASAs Dawn mission. The Dawn trajectory was designed with the DDP-based Static Dynamic Optimal Control algorithm used in the Mystic software. Another recently developed method, Hybrid Differential Dynamic Programming (HDDP) is a variant of the standard DDP formulation that leverages both first-order and second-order state transition matrices in addition to nonlinear programming (NLP) techniques. Areas of improvement over standard DDP include constraint handling, convergence properties, continuous dynamics, and multi-phase capability. DDP is a gradient based method and will converge to a solution nearby an initial guess. In this study, monotonic basin hopping (MBH) is employed as a stochastic search method to overcome this limitation, by augmenting the HDDP algorithm for a wider search of the solution space.

Aziz, Jonathan↗