Search

We propose a hidden convexity-based method to address distributed optimal energy flow (OEF) problems for transmission-level integrated electricity-gas systems. First, we develop a node-wise decoupling method to de-compose an OEF problem into multiple OEF subproblems. Then, we propose a hidden convexity-based method to equivalently reformulate nonconvex OEF subproblems as semi-definite programs. This method differs from any ap-proximation and convexification methods that may incur infeasible solutions. Since all OEF subproblems are origi-nally convex or equivalently convexified, we adopt an ADMM to solve the hidden convexity-based distributed OEF problem with convergence analysis. Test results validate the effectiveness of the proposed method, especially in handling a large number of agents., Comment: 7 pages

This paper adopts a two-stage sample robust optimization (SRO) model to address the wind power penetrated unit commitment optimal energy flow (UC-OEF) problem for IEGSs. The two-stage SRO model can be approximately transformed into a computationally efficient form. Specifically, we employ linear decision rules to simplify the proposed UC-OEF model. Moreover, we further enhance the tractability of the simplified model by exploring its structural features and, accordingly, develop a solution method., Comment: 10 pages

Ice storms, known for their severity and predictability, necessitate proactive resilience enhancement in power systems. Traditional approaches often overlook the endogenous uncertainties inherent in human decisions and underutilize predictive information like forecast accuracy and preparation time. To bridge these gaps, we proposed a two-stage risk-informed decision-dependent resilience planning (RIDDRP) for transmission systems against ice storms. The model leverages predictive information to optimize resource allocation, considering decision-dependent line failure uncertainties introduced by planning decisions and exogenous ice storm-related uncertainties. We adopt a dual-objective approach to balance economic efficiency and system resilience across both normal and emergent conditions. The first stage of the RDDIP model makes line hardening decisions, as well as the optimal sitting and sizing of energy storage. The second stage evaluates the risk-informed operation costs, considering both pre-event preparation and emergency operations. Case studies demonstrate the model's ability to leverage predictive information, leading to more judicious investment decisions and optimized utilization of dispatchable resources. We also quantified the impact of different properties of predictive information on resilience enhancement. The RIDDRP model provides grid operators and planners valuable insights for making risk-informed infrastructure investments and operational strategy decisions, thereby improving preparedness and response to future extreme weather events.

When deploying fast charging stations (FCSs) to support long-distance trips of electric vehicles (EVs), there exist indirect network effects: while the gradual diffusion of EVs directly influences the timing and capacities of FCS allocation, the decisions for FCS allocations, in turn, impact the drivers' willingness to adopt EVs. This interplay, if neglected, can result in uncovered EVs and security issues on the grid side and even hinder the effective diffusion of EVs. In this paper, we explicitly incorporate this interdependence by quantifying EV adoption rates as decision-dependent uncertainties (DDUs) using decision-dependent ambiguity sets (DDASs). Then, a two-stage decision-dependent distributionally robust FCS planning (D$^3$R-FCSP) model is developed for adaptively deploying FCSs with on-site sources and expanding the coupled distribution network. A multi-period capacitated arc cover-path cover (MCACPC) model is incorporated to capture the EVs' recharging patterns to ensure the feasibility of FCS locations and capacities. To resolve the nonlinearity and nonconvexity, the D$^3$R-FCSP model is equivalently reformulated into a single-level mixed-integer linear programming by exploiting its strong duality and applying the McCormick envelope. Finally, case studies highlight the superior out-of-sample performances of our model in terms of security and cost-efficiency. Furthermore, the byproduct of accelerated EV adoption through an implicit positive feedback loop is highlighted.

False data injection (FDI) cyber-attacks on power systems can be prevented by strategically selecting and protecting a sufficiently large measurement subset, which, however, requires adequate cyber-defense resources for measurement protection. With any given cyber-defense resource, this paper proposes a preventive-corrective cyber-defense strategy, which minimizes the FDI attack-induced region in a preventive manner, followed by maximizing the cybersecurity margin in a corrective manner. First, this paper proposes a preventive cyber-defense strategy that minimizes the volume of the FDI attack-induced region via preventive allocation of any given measurement protection resource. Particularly, a sufficient condition for constructing the FDI unattackable lines is proposed, indicating that the FDI cyber-attack could be locally rather than globally prevented. Then, given a non-empty FDI attack-induced region, this paper proposes a corrective cyber-defense strategy that maximizes the cybersecurity margin, leading to a trade-off between the safest-but-expensive operation point (i.e., Euclidean Chebyshev center) and the cheapest-but-dangerous operation point. Simulation results on a modified IEEE 14 bus system verify the effectiveness and cost-effectiveness of the proposed preventive-corrective cyber-defense strategy.

To figure out the stability issues brought by renewable energy sources (RES) with non-Gaussian uncertainties in isolated microgrids, this paper proposes a chance constrained stability constrained optimal power flow (CC-SC-OPF) model. Firstly, we propose a bi-level optimization problem, of which the upper level aims to minimize the expected generation cost without violating the stability chance constraint; the lower level concerns about the stability index given by a semi-definite program (SDP). Secondly, we apply the Gaussian mixture model (GMM) to handle the non-Gaussian RES uncertainties and introduce analytical sensitivity analysis to reformulate chance constraints with respect to stability index and operational variables into linear deter-ministic versions. By incorporating linearized constraints, the bi-level model can be efficiently solved by Benders decomposition-based approach. Thirdly, we design a supplementary corrective countermeasure to compensate the possible control error caused by the linear approximation. Simulation results on the 33-bus microgrid reveal that compared to benchmarking approaches, the proposed model converges 30 times faster with more accurate solutions.

In this letter, we analytically investigate the sensitivity of stability index to its dependent variables in general power systems. Firstly, we give a small-signal model, the stability index is defined as the solution to a semidefinite program (SDP) based on the related Lyapunov equation. In case of stability, the stability index also characterizes the convergence rate of the system after disturbances. Then, by leveraging the duality of SDP, we deduce an analytical formula of the stability sensitivity to any entries of the system Jacobian matrix in terms of the SDP primal and dual variables. Unlike the traditional numerical perturbation method, the proposed sensitivity evaluation method is more accurate with a much lower computational burden. This letter applies a modified microgrid for comparative case studies. The results reveal the significant improvements on the accuracy and computational efficiency of stability sensitivity evaluation.

Cascading failure causes a major risk to society currently. To effectively mitigate the risk, dynamic thermal rating (DTR) technique can be applied as a cost-effective strategy to exploit potential transmission capability. From the perspectives of service life and Braess paradox, it is important and challenging to jointly optimize the DTR placement and operation schedule for changing system state, which is a two-stage combinatorial problem with only discrete variables, suffering from no approximation guarantee and dimension curse only based on traditional models. Thus, the present work proposes a novel two-stage submodular optimization (TSSO) of DTR for risk mitigation considering placement and operation schedule. Specifically, it optimizes DTR placement with proper redundancy in first stage, and then determines the corresponding DTR operation for each system state in second stage. Under the condition of the Markov and submodular features in sub-function of risk mitigation, the submodularity of total objective function of TSSO can be proven for the first time. Based on this, a state-of-the-art efficient solving algorithm is developed that can provide a better approximation guarantee than previous studies by coordinating the separate curvature and error form. The performance of the proposed algorithms is verified by case results.

When performing the resilience enhancement for distribution networks, there are two obstacles to reliably model the uncertain contingencies: 1) decision-dependent uncertainty (DDU) due to various line hardening decisions, and 2) distributional ambiguity due to limited outage information during extreme weather events (EWEs). To address these two challenges, this paper develops scenario-wise decision-dependent ambiguity sets (SWDD-ASs), where the DDU and distributional ambiguity inherent in EWE-induced contingencies are simultaneously captured for each possible EWE scenario. Then, a two-stage trilevel decision-dependent distributionally robust resilient enhancement (DD-DRRE) model is formulated, whose outputs include the optimal line hardening, distributed generation (DG) allocation, and proactive network reconfiguration strategy under the worst-case distributions in SWDD-ASs. Subsequently, the DD-DRRE model is equivalently recast to a mixed-integer linear programming (MILP)-based master problem and multiple scenario-wise subproblems, facilitating the adoption of a customized column-and-constraint generation (C&CG) algorithm. Finally, case studies demonstrate a remarkable improvement in the out-of-sample performance of our model, compared to its prevailing stochastic and robust counterparts. Moreover, the potential values of incorporating the ambiguity and distributional information are quantitatively estimated, providing a useful reference for planners with different budgets and risk-aversion levels.

In this paper, we discuss a class of two-stage hierarchical games with multiple leaders and followers, which is called Nash-Stackelberg-Nash (N-S-N) games. Particularly, we consider N-S-N games under decision-dependent uncertainties (DDUs). DDUs refer to the uncertainties that are affected by the strategies of decision-makers and have been rarely addressed in game equilibrium analysis. In this paper, we first formulate the N-S-N games with DDUs of complete ignorance, where the interactions between the players and DDUs are characterized by uncertainty sets that depend parametrically on the players' strategies. Then, a rigorous definition for the equilibrium of the game is established by consolidating generalized Nash equilibrium and Pareto-Nash equilibrium. Afterward, we prove the existence of the equilibrium of N-S-N games under DDUs by applying Kakutani's fixed-point theorem. Finally, an illustrative example is provided to show the impact of DDUs on the equilibrium of N-S-N games.

This letter proposes a data-driven sparse polynomial chaos expansion-based surrogate model for the stochastic economic dispatch problem considering uncertainty from wind power. The proposed method can provide accurate estimations for the statistical information (e.g., mean, variance, probability density function, and cumulative distribution function) for the stochastic economic dispatch solution efficiently without requiring the probability distributions of random inputs. Simulation studies on an integrated electricity and gas system (IEEE 118-bus system integrated with a 20-node gas system are presented, demonstrating the efficiency and accuracy of the proposed method compared to the Monte Carlo simulations., Comment: Accepted by IEEE Transactions on Power Systems for future publication

Energy storage is expected to play an increasingly important role in mitigating variations that come along with the growing penetration of renewable energy. In this paper, we study the optimal bidding of an energy storage unit in a semi-centralized market. The energy storage unit offers its available storage capacity and maximum charging/discharging rate to the operator; then the operator clears the real-time market by minimizing the total cost. The energy storage unit is paid/charged at locational marginal price (LMP). The problem casts down to a bilevel optimization problem with a mixed-integer lower-level. An improved surrogate-based method with the combined spatial-temporal entropy term is developed to solve this problem. Numerical examples demonstrate the scalability, efficiency, and accuracy of the proposed method., Comment: 5 pages, 5 figures

Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy between different agencies. This paper proposes an extended convex hull based method to address optimal energy flow problems for the integrated electricity and gas systems in a distributed manner. First, a multi-block electricity-gas system model is constructed by dividing the whole system into N blocks considering both physical and regional differences. This multi-block model is then convexified by replacing the nonconvex gas transmission equation with the extended convex hullbased constraints. The Jacobi-Proximal alternating direction method of multipliers algorithm is adopted to solve the convexified model and minimize its operation cost. Finally, the feasibility of the optimal solution for the convexified model is checked, and a sufficient condition is developed. If the sufficient condition is satisfied, the optimal solution for the original nonconvex problem can be recovered from that for the convexified problem. Simulation results demonstrate that the proposed method is tractable and effective in obtaining feasible optimal solutions for multi-block optimal energy flow problems.

The increasing extreme weather events poses unprecedented challenges on power system operation because of their uncertain and sequential impacts on power systems. This paper proposes the concept of an extended steady-state security region (ESSR), and resilience enhancement for transmission systems based on ESSR in consideration of uncertain varying topology changes caused by the extreme weather events is implemented. ESSR is a ploytope describing a region, in which the operating points are within the operating constraints. In consideration of uncertain varying topology changes with ESSR, the resilience enhancement problem is built as a bilevel programming optimization model, in which the system operators deploy the optimal strategy against the most threatening scenario caused by the extreme weather events. To avoid the curse of dimensionality with regard to system topologies for a large scale system, the Monte Carlo method is used to generate uncertain system topologies, and a recursive McCormick envelope-based approach is proposed to connect generated system topologies to optimization variables. Karush Kuhn Tucker (KKT) conditions are used to transform the suboptimization model in the second level into a group of equivalent constraints in the first level. A simple test system and IEEE 118-bus system are used to validate the proposed.

Network reconfiguration is an effective strategy for different purposes of distribution systems (DSs), e.g., resilience enhancement. In particular, DS automation, distributed generation integration and microgrid (MG) technology development, etc., are empowering much more flexible reconfiguration and operation of the system, e.g., DSs or MGs with flexible boundaries. However, the formulation of DS reconfiguration-related optimization problems to include those new flexibilities is non-trivial, especially for the issue of topology, which has to be radial. That is, existing methods of formulating radiality constraints can cause underutilization of DS flexibilities. Thus, this work proposes a new method for radiality constraints formulation fully enabling the topological and some other related flexibilities of DSs, so that the reconfiguration-related optimization problems can have extended feasibility and enhanced optimality. Graph-theoretic supports are provided to certify its theoretical validity. As integer variables are involved, we also analyze the tightness and compactness issues. The proposed radiality constraints are specifically applied to post-disaster MG formation, which is involved in many DS resilience-oriented service restoration and/or infrastructure recovery problems. The resulting new MG formation model, which allows more flexible merge and/or separation of sub-grids, etc., establishes superiority over the models in the literature. Case studies are conducted on two test systems.

Because failures in distribution systems caused by extreme weather events directly result in consumers' outages, this paper proposes a state-based decision-making model with the objective of mitigating loss of load to improve the distribution system resilience throughout the unfolding events. The sequentially uncertain system states, e.g., feeder line on/off states, driven by the unfolding events are modeled as Markov states, and the probabilities from one Markov state to another Markov state throughout the unfolding events are determined by the component failure caused by the unfolding events. A recursive optimization model based on Markov decision processes (MDP) is developed to make state-based actions, i.e., system reconfiguration, at each decision time. To overcome the curse of dimensionality caused by enormous states and actions, an approximate dynamic programming (ADP) approach based on post-decision states and iteration is used to solve the proposed MDP-based model. IEEE 33-bus system and IEEE 123-bus system are used to validate the proposed model.

Repair crews (RCs) and mobile power sources (MPSs) are critical resources for distribution system (DS) outage management after a natural disaster. However, their logistics is not well investigated. We propose a resilient scheme for disaster recovery logistics to co-optimize DS restoration with dispatch of RCs and MPSs. A novel co-optimization model is formulated to route RCs and MPSs in the transportation network, schedule them in the DS, and reconfigure the DS for microgrid formation coordinately, etc. The model incorporates different timescales of DS restoration and RC/MPS dispatch, the coupling of transportation and power networks, etc. To ensure radiality of the DS with variable physical structure and MPS allocation, we also model topology constraints based on the concept of spanning forest. The model is convexified equivalently and linearized into a mixed-integer linear programming. To reduce its computation time, preprocessing methods are proposed to pre-assign a minimal set of repair tasks to depots and reduce the number of candidate nodes for MPS connection. Resilient recovery strategies thus are generated to enhance service restoration, especially by dynamic formation of microgrids that are powered by MPSs and topologized by repair actions of RCs and network reconfiguration of the DS. Case studies demonstrate the proposed methodology.

Direct current (DC) network has been recognized as a promising technique, especially for shipboard power systems (SPSs). Fast resilience control is required for an SPS to survive after faults. Towards this end, this paper proposes the indices of survivability and functionality, based on which a two-phase resilience control method is derived. The on/off status of loads are determined in the first phase to maximize survivability, while the functionality of supplying loads are maximized in the second phase. Based on a comprehensive model of a DC shipboard power systems (DC-SPS), the two-phase method renders two mixed-integer non-convex problems. To make the problems tractable, we develop second-order-cone-based convex relaxations, thus converting the problems into mixed-integer convex problems. Though this approach does not necessarily guarantee feasible, hence global, solutions to the original non-convex formulations, we provide additional mild assumptions, which ensures that the convex relaxations are exact when line constraints are not binding. In the case of inexactness, we provide a simple heuristic approach to ensure feasible solutions. Numerical tests empirically confirm the efficacy of the proposed method.

This paper proposes a dynamic game-based maintenance scheduling mechanism for the asset owners of the natural gas grid and the power grid by using a bilevel approach. In the upper level, the asset owners of the natural gas grid and the power grid schedule maintenance to maximize their own revenues. This level is modeled as a dynamic game problem, which is solved by the backward induction algorithm. In the lower level, the independent system operator (ISO) dispatches the system to minimize the loss of power load and natural gas load in consideration of the system operating conditions under maintenance plans from the asset owners in the upper level. This is modeled as a mixed integer linear programming problem. For the model of the natural gas grid, a piecewise linear approximation associated with the big-M approach is used to transform the original nonlinear model into the mixed integer linear model. Numerical tests on a 6-bus system with a 4-node gas grid show the effectiveness of the proposed model., Comment: accepted by IEEE Transactions on Power Systems

Whereas maintenance has been recognized as an important and effective means for risk management in power systems, it turns out to be intractable if cascading blackout risk is considered due to the extremely high computational complexity. In this paper, based on the inference from the blackout simulation data, we propose a methodology to efficiently identify the most influential component(s) for mitigating cascading blackout risk in a large power system. To this end, we first establish an analytic relationship between maintenance strategies and blackout risk estimation by inferring from the data of cascading outage simulations. Then we formulate the component maintenance decision-making problem as a nonlinear 0-1 programming. Afterwards, we quantify the credibility of blackout risk estimation, leading to an adaptive method to determine the least required number of simulations, which servers as a crucial parameter of the optimization model. Finally, we devise two heuristic algorithms to find approximate optimal solutions to the model with very high efficiency. Numerical experiments well manifest the efficacy and high efficiency of our methodology.

Autonomous vehicles (AVs) will revolutionarize ground transport and take a substantial role in the future transportation system. Most AVs are likely to be electric vehicles (EVs) and they can participate in the vehicle-to-grid (V2G) system to support various V2G services. Although it is generally infeasible for EVs to dictate their routes, we can design AV travel plans to fulfill certain system-wide objectives. In this paper, we focus on the AVs looking for parking and study how they can be led to appropriate parking facilities to support V2G services. We formulate the Coordinated Parking Problem (CPP), which can be solved by a standard integer linear program solver but requires long computational time. To make it more practical, we develop a distributed algorithm to address CPP based on dual decomposition. We carry out a series of simulations to evaluate the proposed solution methods. Our results show that the distributed algorithm can produce nearly optimal solutions with substantially less computational time. A coarser time scale can improve computational time but degrade the solution quality resulting in possible infeasible solution. Even with communication loss, the distributed algorithm can still perform well and converge with only little degradation in speed., Comment: 10 pages, submitted for publication