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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Effects of noise variance model on optimal feedback design and actuator placement

In optimal placement of actuators for stochastic systems, it is commonly assumed that the actuator noise variances are not related to the feedback matrix and the actuator locations. In this paper, we will discuss the limitation of that assumption and develop a more practical noise variance model. Various properties associated with optimal actuator placement under the assumption of this noise variance model are discovered through the analytical study of a second order system.

Ruan, Mifang↗
NASA NTRS1973

On the decentralized control of large-scale systems

The decentralized control of stochastic large scale systems was considered. Particular emphasis was given to control strategies which utilize decentralized information and can be computed in a decentralized manner. The deterministic constrained optimization problem is generalized to the stochastic case when each decision variable depends on different information and the constraint is only required to be satisfied on the average. For problems with a particular structure, a hierarchical decomposition is obtained. For the stochastic control of dynamic systems with different information sets, a new kind of optimality is proposed which exploits the coupled nature of the dynamic system. The subsystems are assumed to be uncoupled and then certain constraints are required to be satisfied, either in a off-line or on-line fashion. For off-line coordination, a hierarchical approach of solving the problem is obtained. The lower level problems are all uncoupled. For on-line coordination, distinction is made between open loop feedback optimal coordination and closed loop optimal coordination.

Chong, C.↗
NASA NTRS2013

Issues and Strategies in Solving Multidisciplinary Optimization Problems

Optimization research at NASA Glenn Research Center has addressed the design of structures, aircraft and airbreathing propulsion engines. The accumulated multidisciplinary design activity is collected under a testbed entitled COMETBOARDS. Several issues were encountered during the solution of the problems. Four issues and the strategies adapted for their resolution are discussed. This is followed by a discussion on analytical methods that is limited to structural design application. An optimization process can lead to an inefficient local solution. This deficiency was encountered during design of an engine component. The limitation was overcome through an augmentation of animation into optimization. Optimum solutions obtained were infeasible for aircraft and airbreathing propulsion engine problems. Alleviation of this deficiency required a cascading of multiple algorithms. Profile optimization of a beam produced an irregular shape. Engineering intuition restored the regular shape for the beam. The solution obtained for a cylindrical shell by a subproblem strategy converged to a design that can be difficult to manufacture. Resolution of this issue remains a challenge. The issues and resolutions are illustrated through a set of problems: Design of an engine component, Synthesis of a subsonic aircraft, Operation optimization of a supersonic engine, Design of a wave-rotor-topping device, Profile optimization of a cantilever beam, and Design of a cylindrical shell. This chapter provides a cursory account of the issues. Cited references provide detailed discussion on the topics. Design of a structure can also be generated by traditional method and the stochastic design concept. Merits and limitations of the three methods (traditional method, optimization method and stochastic concept) are illustrated. In the traditional method, the constraints are manipulated to obtain the design and weight is back calculated. In design optimization, the weight of a structure becomes the merit function with constraints imposed on failure modes and an optimization algorithm is used to generate the solution. Stochastic design concept accounts for uncertainties in loads, material properties, and other parameters and solution is obtained by solving a design optimization problem for a specified reliability. Acceptable solutions can be produced by all the three methods. The variation in the weight calculated by the methods was found to be modest. Some variation was noticed in designs calculated by the methods. The variation may be attributed to structural indeterminacy. It is prudent to develop design by all three methods prior to its fabrication. The traditional design method can be improved when the simplified sensitivities of the behavior constraint is used. Such sensitivity can reduce design calculations and may have a potential to unify the traditional and optimization methods. Weight versus reliability traced out an inverted-S-shaped graph. The center of the graph corresponded to mean valued design. A heavy design with weight approaching infinity could be produced for a near-zero rate of failure. Weight can be reduced to a small value for a most failure-prone design. Probabilistic modeling of load and material properties remained a challenge.

Patnaik, Surya↗
DOE OSTI2027

Nodal capacity expansion planning with flexible large-scale load siting

We propose explicitly incorporating large-scale load siting into a stochastic nodal power system capacity expansion planning model that concurrently co-optimizes generation, transmission, and storage expansion. The potential operational flexibility of some of these large loads is also taken into account by considering them as consisting of a set of tranches with different reliability requirements, which are modeled as a constraint on expected served energy across operational scenarios. We implement our model as a two-stage stochastic mixed-integer optimization problem with cross-scenario expectation constraints. To overcome the challenge of scalability, we build upon existing work to implement this model on a high performance computing platform and exploit scenario parallelization using an augmented Progressive Hedging Algorithm. The algorithm is implemented using the bounding features of mpisppy, which have shown to provide satisfactory provable optimality gaps despite the absence of theoretical guarantees of convergence. We test our approach and assess the value of this proactive planning framework on total system cost and reliability metrics using realistic testcases geographically assigned to San Diego and South Carolina, with datacenter and direct air capture facilities as large loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1974

On the design of optimal input signals in system identification

The problem of designing optimal inputs in the identification of multi-input multi-output linear systems with unknown time-varying parameters is considered using a Bayesian approach. A sensitivity index gives a measure of performance for the closed-loop system inputs. The computation of the optimal closed-loop mappings is shown to be a nontrivial exercise in stochastic control with no analytic solution, but optimal open-loop and affine laws yield much more tractable problems. For time-invariant systems, the sensitivity index considered is shown to be equivalent to the trace of the (strictly positive definite) information matrix associated with the system. Numerical examples are given. A Kalman filter is used to estimate the parameters. A necessary condition for the Kalman filter not to diverge when applying linear feedback is also given.

Lopez-Toledo, A. A.↗
DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

2023 FORCE Development Status Update

Technical and economic analysis of integrated energy systems (IES) using software models is a complex process requiring multiple commodity market decision analysis, optimal control, process modeling, and stochastic analysis. Many assumptions used in traditional energy analysis tools do not hold in future energy markets with significant storage and variable renewable energy sources (VRE), let alone with multiple commodity markets. Capturing these intricate elements for accurate techno-economic analysis of IES led to the development of the Framework for Optimization of ResourCes and Economics (FORCE) tool suite under the U.S. Department of Energy’s Integrated Energy Systems crosscutting technology program. With the aim of a full framework release in 2025, many improvements to the FORCE tool suite were developed in fiscal year 2023 (FY23). These improvements broadly fit into three focuses for development of FORCE: capability, accessibility, and reliability. Capability refers to the ability of FORCE to accurately model the technical and economic viability of various IES. Accessibility refers to ease-of-use for new and existing IES analysts to efficiently set up, analyze, and produce results using FORCE. Reliability refers to the consistency of the software, allowing consistency to analysis regardless of erstwhile changes to the software. In addition to many smaller changes, there are three major capability improvements in FORCE in FY23. In summary, FORCE developments in FY23 have moved us close to all the capability requirements for FORCE 1.0 to be delivered in FY25. Inclusion of Bayesian optimization, resilience metrics, and levelized cost analysis expand the capability, accessibility, and reliability of FORCE.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗
DOE OSTI2026

GBOpt: Grain boundary structure optimization using Monte Carlo and evolutionary algorithms

Polycrystalline materials are made of many small crystals separated by grain boundaries (GBs), whose atomic structure strongly influences material properties. Because the structure of a GB determines its properties, the optimal structure must be known in order to determine those impacts. There are many ways of placing atoms in the GB region, but the optimal structure is defined as the one that gives the lowest value of a target property (typically energy). GB structure optimization has been successfully demonstrated using stochastic and evolutionary methods, but no reusable, community-maintained open-source workflow has been developed. GBOpt (Grain Boundary Optimization) is an open-source Python package that creates that workflow, where we have presently implemented two approaches: Markov Chain Monte Carlo, and genetic algorithm based on elite selection. We demonstrate this capability by successfully reproducing the known optimal structures of a specific GB in two materials, and point interested readers to the GitHub repository for additional examples, including optimization for different properties. Both of the implemented approaches recovered the known structures, with the genetic algorithm approach finding the optimal structure faster on average.

99 - GENERAL AND MISCELLANEOUS↗
NASA NTRSDate not supplied

Linearized Frequency-Domain Gust Analysis and Adjoint-Based Sensitivities

Gust analysis is added to a linearized frequency-domain method in FUN3D, a NASA computational fluid dynamics solver. The method linearizes about a nonlinear static equilibrium condition and is therefore appropriate for problems with small perturbations such as transonic stochastic gust analysis. In addition to the gust analysis, adjoint-based sensitivities of stochastic gust constraints are implemented for multidisciplinary design optimization. The linearized frequency-domain gust model and adjoint-based sensitivities are described and verified. The method is applied to an optimization for mass minimization of the AGARD 445.6 wing subject to a stochastic gust constraint limiting the displacement of the wing tip.

Aeroelasticity↗
NASA NTRS1981

Optimal interpolation and the Kalman filter

The estimation theory of stochastic-dynamic systems is described and used in a numerical study of optimal interpolation. The general form of data assimilation methods is reviewed. The Kalman-Bucy, KB filter, and optimal interpolation (OI) filters are examined for effectiveness in performance as gain matrices using a one-dimensional form of the shallow-water equations. Control runs in the numerical analyses were performed for a ten-day forecast in concert with the OI method. The effects of optimality, initialization, and assimilation were studied. It was found that correct initialization is necessary in order to localize errors, especially near boundary points. Also, the use of small forecast error growth rates over data-sparse areas was determined to offset inaccurate modeling of correlation functions near boundaries.

Cohn, S.↗
DOE OSTI2024

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms

A key component of variational quantum algorithms (VQAs) is the choice of classical optimizer employed to update the parameterization of an ansatz. It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities. Thus, the evaluation of an objective function (e.g., the guiding function in the quantum approximate optimization algorithm (QAOA) or the expectation of the electronic Hamiltonian in variational quantum eigensolver (VQE)) required by a classical optimizer is subject not only to stochastic error from estimating an expected value but also to error resulting from intermittent hardware noise. Model-based derivative-free optimization methods have emerged as popular choices of a classical optimizer in the noisy VQA setting, based on empirical studies. However, these optimization methods were not explicitly designed with the consideration of noise. In this work we adapt recent developments from the “noise-aware numerical optimization” literature to these commonly used derivative-free model-based methods. We introduce the key defining characteristics of these novel noise-aware derivative-free model-based methods that separate them from standard model-based methods. In conclusion, we study an implementation of such noise-aware derivative-free model-based methods and compare its performance on demonstrative VQA simulations to classical solvers packaged in scikit-quant.

classical optimizers↗
DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A simple way to integrate distributed storage into a wholesale electricity market

Abstract Current plans to decarbonize the electric supply system imply that the generation from wind and solar sources will grow substantially. This growth will increase the uncertainty of system operations due to the inherent variability of these renewable sources, and as a result, more reserve capacity will be required to provide the ramping (flexibility) needed for reliable operations. This paper assumes that all of the increased uncertainty comes from wind farms on the grid, and it shows how distributed storage managed locally by aggregators can provide the ramping needed without introducing a separate market for flexibility. This can be accomplished when the aggregators minimize the expected daily cost of the energy purchased from the grid for their customers by submitting optimal bids into the wholesale market with high and low price thresholds for discharging and charging the storage. This model is illustrated using a stochastic multi-period security constrained optimal power flow together with realistic data for a reduction of the network in the Northeast Power Coordinating Council region of the United States. The results show that the bidding strategy for distributed storage provides ramping to the grid just as effectively as storage managed by a system operator.

Lamadrid, Alberto J.↗
DOE OSTI2022

Secure Control Regions for Distributed Stochastic Systems with Application to Distributed Energy Resource Dispatch: Preprint

With the increasing connectedness and interdependence of systems that are stochastic in nature, the issue of how to manage and coordinate them for safe operation has evidently become more important. In many networked system architectures, the system-wide output has to be delicately managed; often within a prescribed set of bounds. In this paper, a novel control framework is proposed where the bounds on the outputs are translated into independent bounds on the controllable inputs of each subsystem. The main benefit of this framework is that respecting the individual control bounds suffices to guarantee that the system-wide outputs will remain within safe boundaries. Since the systems are assumed to be stochastic, the bounds on the output are introduced as probabilistic chance constraints. The benefits of this framework are demonstrated by applying it to the control of distributed energy resources in a distribution networks where main goal is to keep the voltage magnitudes with their prescribed bounds. The control bounds are evaluated using real data on an IEEE test system.

chance constrained optimization↗
DOE OSTI2022

Secure Control Regions for Distributed Stochastic Systems with Application to Distributed Energy Resource Dispatch

With the increasing connectedness and interdependence of systems that are stochastic in nature, the issue of how to manage and coordinate them for safe operation has evidently become more important. In many networked system architectures, the system-wide output must be delicately managed, often within a prescribed set of bounds. In this paper, a novel control framework is proposed where the bounds on the outputs are translated into independent bounds on the controllable inputs of each subsystem. The main benefit of this framework is that respecting the individual control bounds suffices to guarantee that the system-wide outputs will remain within safe boundaries. Because the systems are assumed to be stochastic, the bounds on the output are introduced as probabilistic chance constraints. The benefits of this framework are demonstrated by applying it to the control of distributed energy resources in a distribution network where the main goal is to keep the voltage magnitudes within their prescribed bounds. The control bounds are evaluated using real data on an IEEE test system.

chance constrained optimization↗
DOE OSTI2021

Survey on stochastic distribution systems: A full probability density function control theory with potential applications

Complex systems seen either in general engineering practice or economics are subjected to ever increased uncertainties that are mostly represented as random variables or parameters, and the characteristics of random variables are represented by their probability density functions (PDFs). Controlling their PDFs means to shape their stochastic distributions and in general it would provide a full treatment for system analysis and operational control and optimization. This leads to the development of stochastic distribution control (SDC) systems theory in the past decades, where the original aim of the controller design is to realize a shape control of the distributions of certain random variables in their PDFs sense for some engineering processes. Indeed, once the PDFs of these random variables or parameters are used to describe their distribution characters, the control task is to obtain control signals so that the output PDFs of stochastic systems are made to follow their target PDFs. The subject of SDC was initially originated for non-Gaussian stochastic control systems design but has found a wide spectrum of applications in general systems in terms of data-driven modeling, analysis, signal processing (filtering), data mining via multivariable statistics, decision-making (optimization) for systems subjected to uncertainties and even in economics. In this context, SDC constitutes an effective primer tool for complex system analysis, control and operational optimizations. In this review paper, a detailed survey of the developments on the research of SDC systems will be made together with their wide spectrum applications and future perspectives.

42 ENGINEERING↗
DOE OSTI2025

Control-Affine Schrödinger Bridge and Generalized Bohm Potential

From a stochastic control perspective, the Schrödinger bridge is a density-valued continuous curve parameterized by time that connects a given pair of initial and terminal probability densities via minimum effort controlled Brownian motion. The control-affine Schrödinger bridge extends this idea to a generic control-affine Itô diffusion, possibly with an additive state cost. Here, in this letter, we recast the necessary conditions of optimality for the control-affine Schrödinger bridge problem as a two point boundary value problem for a quantum mechanical Schrödinger PDE with complex potential. This complex-valued potential is a generalization of the real-valued Bohm potential in quantum mechanics. Our derived potential is akin to the optical potential in nuclear physics where the real part of the potential encodes elastic scattering (transmission of wave function), and the imaginary part encodes inelastic scattering (absorption of wave function). The key takeaway is that the process noise that drives the evolution of probability densities induces an absorbing medium in the evolution of wave function. These results make new connections between control theory and non-equilibrium statistical mechanics through the lens of quantum mechanics.

Markov processes↗