Distributionally-robust chance constrained and interval optimization for integrated electricity and natural gas systems optimal power flow with wind uncertainties
Not Available
SEARCH · Search NASA
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.
Not Available
The integration of renewable energy sources into power grids through inverter-based resources (IBRs) reduces system inertia, leading to faster frequency dynamics and potential grid instability. This paper proposes a distributed, consensus-based approach for the real-time control and optimization of inertia sources during system disturbances, enhancing both system stability and economic performance. Furthermore, we integrate this approach with the traditional inertia placement problem, demonstrating its suitability for existing frameworks. We validate its effectiveness in a 4-bus test system and a two-area 8-bus test system, showcasing its potential for scalable, dynamic inertia management in low-inertia grids.
Our work investigates distributed control and incentive mechanisms to coordinate distributed energy resources (DERs) with both continuous and discrete decision variables as well as device dynamics in distribution grids. We formulate a multi-period social welfare maximization problem, and based on its convex relaxation propose a distributed stochastic dual gradient algorithm for managing DERs. Moreover, we extend it to an online realtime setting with time-varying operating conditions, asynchronous updates by devices, and feedback being leveraged to account for nonlinear power flows as well as reduce communication overhead. The resulting algorithm provides a general online stochastic optimization algorithm for coordinating networked DERs with discrete power setpoints and dynamics to meet operational and economic objectives and constraints. We characterize the convergence of the algorithm analytically and evaluate its performance numerically.
This article formulates a time-varying social-welfare maximization problem for distribution grids with distributed energy resources (DERs) and develops online distributed algorithms to identify (and track) its solutions. In the considered setting, network operator and DER-owners pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. The proposed algorithm affords an online implementation to enable tracking of the solutions in the presence of time-varying operational conditions and changing optimization objectives. It involves a strategy where the network operator collects voltage measurements throughout the feeder to build incentive signals for the DER-owners in real time; DERs then adjust the generated/consumed powers in order to avoid the violation of the voltage constraints while maximizing given objectives. Stability of the proposed schemes is analytically established and numerically corroborated.
Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with $n$ = 14–23 qubits and depth parameter $p$ ≤ 12 and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. Furthermore, we describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term $T$ ~ $C$ min /$n$ $\sqrt{p}$, with $C$ min the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.
Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.
In an isolated power system (rural microgrid), Distributed Energy Resources (DERs) such as renewable energy resources (wind, solar), energy storage and demand response can be used to complement fossil fueled generators. The uncertainty and variability due to high penetration of wind makes reliable system operations and controls challenging. In this paper, an optimal control strategy is proposed to coordinate energy storage and diesel generators to maximize wind penetration while maintaining system economics and normal operation. The problem is formulated as a multi-objective optimization problem with the goals of minimizing fuel costs and changes in power output of diesel generators, minimizing costs associated with low battery life of energy storage and maintaining system frequency at the nominal operating value. Two control modes are considered for controlling the energy storage to compensate either net load variability or wind variability. Model predictive control (MPC) is used to solve the aforementioned problem and the performance is compared to an open-loop look-ahead dispatch problem. Simulation studies using high and low wind profiles, as well as, different MPC prediction horizons demonstrate the efficacy of the closed-loop MPC in compensating for uncertainties in wind and demand.
Across a variety of scientific disciplines, sparse inverse covariance estimation is a popular tool for capturing the underlying dependency relationships in multivariate data. Unfortunately, most estimators are not scalable enough to handle the sizes of modern high-dimensional data sets (often on the order of terabytes), and assume Gaussian samples. To address these deficiencies, we introduce HP-CONCORD, a highly scalable optimization method for estimating a sparse inverse covariance matrix based on a regularized pseudolikelihood framework, without assuming Gaussianity. Our parallel proximal gradient method uses a novel communication-avoiding linear algebra algorithm and runs across a multi-node cluster with up to 1k nodes (24k cores), achieving parallel scalability on problems with up to ≈819 billion parameters (1.28 million dimensions); even on a single node, HP-CONCORD demonstrates scalability, outperforming a state-of-the-art method. We also use HP-CONCORD to estimate the underlying dependency structure of the brain from fMRI data, and use the result to identify functional regions automatically. The results show good agreement with a clustering from the neuroscience literature.
Across a variety of scientific disciplines, sparse inverse covariance estimation is a popular tool for capturing the underlying dependency relationships in multivariate data. Unfortunately, most estimators are not scalable enough to handle the sizes of modern high-dimensional data sets (often on the order of terabytes), and assume Gaussian samples. To address these deficiencies, we introduce HP-CONCORD, a highly scalable optimization method for estimating a sparse inverse covariance matrix based on a regularized pseudolikelihood framework, without assuming Gaussianity. Our parallel proximal gradient method uses a novel communication-avoiding linear algebra algorithm and runs across a multi-node cluster with up to 1k nodes (24k cores), achieving parallel scalability on problems with up to ~819 billion parameters (1.28 million dimensions); even on a single node, HP-CONCORD demonstrates scalability, outperforming a state-of-the-art method. We also use HP-CONCORD to estimate the underlying dependency structure of the brain from fMRI data, and use the result to identify functional regions automatically. The results show good agreement with a clustering from the neuroscience literature.
Explore the source record for details and available documents.
Conventional optimal power flow (OPF) solvers assume full observability of the involved system states. However in practice, there is a lack of reliable system monitoring devices in the distribution networks. To close the gap between the theoretic algorithm design and practical implementation, this work proposes to solve the OPF problems based on the state estimation (SE) feedback for the distribution networks where only a part of the involved system states are physically measured. The SE feedback increases the observability of the under-measured system and provides more accurate system states monitoring when the measurements are noisy. We analytically investigate the convergence of the proposed algorithm. The numerical results demonstrate that the proposed approach is more robust to large pseudo measurement variability and inherent sensor noise in comparison to the other frameworks without SE feedback.
The planning of district-scale electric grids, i.e., distribution grids, has traditionally relied on finding the most cost-effective design such that they are able to supply the peak loads in a district. With the advent of electric demand side flexibility (DSF), there is the opportunity to reshape peak loads such that the investment cost of the electric grid decreases in exchange for a minor increase in the operation cost. This paper formulates an optimal planning approach for the electric grid at the district scale, which incorporates the DSF from thermal building systems, e.g., heating ventilation and air-conditioning (HVAC) systems. The problem is formulated as a mixed-integer linear program (MILP) and aims at minimizing the investment cost for the grid along with the operation cost of the flexible loads. This is subjected to the fixed electricity demand and thermal comfort constraints of building occupants. To this end, linear models for the thermal comfort in the buildings and the power flow in electric grid are considered. The approach is tested on a district planning test case based in Singapore, where the results show up to 30.9 % reductions in investment cost and up to 3.7 % reduction in total annualized cost. Urban planning authorities, developers and utility companies can all benefit from the presented approach to make optimized investment decisions. For building operators, the results point to the need of adopting their control systems for DSF.
This grant funded a Market and Technology Assessment project which included 1) an analysis of the total addressable market (TAM) for the RT-OPF technology; 2) a segmented assessment of North American utility business models and barriers to adoption of the RT-OPF technology for those models; 3) a validation of DER customer needs and barriers to participation in utility programs; and 4) a forward-looking analysis of utility regulatory innovation and changes that may impact utility business models and ability for utilities to adopt this technology.
Pade spectrum decomposition is an optimal sum-over-poles expansion scheme of Fermi function and Bose function [J. Hu, R. X. Xu, and Y. J. Yan, J. Chem. Phys. 133, 101106 (2010)]. In this work, we report two additional members to this family, from which the best among all sum-over-poles methods could be chosen for different cases of application. Methods are developed for determining these three Pade spectrum decomposition expansions at machine precision via simple algorithms. We exemplify the applications of present development with optimal construction of hierarchical equations-of-motion formulations for nonperturbative quantum dissipation and quantum transport dynamics. Numerical demonstrations are given for two systems. One is the transient transport current to an interacting quantum-dots system, together with the involved high-order co-tunneling dynamics. Another is the non-Markovian dynamics of a spin-boson system.
How to manage wind power uncertainty in system operation is an urgent and important issue, especially under substantially increasing penetration levels of wind generation in electric power systems. With increasing numbers of wind power plants (WPPs) integrated into power systems, their variability and uncertain power outputs become a challenge to maintaining system reliability. Traditional stochastic optimization-based models face the curse of dimensionality when the number of WPPs increases. This paper proposes a novel decentralized wind power uncertainty management model. In this model, conventional generators optimize their power capacity output and their participation to mitigate wind power uncertainty locally with only limited information exchange with the system operators. First, a distributionally-robust chance-constrained optimal power flow (DRCC-OPF) model is deployed to schedule the generation and reserve considering the wind power forecast uncertainty. Then, the alternating direction method of multipliers (ADMM) is used to reformulate the DRCC-OPF model into the distributed optimization model for each conventional generator and WPP. The tests on a small PJM 5-bus system and the IEEE 118-bus system demonstrate that the proposed decentralized model can increase the operation reliability without sacrificing system operating cost, especially when the wind power penetration levels are high. Using the proposed model, the optimal solutions can be obtained within one minute, for all studied cases, which verifies the computation efficiency of the proposed decentralized model. Furthermore, considering a large number of WPPs integrated into the system, the proposed decentralized method obtains a lower operating cost within one minute which demonstrates its efficiency to deal with high dimension of uncertainties.
This paper proposes a novel method to co-optimize the distribution system operation and repair crew routing for outage restoration after extreme weather events. A two-stage stochastic mixed integer linear program is developed. The first stage is to dispatch the repair crews to the damaged components. The second stage is distribution system restoration using distributed generators, and reconfiguration. We consider demand uncertainty in terms of a truncated normal forecast error distribution, and model the uncertainty of the repair time using a lognormal distribution. A new decomposition approach, combined with the progressive hedging algorithm, is developed for solving large-scale outage management problems in an effective and timely manner. Furthermore, the proposed method is validated on modified IEEE 34- and 8500-bus distribution test systems.
Addition of small amounts of water to the organic solvent may result in different promoting or inhibiting effects in aldol condensation reactions depending on the distribution of active sites on the surface. In a combination of liquid-phase catalytic activity measurements, spectroscopies and theoretical calculations, we have shown that water clusters around the acid site can form bridges with a ketone molecule located close to the activated carbonyl, on another site. When the distance between the two acid sites is greater than a distance corresponding to about 2 water molecules, the efficiency of the bond polarization of the ketone by a remotely located acid site decreases significantly, and the presence of water no longer promotes the reaction. Furthermore, this work provides a quantitative assessment of how solvent molecules can bridge isolated active sites to enable cooperative catalysis, which offers an additional dimension for engineering catalysis at the nanoscale.