Search NASA⌕ Search

SEARCH · Search NASA

Results for “Chance-constrained programming”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs

A lower bound for a finite-scenario-based chance-constrained program is the quantile value corresponding to the sorted optimal objective values of scenario subproblems. This quantile bound can be improved by grouping subsets of scenarios at the expense of solving larger subproblems. The quality of the bound depends on how the scenarios are grouped. In this paper, we formulate a mixed-integer bilevel program that optimally groups scenarios to tighten the quantile bounds. For general chance-constrained programs, we propose a branch-and-cut algorithm to optimize the bilevel program, and for chance-constrained linear programs, a mixed-integer linear-programming reformulation is derived. Here, we also propose several heuristics for grouping similar or dissimilar scenarios. Our computational results demonstrate that optimal grouping bounds are much tighter than heuristic bounds, resulting in smaller root-node gaps and better performance of scenario decomposition for solving chance-constrained 0-1 programs. Also, the optimal grouping bounds can be greatly strengthened using larger group size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants

Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. In this paper, we decide HVAC control schedules under uncertain PV generation, using a distributionally robust chance-constrained (DRCC) building load control model under two typical ambiguity sets: the moment-based and Wasserstein ambiguity sets. We derive mixed integer linear programming (MILP) reformulations for DRCC problems under both sets. Especially, for the Wasserstein ambiguity set, we use the right-hand side (RHS) uncertainty to derive a more compact MILP reformulation than the commonly known MILP reformulations with big-M constants. All the results also apply to general individual chance constraints with RHS uncertainty. Furthermore, we propose an adjustable chance-constrained variant to achieve tradeoff between the operational risk and costs. We derive MILP reformulations under the Wasserstein ambiguity set and second-order conic programming (SOCP) reformulations under the moment-based set. Using real-world data, we conduct computational studies to demonstrate the efficiency of the solution approaches and the effectiveness of the solutions. Summary of Contribution: The problem studied in this paper is motivated by a building load control problem that uses the aggregation of heating, ventilation, and air conditioning (HVAC) loads as flexible reserves to absorb uncertain solar photovoltaic (PV) generation. The problem is formulated as distributionally robust chance-constrained (DRCC) programs with right-hand side (RHS) uncertainty. In addition, we propose a risk-adjustable variant of the DRCC programs, where the risk level, instead of being predetermined, is treated as a decision variable. The paper aims to provide tractable reformulations and solution algorithms for both the (general) DRCC and the (general) adjustable DRCC models with RHS uncertainty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs

We extend and improve recent results given by Singh and Watson on using classical bounds on the union of sets in a chance-constrained optimization problem. Specifically, we revisit the so-called Dawson and Sankoff bound that provided one of the best approximations of a chance constraint in the previous analysis. Next, we show that our work is a generalization of the previous work, and in fact the inequality employed previously is a very relaxed approximation with assumptions that do not generally hold. Computational results demonstrate on average over a 43% improvement in the bounds. As a byproduct, we provide an exact reformulation of the floor function in optimization models.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2012

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗
DOE OSTI2021

Controlled Islanding Strategy Considering Uncertainty of Renewable Energy Sources Based on Chance-constrained Model

Controlled islanding plays an essential role in preventing the blackout of power systems. Although there are several studies on this topic in the past, not enough attention is paid to the uncertainty brought by renewable energy sources (RESs) that may cause unpredictable unbalanced power and the observability of power systems after islanding that is essential for back-up black-start measures. Therefore, a novel controlled islanding model based on mixed-integer second-order cone and chance-constrained programming (MISOCCP) is proposed to address these issues. First, the uncertainty of RESs is characterized by their possibility distribution models with chance constraints, and the requirements, e. g., system observ-ability, for rapid back-up black-start measures are also considered. Then, a law of large numbers (LLN) based method is employed for converting the chance constraints into deterministic ones and reformulating the non-convex model into convex one. Finally, case studies on the revised IEEE 39-bus and 118-bus power systems as well as the comparisons among different models are given to demonstrate the effectiveness of the proposed model. The results show that the proposed model can result in less unbalanced power and better observability after islanding compared with other models.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A data-driven network optimisation approach to coordinated control of distributed photovoltaic systems and smart buildings in distribution systems

The increasing integration of distributed energy resources, including demand-side resources and distributed photovoltaics (PVs), into distribution systems has resulted in more complicated power system operation. A data-driven network optimisation approach is proposed to coordinate the control of distributed PVs and smart buildings in distribution networks considering the uncertainties of solar power, outdoor temperature and heat gain associated with building thermal dynamics. These uncertain parameters have a significant impact on the operation and control of distributed PVs and smart buildings, bringing challenges to the distribution system operation. In the proposed data-driven distributionally robust optimisation (DRO) approach, the Wasserstein ball is used to construct an ambiguity set for the uncertain parameters, which does not require the probability distributions to be known. Furthermore, a conditional value-at-risk is incorporated into the Wasserstein-based DRO model and converted into a computationally tractable mixed-integer convex optimisation problem. Benchmarked with robust optimisation and chance-constrained programming, the proposed data-driven model can give a less conservative robust solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2013

Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing

A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.

Ono, Masahiro↗
DOE OSTI2022

A shared-mobility-based framework for evacuation planning and operations under forecast uncertainty

To meet evacuation needs from carless populations who need personalized assistance to evacuate safely, in this article we propose a ridesharing-based evacuation program that recruits volunteer drivers before a disaster strikes, and then matches volunteer drivers with evacuees once demand is realized. Here we optimize resource planning and evacuation operations under uncertain spatiotemporal demand, and construct a two-stage stochastic mixed-integer program to ensure high demand fulfillment rates. We consider three formulations to improve the number of evacuees served, by minimizing an expected penalty cost, imposing a probabilistic constraint, and enforcing a constraint on the conditional value at risk of the total number of unserved evacuees, respectively. We discuss the benefits and disadvantages of the different risk measures used in the three formulations, given certain carless population sizes and the variety of evacuation modes available. We also develop a heuristic approach to provide quick, dynamic and conservative solutions. We demonstrate the performance of our approaches using five different networks of varying sizes based on regions of Charleston County, South Carolina, an area that experienced a mandatory evacuation order during Hurricane Florence, and utilize real demographic data and hourly traffic count data to estimate the demand distribution.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2012

A Risk-Constrained Multi-Stage Decision Making Approach to the Architectural Analysis of Mars Missions

This paper presents a novel risk-constrained multi-stage decision making approach to the architectural analysis of planetary rover missions. In particular, focusing on a 2018 Mars rover concept, which was considered as part of a potential Mars Sample Return campaign, we model the entry, descent, and landing (EDL) phase and the rover traverse phase as four sequential decision-making stages. The problem is to find a sequence of divert and driving maneuvers so that the rover drive is minimized and the probability of a mission failure (e.g., due to a failed landing) is below a user specified bound. By solving this problem for several different values of the model parameters (e.g., divert authority), this approach enables rigorous, accurate and systematic trade-offs for the EDL system vs. the mobility system, and, more in general, cross-domain trade-offs for the different phases of a space mission. The overall optimization problem can be seen as a chance-constrained dynamic programming problem, with the additional complexity that 1) in some stages the disturbances do not have any probabilistic characterization, and 2) the state space is extremely large (i.e, hundreds of millions of states for trade-offs with high-resolution Martian maps). To this purpose, we solve the problem by performing an unconventional combination of average and minimax cost analysis and by leveraging high efficient computation tools from the image processing community. Preliminary trade-off results are presented.

entry, descent, and landing (EDL)↗
DOE OSTI2021

Resilient NdFeB magnet recycling under the impacts of COVID-19 pandemic: Stochastic programming and Benders decomposition

Neodymium-iron-boron (NdFeB) magnets are the most powerful magnets per unit volume sold in the commercial market. Despite the increasing demand for clean energy applications such as electric vehicles and wind turbines, disruptive events including the COVID-19 pandemic have caused significant uncertainties in the supply and demand for NdFeB magnets. Therefore, this study aims to alleviate the risk of supply shortage for NdFeB magnets and the containing critical materials, rare-earth elements (REEs), through the development of a resilient reverse supply chain and logistics network design. We develop scenarios to model the unique impact of the COVID-19 pandemic on the proposed business, incorporating both disruption intensity and recovery rate. We formulate a chance-constrained two-stage stochastic programming model to maximize the profit while guaranteeing the network resiliency against disruption risks. To solve the problem in large-scale instances, we develop an efficient Benders decomposition algorithm that reduces the computational time by 98.5% on average compared to the default CPLEX algorithm. When applied to the United States, the model suggests the optimal facility locations, processing capacities, inventory levels, and material flows for NdFeB magnet recyclers that could meet 99.7% of the demand. To the best of our knowledge, this study is the first to incorporate the impacts of the COVID-19 pandemic to design a resilient NdFeB magnet recycling supply chain and logistics network, leveraging risk-averse stochastic programming.

42 ENGINEERING↗
DOE OSTI2023

Online Model-Free Chance-Constrained Distribution System Voltage Control Using DERs

This paper proposes an online data-driven distributed energy resource management system (DERMS) optimization method using chance-constrained formulation to address distribution system voltage regulation. This is achieved via the local sensitivity factor (LSF)-enabled reformulation of the DER control into a linear programming (LP) problem, which is easy and computationally efficient to solve. The LSF is estimated using online measurements and does not need the assumption of node load information. The latter is usually required for existing optimization-based methods but is difficult to obtain in practice. To mitigate measurement uncertainties, a scenario-based chance-constrained formulation is constructed. Compared with other control methods, the results carried out in a realistic distribution system show that the proposed method can effectively eliminate voltage violation issues.

chance-constrained optimization↗
DOE OSTI2023

Online Model-Free Chance-Constrained Distribution System Voltage Control Using DERs: Preprint

This paper proposes an online data-driven distributed energy resource management system (DERMS) optimization method using chance-constrained formulation to address distribution system voltage regulation. This is achieved via the local sensitivity factor (LSF)-enabled reformulation of the DER control into a linear programming (LP) problem, which is easy and computationally efficient to solve. The LSF is estimated using online measurements and does not need the assumption of node load information. The latter is usually required for existing optimization-based methods but is difficult to obtain in practice. To mitigate measurement uncertainties, a scenario-based chance-constrained formulation is constructed. Compared with other control methods, the results carried out in a realistic distribution system show that the proposed method can effectively eliminate voltage violation issues.

chance-constrained optimization↗
DOE OSTI2022

Rolling Optimization of Transmission Network Recovery and Load Restoration Considering Hybrid Wind-Storage System and Cold Load Pickup

A common solution to deal with the stochasticity introduced by fast-ramping wind power integration is to equip wind farms (WFs) with energy storage systems (ESSs) to formulate hybrid WF-ESSs. In addition to leveling off wind power fluctuations during normal operations, a hybrid WF-ESS can be a flexible power source to accumulate the power system restoration. In this paper, we propose a rolling optimization model for transmission network recovery and load restoration considering the contributions of WF-ESSs. The proposed model is formulated as a mixed integer linear programming problem that simultaneously optimizes the amount and location of restorable load blocks as well as the restoration lines. The cold load pickup features of interrupted loads considering the outage duration are modeled in detail. A chance-constrained method is employed to deal with the uncertainty of wind power, and a rolling horizon-based framework is adopted to reduce the influence of forecast error. Case studies are conducted on both New England 39-bus system and part of a provincial power system in China. The results show that the load restoration process can be significantly accelerated by employing the proposed method and contributions of hybrid WF-ESSs to power system restoration are validated.

chance-constrained optimization↗
DOE OSTI2023

Renewable electricity capacity planning with uncertainty at multiple scales

Abstract We formulate and compare optimization models of investment in renewable generation using a suite of social planning models that compute optimal generation capacity investments for a hydro-dominated electricity system where inflow uncertainty results in a risk of energy shortage. The models optimize the expected cost of capacity expansion and operation allowing for investments in hydro, geothermal, solar, wind, and thermal plant, as well as battery storage for smoothing load profiles. A novel feature is the integration of uncertain seasonal hydroelectric energy supply and short-term variability in renewable supply in a two-stage stochastic programming framework. The models are applied to data from the New Zealand electricity system and used to estimate the costs of moving to a 100% renewable electricity system by 2035. We also explore the outcomes obtained when applying different forms of CO 2 constraint that limit respectively non-renewable capacity, non-renewable generation, and CO 2 emissions on average, almost surely, or in a chance-constrained setting, and show how our models can be used to investigate the merits of a proposed pumped-hydro scheme in New Zealand’s South Island.

Ferris, Michael C.↗
DOE OSTI2024

Online Model-Free DER Dispatch Via Adaptive Voltage Sensitivity Estimation and Chance Constrained Programming

This paper proposes an online data-driven distributed energy resource management system (DERMS) for distribution system optimal DER dispatch as well as voltage regulation. Here, the key innovation is to leverage the Local Sensitivity Factor (LSF) for transforming the DER control into a computationally efficient linear programming (LP) problem. By taking real-time measurements, the estimation of LSF eliminates the need for an accurate distribution system model as well as full nodal load information, which is difficult to achieve in practice. A robust recursive least squares method is also developed to ensure the robust estimation of LSF, which is initialized using reasonable values from model-derived LSFs. This allows the system to adapt to changing operational conditions effectively. A scenario-based, chance-constrained framework is further employed to ensure voltage remains within acceptable limits in the presence of measurement and estimation uncertainties. Test results on a real-world, 759-node distribution network located in western Colorado, U.S., validate the effectiveness and robustness of the proposed control approach and demonstrate its superior performance as compared to alternative methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗