Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributionally robust optimization”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Design Under Uncertainty for Conceptual Aircraft Design Leveraging Analytical Gradients

The purpose of this paper is to extend previously demonstrated methodologies for design under uncertainty, leveraging analytical gradients to higher fidelity analysis for use in conceptual aircraft design. Previous work developed methods to generate analytical derivatives through polynomial chaos expansion, eliminating the need to estimate derivatives via complex step or finite difference. In this research, the authors build upon the methods to include physics-based aircraft design codes for aircraft design under uncertainty. This extends the previous work’s case study, which employed analytical aerodynamics and Breguet range estimations for wing design, to a higher fidelity level. In addition, this work extends previous work on interface development between the Uncertainty Quantification with Polynomial Chaos Expansion (UQPCE) software and Model-Based Systems Analysis and Engineering (MBSA&E) frameworks. This paper will discuss the development work necessary to perform multidisciplinary design under uncertainty as well as demonstrate the mechanics of interfacing UQPCE and conceptual aircraft design tools such as NASA’s Aviary code. In a case study, a conceptual aircraft design under uncertainty was conducted and compared against a traditional deterministic design. When given information about the uncertainty space from UQPCE, the optimizer was able to shape the output distribution and produce a more robust design

UQ↗
NASA NTRSDate not supplied

Design Under Uncertainty for Conceptual Aircraft Design Leveraging Analytical Gradients

The purpose of this paper is to extend previously demonstrated methodologies for design under uncertainty, leveraging analytical gradients to higher fidelity analysis for use in conceptual aircraft design. Previous work developed methods to generate analytical derivatives through polynomial chaos expansion, eliminating the need to estimate derivatives via complex step or finite difference. In this research, the authors build upon the methods to include physics-based aircraft design codes for aircraft design under uncertainty. This extends the previous work’s case study, which employed analytical aerodynamics and Breguet range estimations for wing design, to a higher fidelity level. In addition, this work extends previous work on interface development between the Uncertainty Quantification with Polynomial Chaos Expansion (UQPCE) software and Model-Based Systems Analysis and Engineering (MBSA&E) frameworks. This paper will discuss the development work necessary to perform multidisciplinary design under uncertainty as well as demonstrate the mechanics of interfacing UQPCE and conceptual aircraft design tools such as NASA’s Aviary code. In a case study, a conceptual aircraft design under uncertainty was conducted and compared against a traditional deterministic design. When given information about the uncertainty space from UQPCE, the optimizer was able to shape the output distribution and produce a more robust design.

UQ↗
DOE OSTI2024

Projective Integral Updates for High-Dimensional Variational Inference

Variational inference is an approximation framework for Bayesian inference that seeks to improve quantified uncertainty in predictions by optimizing a simplified distribution over parameters to stand in for the full posterior. Capturing model variations that remain consistent with training data enables more robust predictions by reducing parameter sensitivity. This work introduces a fixed-point optimization for variational inference that is applicable when every feasible log density can be expressed as a linear combination of functions from a given basis. In such cases, the optimizer becomes a fixed-point of projective integral updates. When the basis spans univariate quadratics in each parameter, the feasible distributions are Gaussian mean-fields and the projective integral updates yield quasi-Newton variational Bayes (QNVB). Other bases and updates are also possible. Since these updates require high-dimensional integration, this work begins by proposing an efficient quasirandom sequence of quadratures for mean-field distributions. Each iterate of the sequence contains two evaluation points that combine to correctly integrate all univariate quadratic functions and, if the mean-field factors are symmetric, all univariate cubics. More importantly, averaging results over short subsequences achieves periodic exactness on a much larger space of multivariate polynomials of quadratic total degree. The corresponding variational updates require four loss evaluations with standard (not second-order) backpropagation to eliminate error terms from over half of all multivariate quadratic basis functions. Furthermore, this integration technique is motivated by first proposing stochastic blocked mean-field quadratures, which may be useful in other contexts. A PyTorch implementation of QNVB allows for better control over model uncertainty during training than competing methods. Experiments demonstrate superior generalizability for multiple learning problems and architectures.

Gaussian mean-field↗
DOE OSTI2025

Large Scale Bilevel Optimization for N-K SCOPF Using Adversarial Robustness

Ensuring a secure dispatch against multiple simultaneous outages has long been desired to maintain grid security in the presence of severe events, such as extreme weather phenomena. Traditionally denoted as N-k security constrained optimal power flow (N-k SCOPF), this problem is intractable to solve due to its size being combinatorial in the number of simultaneous outages and due to the non-convex nature of the AC network constraints. This hinders the use of N-k SCOPF for operating realistic-scale systems. In this paper, we introduce a methodology to scalably solve an AC-feasible dispatch that improves security over k simultaneous outages. Our methodology poses N-k SCOPF as a bilevel optimization problem and solves it using an adversarial robustness approach. We develop new efficient methods to solve each level of the bilevel optimization by employing knowledge of the physics of the underlying system. This yields significant improvements in speed and convergence that enable us to address the N-k SCOPF problem at scale. We demonstrate the effectiveness of our method by conducting a comprehensive analysis of an N-3 SCOPF for a 500-bus network. Furthermore, we emphasize the ability of our physics-driven techniques to handle larger systems by successfully scaling up to 12,000 buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2002

Approach for Input Uncertainty Propagation and Robust Design in CFD Using Sensitivity Derivatives

An implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for quasi 3-D Euler CFD code is presented. Given uncertainties in statistically independent, random, normally distributed input variables, first- and second-order statistical moment procedures are performed to approximate the uncertainty in the CFD output. Efficient calculation of both first- and second-order sensitivity derivatives is required. In order to assess the validity of the approximations, these moments are compared with statistical moments generated through Monte Carlo simulations. The uncertainties in the CFD input variables are also incorporated into a robust optimization procedure. For this optimization, statistical moments involving first-order sensitivity derivatives appear in the objective function and system constraints. Second-order sensitivity derivatives are used in a gradient-based search to successfully execute a robust optimization. The approximate methods used throughout the analyses are found to be valid when considering robustness about input parameter mean values.

Putko, Michele M.↗
DOE OSTI2022

Enabling Grid-Aware Market Participation of Aggregate Flexible Resources

Increasing integration of distributed energy resources (DERs) within distribution feeders provides unprecedented flexibility at the distribution-transmission interconnection. With the new FERC 2222 order, DER aggregations are allowed to participate in energy market. To enable market participation, these virtual power plants need to provide their generation cost curves. This paper proposes efficient optimization formulations and solution approaches for the characterization of hourly as well as multi-time-step generation cost curves for a distribution system with high penetration of DERs. Network and DER constraints are taken into account when deriving these cost curves, and they enable active distribution systems to bid into the electricity market. The problems of deriving linear and quadratic cost curves are formulated as robust optimization problems and tractable reformulation/solution algorithm are developed to facilitate efficient calculations. The proposed formulations and solution algorithm are validated on a realistic test feeder with high penetration of flexible resources.

aggregated distributed energy resources↗
DOE OSTI2021

Radar-Based Bayesian Estimation of Ice Crystal Growth Parameters within a Microphysical Model

The potential for polarimetric Doppler radar measurements to improve predictions of ice microphysical processes within an idealized model–observational framework is examined. In an effort to more rigorously constrain ice growth processes (e.g., vapor deposition) with observations of natural clouds, a novel framework is developed to compare simulated and observed radar measurements, coupling a bulk adaptive-habit model of vapor growth to a polarimetric radar forward model. Bayesian inference on key microphysical model parameters is then used, via a Markov chain Monte Carlo sampler, to estimate the probability distribution of the model parameters. The statistical formalism of this method allows for robust estimates of the optimal parameter values, along with (non-Gaussian) estimates of their uncertainty. To demonstrate this framework, observations from Department of Energy radars in the Arctic during a case of pristine ice precipitation are used to constrain vapor deposition parameters in the adaptive habit model. The resulting parameter probability distributions provide physically plausible changes in ice particle density and aspect ratio during growth. A lack of direct constraint on the number concentration produces a range of possible mean particle sizes, with the mean size inversely correlated to number concentration. Consistency is found between the estimated inherent growth ratio and independent laboratory measurements, increasing confidence in the parameter PDFs and demonstrating the effectiveness of the radar measurements in constraining the parameters. Furthermore, the combined Doppler and polarimetric observations produce the highest-confidence estimates of the parameter PDFs, with the Doppler measurements providing a stronger constraint for this case.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2021

Radar-Based Bayesian Estimation of Ice Crystal Growth Parameters within a Microphysical Model

The potential for polarimetric Doppler radar measurements to improve predictions of ice microphysical processes within an idealized model–observational framework is examined. In an effort to more rigorously constrain ice growth processes (e.g., vapor deposition) with observations of natural clouds, a novel framework is developed to compare simulated and observed radar measurements, coupling a bulk adaptive-habit model of vapor growth to a polarimetric radar forward model. Bayesian inference on key microphysical model parameters is then used, via a Markov chain Monte Carlo sampler, to estimate the probability distribution of the model parameters. The statistical formalism of this method allows for robust estimates of the optimal parameter values, along with (non-Gaussian) estimates of their uncertainty. To demonstrate this framework, observations from Department of Energy radars in the Arctic during a case of pristine ice precipitation are used to constrain vapor deposition parameters in the adaptive habit model. The resulting parameter probability distributions provide physically plausible changes in ice particle density and aspect ratio during growth. A lack of direct constraint on the number concentration produces a range of possible mean particle sizes, with the mean size inversely correlated to number concentration. Consistency is found between the estimated inherent growth ratio and independent laboratory measurements, increasing confidence in the parameter PDFs and demonstrating the effectiveness of the radar measurements in constraining the parameters. The combined Doppler and polarimetric observations produce the highest-confidence estimates of the parameter PDFs, with the Doppler measurements providing a stronger constraint for this case.

Robert S. Schrom↗
DOE OSTI2025

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗
NASA NTRS2019

Quantum Technologies for UAS (QTech)

Harness the power of quantum technologies to assure the availability of UAS communications against disruptions. Make use of quantum computing (e.g. quantum optimization) and quantum communication (e.g. quantum key distribution) to address the availability cybersecurity challenge. Our approach is three-fold: (1) Utilize quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) Utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents, (3) Utilize quantum key distribution (QKD) to execute secure key sharing in high data rate optical communication and/or anti-jamming protocols for secure RF communication.

Quantum Computing↗
NASA NTRS2001

Approach for Uncertainty Propagation and Robust Design in CFD Using Sensitivity Derivatives

This paper presents an implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for a quasi 1-D Euler CFD (computational fluid dynamics) code. Given uncertainties in statistically independent, random, normally distributed input variables, a first- and second-order statistical moment matching procedure is performed to approximate the uncertainty in the CFD output. Efficient calculation of both first- and second-order sensitivity derivatives is required. In order to assess the validity of the approximations, the moments are compared with statistical moments generated through Monte Carlo simulations. The uncertainties in the CFD input variables are also incorporated into a robust optimization procedure. For this optimization, statistical moments involving first-order sensitivity derivatives appear in the objective function and system constraints. Second-order sensitivity derivatives are used in a gradient-based search to successfully execute a robust optimization. The approximate methods used throughout the analyses are found to be valid when considering robustness about input parameter mean values.

Putko, Michele M.↗
DOE OSTI2023

An Online Joint Optimization–Estimation Architecture for Distribution Networks

Here in this article, we propose an optimal joint optimization-estimation architecture for distribution networks, which jointly solves the optimal power flow (OPF) problem and static state estimation (SE) problem through an online gradient-based feedback algorithm. The main objective is to enable a fast and timely interaction between the OPF decisions and state estimators with limited sensor measurements. First, convergence and optimality of the proposed algorithm are analytically established. Then, the proposed gradient-based algorithm is modified by introducing statistical information of the inherent estimation and linearization errors for an improved and robust performance of the online OPF decisions. Overall, the proposed method eliminates the traditional separation of operation and monitoring, where optimization and estimation usually operate at distinct layers and different time scales. Hence, it enables a computationally affordable, efficient, and robust online operational framework for distribution networks under time-varying settings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2004

Employing Sensitivity Derivatives for Robust Optimization under Uncertainty in CFD

A robust optimization is demonstrated on a two-dimensional inviscid airfoil problem in subsonic flow. Given uncertainties in statistically independent, random, normally distributed flow parameters (input variables), an approximate first-order statistical moment method is employed to represent the Computational Fluid Dynamics (CFD) code outputs as expected values with variances. These output quantities are used to form the objective function and constraints. The constraints are cast in probabilistic terms; that is, the probability that a constraint is satisfied is greater than or equal to some desired target probability. Gradient-based robust optimization of this stochastic problem is accomplished through use of both first and second-order sensitivity derivatives. For each robust optimization, the effect of increasing both input standard deviations and target probability of constraint satisfaction are demonstrated. This method provides a means for incorporating uncertainty when considering small deviations from input mean values.

Newman, Perry A.↗
DOE OSTI2023

Fast Tuning-Free Distributed Algorithm for Solving the Network-Constrained Economic Dispatch

With the increasing penetration of distributed energy resources (DERs) and their participation in the electricity market, it becomes more desirable to apply distributed algorithms for resource allocation in order to address the resulting computational and communicational challenges. Most of the existing distributed algorithms for solving the network-constrained economic dispatch (NCED) problem require the tuning of certain auxiliary parameters. As a result, the robustness of these algorithms against the varieties in DERs is greatly undermined. In this paper, a new distributed algorithm, optimality condition consensus (OCC), is proposed to solve the NCED problem by using distributed power flow (DPF) and ratio consensus as fundamental tools. It inherits the advantages of existing distributed algorithms for the NCED problem but removes the need for parameter tuning to improve performance in practice. In conclusion, the effectiveness of the proposed distributed algorithm in terms of efficiency, scalability, and robustness is demonstrated through detailed case studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗
DOE OSTI2021

Optimal Demand Response Incorporating Distribution LMP with PV Generation Uncertainty

The utilization of aggregated demand-side flexibility via demand response (DR) has become a promising pathway for the integration of renewable energy resources in power systems. Nowadays, there are several management strategies for DR such as the price-based transactive control strategies. However, many of such existing price-based control strategies neglect the physics and operational constraints of the underlying distribution networks when computing the price, raising concerns regarding their theoretical and practical values. This paper studies this issue and investigates optimal DR (ODR) by incorporating the distribution locational marginal price (DLMP). In particular, we discuss DR in connection with DLMPs and propose a multiperiod bilevel optimization problem to find the ODR strategy. Here, the objective is to minimize the peak load, load fluctuation, and payments of load aggregators. In addition, a robust bilevel ODR model is formulated to provide a robust ODR strategy while minimizing operating costs under the worst-case realization of uncertainties; this mitigates the impact of forecasting errors on renewable energy resources. Then, we propose an efficient solution approach by employing the Karush-Kuhn-Tucker conditions and strong duality. Simulation results are presented to illustrate the mutual impacts of the interaction between DR and DLMP and the benefits of the robust ODR strategy.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Robust Optimal Control of Inverter-Based Resources Under Grid-Forming Operation

In this paper, we propose and solve a robust control problem for inverter-based resources under grid-forming operation to regulate the voltage and frequency. One major challenge is to mitigate the effect of unmeasurable load current disturbance, grid and load parametric uncertainties. Moreover, strong coupling between the state variables on both the AC and DC sides, as well as between the modulating control input and the frequency impose additional challenges. To address these challenges, first, a robust control problem is solved at the high level via transformation into an equivalent, but more tractable, optimal control problem. Then, in the middle layer a voltage control law is designed on the one side, and a frequency control law on the other side. Finally, an inverter filter current controller is designed to complete the controller design. Theoretical results are derived to provide stability guarantees for the resulting closed-loop system. Specifically, we show that the inverter current injection error is dissipative, the frequency error is semi-globally asymptotically stable, and the inverter terminal voltage error is globally asymptotically stable, all with provided sufficient conditions. Here, numerical simulation experiments are used to validate the theoretical claims. Furthermore, the developed controller is compared with existing work in literature to show the efficacy of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗