Searcharxiv⌕ Search

arXiv subjects

Spyros Chatzivasileiadis

Publications and source records attributed to Spyros Chatzivasileiadis.

At least 55 records · Page 3Linked to original sources

Emission-Aware Optimization of Gas Networks: Input-Convex Neural Network Approach

Gas network planning optimization under emission constraints prioritizes gas supply with the least CO$_2$ intensity. As this problem includes complex physical laws of gas flow, standard optimization solvers cannot guarantee convergence to a feasible solution. To address this issue, we develop an input-convex neural network (ICNN) aided optimization routine which incorporates a set of trained ICNNs approximating the gas flow equations with high precision. Numerical tests on the Belgium gas network demonstrate that the ICNN-aided optimization dominates non-convex and relaxation-based solvers, with larger optimality gains pertaining to stricter emission targets. Moreover, whenever the non-convex solver fails, the ICNN-aided optimization provides a feasible solution to network planning.

cs.LG↗

Interpretable Machine Learning for Power Systems: Establishing Confidence in SHapley Additive exPlanations

Interpretable Machine Learning (IML) is expected to remove significant barriers for the application of Machine Learning (ML) algorithms in power systems. This letter first seeks to showcase the benefits of SHapley Additive exPlanations (SHAP) for understanding the outcomes of ML models, which are increasingly being used. Second, we seek to demonstrate that SHAP explanations are able to capture the underlying physics of the power system. To do so, we demonstrate that the Power Transfer Distribution Factors (PTDF) -- a physics-based linear sensitivity index -- can be derived from the SHAP values. To do so, we take the derivatives of SHAP values from a ML model trained to learn line flows from generator power injections, using a simple DC power flow case in the 9-bus 3-generator test network. In demonstrating that SHAP values can be related back to the physics that underpin the power system, we build confidence in the explanations SHAP can offer.

eess.SY↗

Decentralized Model-free Loss Minimization in Distribution Grids with the Use of Inverters

Distribution grids are experiencing a massive penetration of fluctuating distributed energy resources (DERs). As a result, the real-time efficient and secure operation of distribution grids becomes a paramount problem. While installing smart sensors and enhancing communication infrastructure improves grid observability, it is computationally impossible for the distribution system operator (DSO) to optimize setpoints of millions of DER units. This paper proposes communication-free and model-free algorithms that can actively control converter-connected devices, and can operate either as stand-alone or in combination with centralized optimization algorithms. We address the problem of loss minimization in distribution grids, and we analytically prove that our proposed algorithms reduce the total grid losses without any prior information about the network, requiring no communication, and based only on local measurements. Going a step further, we combine our proposed local algorithms with a central optimization of a very limited number of converters. The hybrid approaches we propose have much lower communication and computation requirement than traditional methods, while they also provide performance guarantees in case of communication failure. We demonstrate our algorithms in four networks of varying sizes: a 5-bus network, an IEEE 141-bus system, a real Danish distribution system, and a meshed IEEE 30-bus system.

eess.SY↗

Extended Mathematical Derivations: Decentralized Model-free Loss Minimization in Distribution Grids with the Use of Inverters

This document contains extended mathematical derivations for the communication-free and model-free algorithms that can actively control converter-connected devices, and can operate either as stand-alone or in combination with centralized optimization algorithms. We address the problem of loss minimization in distribution grids, and we analytically prove that our proposed algorithms reduce the total grid losses without any prior information about the network, requiring no communication, and based only on local measurements.

eess.SY↗

Quantum Computing for Power Flow Algorithms: Testing on real Quantum Computers

Quantum computing has the potential to solve many computational problems exponentially faster than classical computers. The high shares of renewables and the wide deployment of converter-interfaced resources require new tools that shall drastically accelerate power system computations, including optimization and security assessment, which can benefit from quantum computing. To the best of our knowledge, this is the first paper that goes beyond quantum computing simulations and performs an experimental application of Quantum Computing for power systems on a real quantum computer. We use five different quantum computers, apply the HHL quantum algorithm, and examine the impact of current noisy quantum hardware on the accuracy and speed of an AC power flow algorithm. We perform the same studies on a 3-bus and a 5-bus system with real quantum computers to identify challenges and open research questions related with the scalability of these algorithms.

quant-ph↗

Neural Networks for Encoding Dynamic Security-Constrained Optimal Power Flow

This paper introduces a framework to capture previously intractable optimization constraints and transform them to a mixed-integer linear program, through the use of neural networks. We encode the feasible space of optimization problems characterized by both tractable and intractable constraints, e.g. differential equations, to a neural network. Leveraging an exact mixed-integer reformulation of neural networks, we solve mixed-integer linear programs that accurately approximate solutions to the originally intractable non-linear optimization problem. We apply our methods to the AC optimal power flow problem (AC-OPF), where directly including dynamic security constraints renders the AC-OPF intractable. Our proposed approach has the potential to be significantly more scalable than traditional approaches. We demonstrate our approach for power system operation considering N-1 security and small-signal stability, showing how it can efficiently obtain cost-optimal solutions which at the same time satisfy both static and dynamic security constraints.

eess.SY↗

Closing the Loop: A Framework for Trustworthy Machine Learning in Power Systems

Deep decarbonization of the energy sector will require massive penetration of stochastic renewable energy resources and an enormous amount of grid asset coordination; this represents a challenging paradigm for the power system operators who are tasked with maintaining grid stability and security in the face of such changes. With its ability to learn from complex datasets and provide predictive solutions on fast timescales, machine learning (ML) is well-posed to help overcome these challenges as power systems transform in the coming decades. In this work, we outline five key challenges (dataset generation, data pre-processing, model training, model assessment, and model embedding) associated with building trustworthy ML models which learn from physics-based simulation data. We then demonstrate how linking together individual modules, each of which overcomes a respective challenge, at sequential stages in the machine learning pipeline can help enhance the overall performance of the training process. In particular, we implement methods that connect different elements of the learning pipeline through feedback, thus "closing the loop" between model training, performance assessments, and re-training. We demonstrate the effectiveness of this framework, its constituent modules, and its feedback connections by learning the N-1 small-signal stability margin associated with a detailed model of a proposed North Sea Wind Power Hub system.

eess.SY↗

Learning Active Constraints to Efficiently Solve Linear Bilevel Problems: Application to the Generator Strategic Bidding Problem

Bilevel programming can be used to formulate many problems in the field of power systems, such as strategic bidding. However, common reformulations of bilevel problems to mixed-integer linear programs make solving such problems hard, which impedes their implementation in real-life. In this paper, we significantly improve solution speed and tractability by introducing decision trees to learn the active constraints of the lower-level problem, while avoiding to introduce binaries and big-M constants. The application of machine learning reduces the online solving time, by moving the selection of active constraints to an offline process, and becomes particularly beneficial when the same problem has to be solved multiple times. We apply our approach to the strategic bidding of generators in electricity markets, where generators solve the same problem many times for varying load demand or renewable production. Three methods are developed and applied to the problem of a strategic generator, with a DCOPF in the lower-level. These methods are heuristic and as so, do not provide guarantees of optimality or solution quality. Yet, we show that for networks of varying sizes, the computational burden is significantly reduced, while we also manage to find solutions for strategic bidding problems that were previously intractable.

math.OC↗

North Sea Energy Islands: Impact on National Markets and Grids

Taking concrete steps towards a carbon-free society, the Danish Parliament has recently made an agreement on the establishment of the world's first two offshore energy hubs, one on the island of Bornholm and one on an artificial island in the North Sea. Being the two first-of-their-kind projects, several aspects related to the inclusion of these "energy islands" in the current market setup are still under discussion. To this end, this paper presents the first large-scale impact analysis of offshore hubs on the whole European power system and electricity market. The detailed models used for such analysis are publicly released with the paper. Our study shows that energy hubs in the North Sea have a positive impact, and overall increase economic welfare in EU. However, when considering the impact on each country, benefits are not shared equally. In order to help the development of such projects, we focus on the identification of market challenges and system needs arising from the hubs. From a market perspective, we show how exporting countries are negatively affected by the lower electricity prices and we point at potential strategic behaviors induced by the large amount of new transmission capacity installed in the North Sea. From a system point of view, we show how the large amount of wind energy stresses conventional generators, which are required to become more flexible, and national grids, which cannot always accommodate large imports from the hubs.

physics.soc-ph↗

Accelerating Dynamical System Simulations with Contracting and Physics-Projected Neural-Newton Solvers

Recent advances in deep learning have allowed neural networks (NNs) to successfully replace traditional numerical solvers in many applications, thus enabling impressive computing gains. One such application is time domain simulation, which is indispensable for the design, analysis and operation of many engineering systems. Simulating dynamical systems with implicit Newton-based solvers is a computationally heavy task, as it requires the solution of a parameterized system of differential and algebraic equations at each time step. A variety of NN-based methodologies have been shown to successfully approximate the trajectories computed by numerical solvers at a fraction of the time. However, few previous works have used NNs to model the numerical solver itself. For the express purpose of accelerating time domain simulation speeds, this paper proposes and explores two complementary alternatives for modeling numerical solvers. First, we use a NN to mimic the linear transformation provided by the inverse Jacobian in a single Newton step. Using this procedure, we evaluate and project the exact, physics-based residual error onto the NN mapping, thus leaving physics ``in the loop''. The resulting tool, termed the Physics-pRojected Neural-Newton Solver (PRoNNS), is able to achieve an extremely high degree of numerical accuracy at speeds which were observed to be up to 31% faster than a Newton-based solver. In the second approach, we model the Newton solver at the heart of an implicit Runge-Kutta integrator as a contracting map iteratively seeking a fixed point on a time domain trajectory. The associated recurrent NN simulation tool, termed the Contracting Neural-Newton Solver (CoNNS), is embedded with training constraints (via CVXPY Layers) which guarantee the mapping provided by the NN satisfies the Banach fixed-point theorem.

cs.LG↗

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using Neural Networks (NNs). These NNs can be exactly transformed into Mixed Integer Linear Programs (MILPs) and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the NN. Accordingly, this paper develops a technique for training an "optimally compact" NN, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We show that the resulting NN model is more expressive than both the DC and linearized power flow approximations when embedded inside of a challenging optimization problem (i.e., the AC unit commitment problem).

cs.LG↗

Reliability-Aware Probabilistic Reserve Procurement

Current reserve procurement approaches ignore the stochastic nature of reserve asset availability itself and thus limit the type and volume of reserve offers. This paper develops a reliability-aware probabilistic approach that allows renewable generators to offer reserve capacity with reliability attributes. Offers with low reliability are priced at lower levels. The original non-convex market clearing problem is approximated by a MILP reformulation. The proposed probabilistic reserve procurement allows restricted reserve providers to enter the market, thereby increases liquidity and has the potential to lower procurement costs in power systems with high shares of variable renewable energy sources.

eess.SY↗

Auction-Based vs Continuous Clearing in Local Flexibility Markets with Block Bids

Flexibility markets can be introduced as a tool for the distribution system operator (DSO) to avoid high costs and public opposition against new network investments. Continuous flexibility markets have the advantage of allowing more liquidity, which can be critical in the earlier stages of such markets, and can be operated closer to real-time, thereby enabling a better use of the latest forecasts; but, by design, they also result to a lower social welfare compared to auction-based markets. This paper has two main contributions. First, it introduces a continuous local flexibility market which includes both network constraints and asymmetric block bids. Second, it proposes an algorithm that can accurately determine the upper and lower bound of the social welfare loss compared with an auction-based clearing model.

eess.SY↗

Physics-Informed Neural Networks for AC Optimal Power Flow

This paper introduces, for the first time to our knowledge, physics-informed neural networks to accurately estimate the AC-OPF result and delivers rigorous guarantees about their performance. Power system operators, along with several other actors, are increasingly using Optimal Power Flow (OPF) algorithms for a wide number of applications, including planning and real-time operations. However, in its original form, the AC Optimal Power Flow problem is often challenging to solve as it is non-linear and non-convex. Besides the large number of approximations and relaxations, recent efforts have also been focusing on Machine Learning approaches, especially neural networks. So far, however, these approaches have only partially considered the wide number of physical models available during training. And, more importantly, they have offered no guarantees about potential constraint violations of their output. Our approach (i) introduces the AC power flow equations inside neural network training and (ii) integrates methods that rigorously determine and reduce the worst-case constraint violations across the entire input domain, while maintaining the optimality of the prediction. We demonstrate how physics-informed neural networks achieve higher accuracy and lower constraint violations than standard neural networks, and show how we can further reduce the worst-case violations for all neural networks.

eess.SY↗

Physics-Informed Neural Networks for Minimising Worst-Case Violations in DC Optimal Power Flow

Physics-informed neural networks exploit the existing models of the underlying physical systems to generate higher accuracy results with fewer data. Such approaches can help drastically reduce the computation time and generate a good estimate of computationally intensive processes in power systems, such as dynamic security assessment or optimal power flow. Combined with the extraction of worst-case guarantees for the neural network performance, such neural networks can be applied in safety-critical applications in power systems and build a high level of trust among power system operators. This paper takes the first step and applies, for the first time to our knowledge, Physics-Informed Neural Networks with Worst-Case Guarantees for the DC Optimal Power Flow problem. We look for guarantees related to (i) maximum constraint violations, (ii) maximum distance between predicted and optimal decision variables, and (iii) maximum sub-optimality in the entire input domain. In a range of PGLib-OPF networks, we demonstrate how physics-informed neural networks can be supplied with worst-case guarantees and how they can lead to reduced worst-case violations compared with conventional neural networks.

eess.SY↗

Onshore, offshore or in-turbine electrolysis? Techno-economic overview of alternative integration designs for green hydrogen production into Offshore Wind Power Hubs

Massive investments in offshore wind power generate significant challenges on how this electricity will be integrated into the incumbent energy systems. In this context, green hydrogen produced by offshore wind emerges as a promising solution to remove barriers towards a carbon-free economy in Europe and beyond. Motivated by the recent developments in Denmark with the decision to construct the world's first artificial Offshore Energy Hub, this paper investigates how the lowest cost for green hydrogen can be achieved. A model proposing an integrated design of the hydrogen and offshore electric power infrastructure, determining the levelised costs of both hydrogen and electricity, is proposed. The economic feasibility of hydrogen production from Offshore Wind Power Hubs is evaluated considering the combination of different electrolyser placements, technologies and modes of operations. The results show that costs down to 2.4 EUR per kg can be achieved for green hydrogen production offshore, competitive with the hydrogen costs currently produced by natural gas. Moreover, a reduction of up to 13 pct. of the cost of wind electricity is registered when an electrolyser is installed offshore shaving the peak loads.

physics.soc-ph↗

Zero-inertia Offshore Grids: N-1 Security and Active Power Sharing

With Denmark dedicated to maintaining its leading position in the integration of massive shares of wind energy, the construction of new offshore energy islands has been recently approved by the Danish government. These new islands will be zero-inertia systems, meaning that no synchronous generation will be installed in the island and that power imbalances will be shared only among converters. To this end, this paper proposes a methodology to calculate and update the frequency droops gains of the offshore converters in compliance with the N-1 security criterion in case of converter outage. The frequency droop gains are calculated solving an optimization problem which takes into consideration the power limitations of the converters as well as the stability of the system. As a consequence, the proposed controller ensures safe operation of off-shore systems in the event of any power imbalance and allows for greater loadability at pre-fault state, as confirmed by the simulation results.

eess.SY↗

Learning without Data: Physics-Informed Neural Networks for Fast Time-Domain Simulation

In order to drastically reduce the heavy computational burden associated with time-domain simulations, this paper introduces a Physics-Informed Neural Network (PINN) to directly learn the solutions of power system dynamics. In contrast to the limitations of classical model order reduction approaches, commonly used to accelerate time-domain simulations, PINNs can universally approximate any continuous function with an arbitrary degree of accuracy. One of the novelties of this paper is that we avoid the need for any training data. We achieve this by incorporating the governing differential equations and an implicit Runge-Kutta (RK) integration scheme directly into the training process of the PINN; through this approach, PINNs can predict the trajectory of a dynamical power system at any discrete time step. The resulting Runge-Kutta-based physics-informed neural networks (RK-PINNs) can yield up to 100 times faster evaluations of the dynamics compared to standard time-domain simulations. We demonstrate the methodology on a single-machine infinite bus system governed by the swing equation. We show that RK-PINNs can accurately and quickly predict the solution trajectories.

eess.SY↗