Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 217 records · Page 12

Modeling transmission line constraints in two-stage robust unit commitment problem

Integration of renewable energy sources and demand response poses new challenges to system operators as they increase the uncertainty of the power supply and demand. Recently, robust optimization techniques are applied to the unit commitment problem with uncertainty as an alternative to the stochastic programming approaches. However, it remains challenging to solve the robust unit commitment model with full transmission line constraints. In this paper, we propose novel acceleration techniques for solving two-stage robust unit commitment problem with consideration of full transmission line constraints. We use 1) the cutting-plane algorithm for the master problem, which dynamically includes critical transmission line constraints, and 2) column-generation methods, including the branch-and-price-and-cut algorithm and heuristic approaches, for the subproblems, which add only necessary transmission line dual variables on the fly. Furthermore, computational results for the modified IEEE 118-bus system show that the combination of the cutting-plane algorithm and the heuristic column-generation approach greatly reduces the total solution time of the two-stage robust unit commitment problem.

Heuristic algorithms↗

Managing uncertainty in data-driven simulation-based optimization

Optimization using data from complex simulations has become an attractive decision-making option, due to ability to embed high-fidelity, non-linear understanding of processes within the search for optimal values. Due to lack of tractable algebraic equations, the link between simulations and optimization is oftentimes a surrogate metamodel. However, several forms of uncertainty exist within the cycle that links simulation data, to metamodels, to optimization. Uncertainty may originate from parameters of the simulation, or the form and fitted parameters of the metamodel. This paper reviews different literatures that are relevant to surrogate-based optimization and proposes different strategies for handling uncertainty, by combining machine learning with stochastic programming, robust optimization, and discrepancy modeling. We show that incorporating uncertainty management within simulation-based optimization leads to more robust solutions, which protect the decision-maker from infeasible solutions. Here, we present the results of our proposed approaches through a case study for direct-air capture through temperature swing adsorption.

42 ENGINEERING↗

Transmission expansion with smart switching under demand uncertainty and line failures

One of the major challenges in deciding where to build new transmission lines is that there is uncertainty regarding future loads, renewal generation output and equipment failures. We propose a robust optimization model whose transmission expansion solutions ensure that demand can be met over a wide range of conditions. Specifically, we require feasible operation for all loads and renewable generation levels within given ranges, and for all single transmission line failures. Furthermore, we consider transmission switching as an allowable recovery action. This relatively inexpensive method of redirecting power flows improves resiliency, but introduces computational challenges. Lastly, we present a novel algorithm to solve this model. Computational results are discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Enhancing the Survivability of Power Systems With Grid-Edge DERs Against DoS Attacks

Power system survivability, defined as the ability of a system to maintain steady-state functionality under varying operational conditions, reflects its resilience against disturbances. While existing research primarily focuses on physical-layer disturbances, the increasing prevalence of grid-edge DERs, which are primarily used for integrating renewable energy, has significantly expanded the cyber attack surface. As a result, operational disruptions caused by cyber threats are posing significant challenges to system survivability and cannot be overlooked. To fill this gap, we redefine system survivability to incorporate the cyber layer’s status and propose a Distributionally Robust Optimization (DRO) approach to enhance power system survivability against potential cyber-physical threats. In this paper, we first analyze the operational guidelines of systems with a high penetration of DERs under various cyber network conditions and redefine survivability in this context. Next, we focus on the most common cyber threat, Denial-of-Service (DoS) attacks, and develop a corresponding attack model. This model allows for the creation of a kernel-based ambiguity set that captures attack uncertainties using historical data. Finally, we transform the proposed DRO model as a tractable optimization problem, with its solution providing an optimal cyber redundancy plan to enhance system survivability in DoS attack scenarios. Simulation results on the IEEE 13-node and 123-node test feeders demonstrate the effectiveness of our proposed model in improving system survivability. This model can also be expanded to include other types of common attacks and serve as a comprehensive planning tool to improve overall cyber physical survival of the system.

cybersecurity↗

Data-Based Resilience Enhancement Strategies for Electric-Gas Systems Against Sequential Extreme Weather Events

Some extreme weather events, such as the hurricane, pass through an area sequentially and thus are called sequential extreme weather events (SEWEs). This paper proposes a data-based robust optimization (RO) model to enhance the resilience of the integrated electricity and gas system (IEGS) against SEWEs. Specifically, the SEWE strikes the IEGS sequentially. After each attack, the system state is adjusted immediately to minimize the maximized expected system cost caused by the SEWE. The attack-defense procedures are repeated alternatively during the SEWE. Preventive measures, hardening, are made in advance to reduce the impact of sequential attacks. The entire process is formulated as a multi-period RO model. Furthermore, it is proved that the most effective resilience enhancement strategies for this model are the same as those for a two-stage RO model, which can be solved by the nested column-and-constraint generation (C&CG) algorithm. In addition, the property of SEWEs, sequentially endangering limited regions of the IEGS, is incorporated to build a data-based uncertainty set and reduce its conservativeness. Simulation results on two IEGSs validate the effectiveness of the proposed model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant: Preprint

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗

Random field optimization

Herein we present a new modeling paradigm for optimization that we call random field optimization. Random fields are a powerful modeling abstraction that aims to capture the behavior of random variables that live on infinite-dimensional spaces (e.g., space and time) such as stochastic processes (e.g., time series, Gaussian processes, and Markov processes), random matrices, and random spatial fields. This paradigm involves sophisticated mathematical objects (e.g., stochastic differential equations and space-time kernel functions) and has been widely used in neuroscience, geoscience, physics, civil engineering, and computer graphics. Despite of this, however, random fields have seen limited use in optimization; specifically, existing optimization paradigms that involve uncertainty (e.g., stochastic programming and robust optimization) mostly focus on the use of finite random variables. This trend is rapidly changing with the advent of statistical optimization (e.g., Bayesian optimization) and multi-scale optimization (e.g., integration of molecular sciences and process engineering). Our work extends a recently-proposed abstraction for infinite-dimensional optimization problems by capturing more general uncertainty representations. Moreover, we discuss solution paradigms for this new class of problems based on finite transformations and sampling, and identify open questions and challenges.

97 MATHEMATICS AND COMPUTING↗

Insights into Methodologies and Stochastic Optimization of Thermal Energy Storage-Coupled Advanced Reactor Systems: A Comparison of Methods for Accessing Long-Term Sub-System Sizing Adequacy

This paper investigates the potential of coupling Thermal Energy Storage (TES) with Advanced Reactors (ARs) to address uncertainties posed by climate change in deep decarbonized power systems. The TES Use-case Team at Idaho National Laboratory (INL) has examined the potential of storing thermal energy from ARs during low demand periods and optimizing discharge during peak-priced hours, in both steady-state and transient conditions. Building on this groundwork, this study bridges the gaps in optimal sizing of the sub-system of TES-coupled AR systems using Risk Analysis Virtual Environment (RAVEN) and Holistic Energy Resource Optimization Network (HERON), INL?s framework for grid optimization. By applying this framework, we present statistically-robust optimal charge, discharge including balance of plant (BOP), and storage sizing for the High-Temperature Gas-Cooled Reactor (HTGR) with 203 MWth output. To this end, we generated synthetic price samples for 30 years using 2018 ? 2021 real-time market data from ERCOT, PJM and MISO. Our results reveals that the TES-coupled HTGR system is highly effective in maximizing revenue from electricity sales. We observed a substantial increase of 40 % in ERCOT and a noteworthy 15 % increase in PJM and MISO when compared to the conventional BOP without TES. This improvement is achieved through regionally-tailored sub-system sizing, which ranges from 398 to 416 MWth for the discharge system and 610 to 1029 MWth for the TES. We find that the average electricity price directly impacts the overall economics, while price volatility influences storage size. Additional sensitivity analyses were performed to access the impact of key assumptions on system economics and sizing, differentiating the optimization window (i.e., 24 ? 219 hours of chronological observations) and by imposing storage continuity condition in tracking TES cycles. We observed that at the 120-hour of the optimization window, a reasonable balance between computation time and accuracy was achieved. Our analysis also highlights the significance of conducting multi-day cycle analysis (> 120-hour) for TES to capture interaction between electricity prices and storage dynamics, providing a comprehensive understanding of TES behavior that AR developers should integrate into their plant designs.

25 ENERGY STORAGE↗

Monaco treatment planning system tools and optimization processes

The Monaco treatment planning system combines Monte Carlo dose calculation accuracy with robust optimization tools to provide high-quality radiotherapy treatment plans for three-dimensional conformal radiotherapy (3D CRT), intensity modulated radiotherapy (IMRT), volumetric modulated arc therapy (VMAT), stereotactic radiosurgery (SRS), and stereotactic body radiotherapy (SBRT). Recent technology advances have allowed for fast calculation speeds, which allow clinicians and patients to benefit from the accuracy of the Monte Carlo algorithm while reducing overall planning time. A collection of biological and physical dose-based planning tools and templates simplify the planning process and allow for consistent results across organizations. At the same time, multicriteria optimization (MCO) ensures critical organs are spared to the greatest possible degree while maintaining target coverage. Monaco encompasses a full suite of treatment modalities, including conventional radiotherapy and particle therapy, and is paving the way for real-time adaptive treatments with developments in magnetic resonance (MR)-guided radiation therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Large-Scale Optimization for Bayesian Inference in Complex Systems

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focused on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. The project was a collaborative effort among MIT, the University of Texas at Austin, Georgia Institute of Technology, and Sandia National Laboratories. The research was directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. The MIT₋Sandia component of the SAGUARO Project addressed the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas₋Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to-observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as "reduce then sample" and "sample then reduce." In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.

97 MATHEMATICS AND COMPUTING↗

Dispatchability Maximization for Co-Optimized Energy and Reserve Dispatch With Explicit Reliability Guarantee

In this paper, we consider dispatchability as the set of all admissible nodal wind power injections that will not cause infeasibility in real-time dispatch (RTD). Our work reveals that the dispatchability of the affine policy based RTD (AF-RTD) is a polytope whose coefficients are linear functions of the generation schedule and the gain matrix of affine policy. Two mathematical formulations of the dispatchability maximized energy and reserve dispatch (DM-ERD) are proposed. The first one maximizes the distance from the forecast to the boundaries of the dispatchability polytope subject to the available production cost or reserve cost. Provided the forecast value and variance of wind power, the generalized Gauss inequality (GGI) is adopted to evaluate the probability of infeasible RTD without the exact probability distribution of wind power. Combining the first formulation and the GGI approach, the second one minimizes the total cost subject to a desired reliability level through dispatchability maximization. Efficient convex optimization based algorithms are developed to solve these two models. Different from the conventional robust optimization method, our model does not rely on the specific uncertainty set of wind generation and directly optimizes the uncertainty accommodation capability of the power system. The proposed method is also compared with the affine policy based robust energy and reserve dispatch (AR-ERD). Case studies on the PJM 5-bus system illustrate the proposed concept and method. Experiments on the IEEE 118-bus system demonstrate the applicability of our method on moderate sized systems and its scalability to large dimensional uncertainty.

17 WIND ENERGY↗

Robust Passification via Optimal Sensor Blending and Control Allocation

Robust passification is considered for uncertain linear, time invariant, systems having redundant actuators and sensors. The approach is to obtain optimal sensor blending and control allocation matrices that maximize the region in the parameter space in which the system remains passive. The approach results in a generalized eigenvalue problem consisting of a number of linear matrix inequalities (LMIs). Reduction of the number of LMIs is investigated, and a numerical example is given for demonstrating the approach.

Joshi, S. M.↗

Robust Passification via Optimal Sensor Blending and Control Allocation

Robust passification is considered for uncertain linear, time invariant systems having redundant actuators and sensors. The approach is to obtain optimal sensor blending and control allocation matrices that maximize the region in the parameter space in which the system remains passive. The approach results in a generalized eigenvalue problem consisting of a number of linear matrix inequalities (LMIs). Reduction of the number of LMIs is investigated, and a numerical example is given for demonstrating the approach.

Joshi, S. M.↗

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗

SU-D-202-01: Functional Lung Avoidance and Response-Adaptive Escalation (FLARE) RT: Feasibility of a Precision Radiation Oncology Strategy

Purpose: NSCLC patient RT is planned without consideration of spatial heterogeneity in lung function or tumor response, which may have contributed to failed uniform dose escalation in a randomized trial. The feasibility of functional lung avoidance and response-adaptive escalation (FLARE) RT to reduce dose to [{sup 99m}Tc]MAA-SPECT/CT perfused lung while redistributing 74Gy within [{sup 18}F]FDG-PET/CT biological target volumes was assessed. Methods: Eight Stage IIB–IIIB NSCLC patients underwent FDG-PET/CT and MAA-SPECT/CT treatment planning scans. Perfused lung objectives were derived from scatter/collimator/attenuation-corrected MAA-SPECT uptake relative to ITV-subtracted lung to maintain <20Gy mean lung dose (MLD). Prescriptions included 60Gy to PTV and concomitant boost of 74Gy mean to biological target volumes (BTV=GTV+PET margin) scaled to each BTV voxel by relative FDG-PET SUV. Dose-painting-by-numbers prescriptions were integrated into commercial TPS via previously reported ROI discretization. Dose constraints for lung, heart, cord, and esophagus were defined. FLARE RT plans were optimized with VMAT, proton pencil beam scanning (PBS) with 3%-3mm robust optimization, and combination PBS (avoidance) plus VMAT (escalation). Dosimetric differences were evaluated by Friedman non-parametric paired test with multiple sampling correction. Results: PTV and normal tissue objectives were not violated in 24 FLARE RT plans. Population median of mean BTV dose was 73.7Gy (68.5–75.5Gy), mean FDG-PET peak dose was 89.7Gy (73.5–103Gy), MLD was 12.3Gy (7.5–19.6Gy), and perfused MLD was 4.8Gy (0.9–12.1Gy). VMAT achieved higher dose to the FDG-PET peak subvolume (p=0.01), while PBS delivered lower dose to lung (p<0.001). Voxelwise linear correlation between BTV dose and FDG-PET uptake was higher for VMAT (R=0.93) and PBS+VMAT (R=0.94) compared to PBS alone (R=0.89). Conclusion: FLARE RT is feasible with VMAT and PBS. A combination of PBS for functional lung avoidance and VMAT for FDG-PET dose escalation balances target/normal tissue objective tradeoffs. These results support future testing of FLARE RT safety and efficacy within a precision radiation oncology trial. This work was supported by a Research Scholar grant from the Radiological Society of North American Research & Education Foundation.

60 APPLIED LIFE SCIENCES↗

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗

Examination of Unified Control Approaches Incorporating Generalized Control Allocation

Transition vehicles which combine vertical take off and landing with cruise configurations pose a unique challenge for control design and implementation. For this class of vehicle, successful control designs have historically broken the flight envelope into phases and modified the control approach for each phase. This research approaches control in a unified way across the entire envelope using a robust optimal design which provides effector weighting then implemented in a generalized Affine Generalized Inverse control allocation algorithm. System performance for a Lift plus Cruise transition vehicle is presented.

unified control, robust control, optimal control, ↗

Large-Scale Optimization for Bayesian Inference in Complex Systems (Final Report)

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focuses on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. Our research is directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. Our efforts are integrated in the context of a challenging testbed problem that considers subsurface reacting flow and transport. The MIT component of the SAGUARO Project addresses the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas-Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to- observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as "reduce then sample" and "sample then reduce." In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.

97 MATHEMATICS AND COMPUTING↗