Searcharxiv⌕ Search

arXiv subjects

Spyros Chatzivasileiadis

Publications and source records attributed to Spyros Chatzivasileiadis.

At least 37 records · Page 2Linked to original sources

Global Performance Guarantees for Neural Network Models of AC Power Flow

Machine learning, which can generate extremely fast and highly accurate black-box surrogate models, is increasingly being applied to a variety of AC power flow problems. Rigorously verifying the accuracy of the resulting black-box models, however, is computationally challenging. This paper develops a tractable neural network verification procedure which incorporates the ground truth of the non-linear AC power flow equations to determine worst-case neural network prediction error. Our approach, termed Sequential Targeted Tightening (STT), leverages a loosely convexified reformulation of the original verification problem, which is an intractable mixed integer quadratic program (MIQP). Using the sequential addition of targeted cuts, we iteratively tighten our formulation until either the solution is sufficiently tight or a satisfactory performance guarantee has been generated. After learning neural network models of the 14, 57, 118, and 200-bus PGLib test cases, we compare the performance guarantees generated by our STT procedure with ones generated by a state-of-the-art MIQP solver, Gurobi 11.0. We show that STT often generates performance guarantees which are far tighter than the MIQP upper bound.

eess.SY↗

A hybrid Quantum-Classical Algorithm for Mixed-Integer Optimization in Power Systems

Mixed Integer Linear Programming (MILP) can be considered the backbone of the modern power system optimization process, with a large application spectrum, from Unit Commitment and Optimal Transmission Switching to verifying Neural Networks for power system applications. The main issue of these formulations is the computational complexity of the solution algorithms, as they are considered NP-Hard problems. Quantum computing has been tested as a potential solution towards reducing the computational burden imposed by these problems, providing promising results, motivating the can be used to speedup the solution of MILPs. In this work, we present a general framework for solving power system optimization problems with a Quantum Computer (QC), which leverages mathematical tools and QCs' sampling ability to provide accelerated solutions. Our guiding applications are the optimal transmission switching and the verification of neural networks trained to solve a DC Optimal Power Flow. Specifically, using an accelerated version of Benders Decomposition , we split a given MILP into an Integer Master Problem and a linear Subproblem and solve it through a hybrid ``quantum-classical'' approach, getting the best of both worlds. We provide 2 use cases, and benchmark the developed framework against other classical and hybrid methodologies, to demonstrate the opportunities and challenges of hybrid quantum-classical algorithms for power system mixed integer optimization problems.

quant-ph↗

Optimal Design of Volt/VAR Control Rules of Inverters using Deep Learning

Distribution grids are challenged by rapid voltage fluctuations induced by variable power injections from distributed energy resources (DERs). To regulate voltage, the IEEE Standard 1547 recommends each DER inject reactive power according to piecewise-affine Volt/VAR control rules. Although the standard suggests a default shape, the rule can be customized per bus. This task of optimal rule design (ORD) is challenging as Volt/VAR rules introduce nonlinear dynamics, and lurk trade-offs between stability and steady-state voltage profiles. ORD is formulated as a mixed-integer nonlinear program (MINLP), but scales unfavorably with the problem size. Towards a more efficient solution, we reformulate ORD as a deep learning problem. The idea is to design a DNN that emulates Volt/VAR dynamics. The DNN takes grid scenarios as inputs, rule parameters as weights, and outputs equilibrium voltages. Optimal rule parameters can be found by training the DNN so its output approaches unity for various scenarios. The DNN is only used to optimize rules and is never employed in the field. While dealing with ORD, we also review and expand on stability conditions and convergence rates for Volt/VAR dynamics on single- and multi-phase feeders. Tests showcase the merit of DNN-based ORD by benchmarking it against its MINLP counterpart.

math.OC↗

Bayesian Physics-informed Neural Networks for System Identification of Inverter-dominated Power Systems

While the uncertainty in generation and demand increases, accurately estimating the dynamic characteristics of power systems becomes crucial for employing the appropriate control actions to maintain their stability. In our previous work, we have shown that Bayesian Physics-informed Neural Networks (BPINNs) outperform conventional system identification methods in identifying the power system dynamic behavior under measurement noise. This paper takes the next natural step and addresses the more significant challenge, exploring how BPINN perform in estimating power system dynamics under increasing uncertainty from many Inverter-based Resources (IBRs) connected to the grid. These introduce a different type of uncertainty, compared to noisy measurements. The BPINN combines the advantages of Physics-informed Neural Networks (PINNs), such as inverse problem applicability, with Bayesian approaches for uncertainty quantification. We explore the BPINN performance on a wide range of systems, starting from a single machine infinite bus (SMIB) system and 3-bus system to extract important insights, to the 14-bus CIGRE distribution grid, and the large IEEE 118-bus system. We also investigate approaches that can accelerate the BPINN training, such as pretraining and transfer learning. Throughout this paper, we show that in presence of uncertainty, the BPINN achieves orders of magnitude lower errors than the widely popular method for system identification SINDy and significantly lower errors than PINN, while transfer learning helps reduce training time by up to 80 %.

eess.SY↗

Correctness Verification of Neural Networks Approximating Differential Equations

Verification of Neural Networks (NNs) that approximate the solution of Partial Differential Equations (PDEs) is a major milestone towards enhancing their trustworthiness and accelerating their deployment, especially for safety-critical systems. If successful, such NNs can become integral parts of simulation software tools which can accelerate the simulation of complex dynamic systems more than 100 times. However, the verification of these functions poses major challenges; it is not straightforward how to efficiently bound them or how to represent the derivative of the NN. This work addresses both these problems. First, we define the NN derivative as a finite difference approximation. Then, we formulate the PDE residual bounding problem alongside the Initial Value Problem's error propagation. Finally, for the first time, we tackle the problem of bounding an NN function without a priori knowledge of the output domain. For this, we build a parallel branching algorithm that combines the incomplete CROWN solver and Gradient Attack for termination and domain rejection conditions. We demonstrate the strengths and weaknesses of the proposed framework, and we suggest further work to enhance its efficiency.

eess.SY↗

Error estimation for physics-informed neural networks with implicit Runge-Kutta methods

The ability to accurately approximate trajectories of dynamical systems enables their analysis, prediction, and control. Neural network (NN)-based approximations have attracted significant interest due to fast evaluation with good accuracy over long integration time steps. In contrast to established numerical approximation schemes such as Runge-Kutta methods, the estimation of the error of the NN-based approximations proves to be difficult. In this work, we propose to use the NN's predictions in a high-order implicit Runge-Kutta (IRK) method. The residuals in the implicit system of equations can be related to the NN's prediction error, hence, we can provide an error estimate at several points along a trajectory. We find that this error estimate highly correlates with the NN's prediction error and that increasing the order of the IRK method improves this estimate. We demonstrate this estimation methodology for Physics-Informed Neural Network (PINNs) on the logistic equation as an illustrative example and then apply it to a four-state electric generator model that is regularly used in power system modelling.

physics.comp-ph↗

Physics-Informed Neural Networks for Time-Domain Simulations: Accuracy, Computational Cost, and Flexibility

The simulation of power system dynamics poses a computationally expensive task. Considering the growing uncertainty of generation and demand patterns, thousands of scenarios need to be continuously assessed to ensure the safety of power systems. Physics-Informed Neural Networks (PINNs) have recently emerged as a promising solution for drastically accelerating computations of non-linear dynamical systems. This work investigates the applicability of these methods for power system dynamics, focusing on the dynamic response to load disturbances. Comparing the prediction of PINNs to the solution of conventional solvers, we find that PINNs can be 10 to 1000 times faster than conventional solvers. At the same time, we find them to be sufficiently accurate and numerically stable even for large time steps. To facilitate a deeper understanding, this paper also present a new regularisation of Neural Network (NN) training by introducing a gradient-based term in the loss function. The resulting NNs, which we call dtNNs, help us deliver a comprehensive analysis about the strengths and weaknesses of the NN based approaches, how incorporating knowledge of the underlying physics affects NN performance, and how this compares with conventional solvers for power system dynamics.

eess.SY↗

Quantum Amplitude Estimation for Probabilistic Methods in Power Systems

This paper introduces quantum computing methods for Monte Carlo simulations in power systems which are expected to be exponentially faster than their classical computing counterparts. Monte Carlo simulations is a fundamental method, widely used in power systems to estimate key parameters of unknown probability distributions, such as the mean value, the standard deviation, or the value at risk. It is, however, very computationally intensive. Approaches based on Quantum Amplitude Estimation can offer a quadratic speedup, requiring orders of magnitude less samples to achieve the same accuracy. This paper explains three Quantum Amplitude Estimation methods to replace the Classical Monte Carlo method, namely the Iterative Quantum Amplitude Estimation (IQAE), Maximum Likelihood Amplitude Estimation (MLAE), and Faster Amplitude Estimation (FAE), and compares their performance for three different types of probability distributions for power systems.

quant-ph↗

GPU-Accelerated Verification of Machine Learning Models for Power Systems

Computational tools for rigorously verifying the performance of large-scale machine learning (ML) models have progressed significantly in recent years. The most successful solvers employ highly specialized, GPU-accelerated branch and bound routines. Such tools are crucial for the successful deployment of machine learning applications in safety-critical systems, such as power systems. Despite their successes, however, barriers prevent out-of-the-box application of these routines to power system problems. This paper addresses this issue in two key ways. First, for the first time to our knowledge, we enable the simultaneous verification of multiple verification problems (e.g., checking for the violation of all line flow constraints simultaneously and not by solving individual verification problems). For that, we introduce an exact transformation that converts the "worst-case" violation across a set of potential violations to a series of ReLU-based layers that augment the original neural network. This allows verifiers to interpret them directly. Second, power system ML models often must be verified to satisfy power flow constraints. We propose a dualization procedure which encodes linear equality and inequality constraints directly into the verification problem; and in a manner which is mathematically consistent with the specialized verification tools. To demonstrate these innovations, we verify problems associated with data-driven security constrained DC-OPF solvers. We build and test our first set of innovations using the $α,β$-CROWN solver, and we benchmark against Gurobi 10.0. Our contributions achieve a speedup that can exceed 100x and allow higher degrees of verification flexibility.

cs.LG↗

Network-Aware Flexibility Requests for Distribution-Level Flexibility Markets

This paper proposes a method to design network-aware flexibility requests for local flexibility markets. These markets are becoming increasingly important for distribution system operators (DSOs) to ensure grid safety while minimizing costs and public opposition to new network investments. Despite extended recent literature on local flexibility markets, little attention has been paid to quantifying the flexibility required at each location, considering physical network constraints (e.g. line and voltage limits). The method introduced uses a chance-constrained optimization model and a LinDistFlow approximation to consider both physical network constraints and uncertainty caused by renewable production or demand fluctuations. Unlike other methods, it avoids sharing sensitive grid data with the market operator. We compare our approach against a stochastic market-clearing mechanism which serves as a benchmark, and we derive analytical conditions for the performance of our method to determine flexibility requests. We show on two case studies that our method outperforms the stochastic market-clearing benchmark in terms of computation time while achieving comparable social welfare and costs for the DSOs. One of the case studies is conducted on an actual German distribution grid, showing that the proposed method can scale well to real-sized networks.

math.OC↗

Optimal Design of Volt/VAR Control Rules for Inverter-Interfaced Distributed Energy Resources

The IEEE 1547 Standard for the interconnection of distributed energy resources (DERs) to distribution grids provisions that smart inverters could be implementing Volt/VAR control rules among other options. Such rules enable DERs to respond autonomously in response to time-varying grid loading conditions. The rules comprise affine droop control augmented with a deadband and saturation regions. Nonetheless, selecting the shape of these rules is not an obvious task, and the default options may not be optimal or dynamically stable. To this end, this work develops a novel methodology for customizing Volt/VAR rules on a per-bus basis for a single-phase feeder. The rules are adjusted by the utility every few hours depending on anticipated demand and solar scenarios. Using a projected gradient descent-based algorithm, rules are designed to improve the feeder's voltage profile, comply with IEEE 1547 constraints, and guarantee stability of the underlying nonlinear grid dynamics. The stability region is inner approximated by a polytope and the rules are judiciously parameterized so their feasible set is convex. Numerical tests using real-world data on the IEEE 141-bus feeder corroborate the scalability of the methodology and its explore the trade-offs of Volt/VAR control with alternatives.

eess.SY↗

Enriching Neural Network Training Dataset to Improve Worst-Case Performance Guarantees

Machine learning algorithms, especially Neural Networks (NNs), are a valuable tool used to approximate non-linear relationships, like the AC-Optimal Power Flow (AC-OPF), with considerable accuracy -- and achieving a speedup of several orders of magnitude when deployed for use. Often in power systems literature, the NNs are trained with a fixed dataset generated prior to the training process. In this paper, we show that adapting the NN training dataset during training can improve the NN performance and substantially reduce its worst-case violations. This paper proposes an algorithm that identifies and enriches the training dataset with critical datapoints that reduce the worst-case violations and deliver a neural network with improved worst-case performance guarantees. We demonstrate the performance of our algorithm in four test power systems, ranging from 39-buses to 162-buses.

cs.LG↗

Physics Informed Neural Networks for Phase Locked Loop Transient Stability Assessment

A significant increase in renewable energy production is necessary to achieve the UN's net-zero emission targets for 2050. Using power-electronic controllers, such as Phase Locked Loops (PLLs), to keep grid-tied renewable resources in synchronism with the grid can cause fast transient behavior during grid faults leading to instability. However, assessing all the probable scenarios is impractical, so determining the stability boundary or region of attraction (ROA) is necessary. However, using EMT simulations or Reduced-order models (ROMs) to accurately determine the ROA is computationally expensive. Alternatively, Machine Learning (ML) models have been proposed as an efficient method to predict stability. However, traditional ML algorithms require large amounts of labeled data for training, which is computationally expensive. This paper proposes a Physics-Informed Neural Network (PINN) architecture that accurately predicts the nonlinear transient dynamics of a PLL controller under fault with less labeled training data. The proposed PINN algorithm can be incorporated into conventional simulations, accelerating EMT simulations or ROMs by over 100 times. The PINN algorithm's performance is compared against a ROM and an EMT simulation in PSCAD for the CIGRE benchmark model C4.49, demonstrating its ability to accurately approximate trajectories and ROAs of a PLL controller under varying grid impedance.

eess.SY↗

Transient Stability Analysis with Physics-Informed Neural Networks

We explore the possibility to use physics-informed neural networks to drastically accelerate the solution of ordinary differential-algebraic equations that govern the power system dynamics. When it comes to transient stability assessment, the traditionally applied methods either carry a significant computational burden, require model simplifications, or use overly conservative surrogate models. Conventional neural networks can circumvent these limitations but are faced with high demand of high-quality training datasets, while they ignore the underlying governing equations. Physics-informed neural networks are different: they incorporate the power system differential algebraic equations directly into the neural network training and drastically reduce the need for training data. This paper takes a deep dive into the performance of physics-informed neural networks for power system transient stability assessment. Introducing a new neural network training procedure to facilitate a thorough comparison, we explore how physics-informed neural networks compare with conventional differential-algebraic solvers and classical neural networks in terms of computation time, requirements in data, and prediction accuracy. We illustrate the findings on the Kundur two-area system, and assess the opportunities and challenges of physics-informed neural networks to serve as a transient stability analysis tool, highlighting possible pathways to further develop this method.

cs.LG↗

A Novel Decentralized Inverter Control Algorithm for Loss Minimization and LVRT Improvement

Algorithms that adjust the reactive power injection of converter-connected RES to minimize losses may compromise the converters' fault-ride-through capability. This can become crucial for the reliable operation of the distribution grids, as they could lose valuable resources to support grid voltage at the time they need them the most. This paper explores how two novel loss-minimizing algorithms can both achieve high reduction of the system losses during normal operation and remain connected to support the voltage during faults. The algorithms we propose are decentralized and model-free: they require no communication and no knowledge of the grid topology or the grid location of the converters. Using local information, they control the reactive power injection to minimize the system losses. In this paper, we extend these algorithms to ensure the low voltage ride through (LVRT) capability of the converters, and we integrate them with state-of-the-art Wavelet-CNN-LSTM RES forecasting methods that enhance their performance. We perform extensive simulations on the real-time digital simulation (RTDS) platform, where we demonstrate that the algorithms we propose can achieve a substantial decrease in power losses while remaining compliant with the grid codes for LVRT makes them suitable for the implementation across the distribution system.

eess.SY↗

Scalable Optimal Design of Incremental Volt/VAR Control using Deep Neural Networks

Volt/VAR control rules facilitate the autonomous operation of distributed energy resources (DER) to regulate voltage in power distribution grids. According to non-incremental control rules, such as the one mandated by the IEEE Standard 1547, the reactive power setpoint of each DER is computed as a piecewise-linear curve of the local voltage. However, the slopes of such curves are upper-bounded to ensure stability. On the other hand, incremental rules add a memory term into the setpoint update, rendering them universally stable. They can thus attain enhanced steady-state voltage profiles. Optimal rule design (ORD) for incremental rules can be formulated as a bilevel program. We put forth a scalable solution by reformulating ORD as training a deep neural network (DNN). This DNN emulates the Volt/VAR dynamics for incremental rules derived as iterations of proximal gradient descent (PGD). Analytical findings and numerical tests corroborate that the proposed ORD solution can be neatly adapted to single/multi-phase feeders.

math.OC↗

Bayesian Physics-Informed Neural Networks for Robust System Identification of Power Systems

This paper introduces for the first time, to the best of our knowledge, the Bayesian Physics-Informed Neural Networks for applications in power systems. Bayesian Physics-Informed Neural Networks (BPINNs) combine the advantages of Physics-Informed Neural Networks (PINNs), being robust to noise and missing data, with Bayesian modeling, delivering a confidence measure for their output. Such a confidence measure can be very valuable for the operation of safety critical systems, such as power systems, as it offers a degree of trustworthiness for the neural network output. This paper applies the BPINNs for robust identification of the system inertia and damping, using a single machine infinite bus system as the guiding example. The goal of this paper is to introduce the concept and explore the strengths and weaknesses of BPINNs compared to existing methods. We compare BPINNs with the PINNs and the recently popular method for system identification, SINDy. We find that BPINNs and PINNs are robust against all noise levels, delivering estimates of the system inertia and damping with significantly lower error compared to SINDy, especially as the noise levels increases.

eess.SY↗

Minimizing Worst-Case Violations of Neural Networks

Machine learning (ML) algorithms are remarkably good at approximating complex non-linear relationships. Most ML training processes, however, are designed to deliver ML tools with good average performance, but do not offer any guarantees about their worst-case estimation error. For safety-critical systems such as power systems, this places a major barrier for their adoption. So far, approaches could determine the worst-case violations of only trained ML algorithms. To the best of our knowledge, this is the first paper to introduce a neural network training procedure designed to achieve both a good average performance and minimum worst-case violations. Using the Optimal Power Flow (OPF) problem as a guiding application, our approach (i) introduces a framework that reduces the worst-case generation constraint violations during training, incorporating them as a differentiable optimization layer; and (ii) presents a neural network sequential learning architecture to significantly accelerate it. We demonstrate the proposed architecture on four different test systems ranging from 39 buses to 162 buses, for both AC-OPF and DC-OPF applications.

cs.LG↗