Spyros Chatzivasileiadis

Spyros Chatzivasileiadis

Auto-generated profile, based on publicly available information

Spyros Chatzivasileiadis

Technical University of Denmark, Kgs Lyngby, Denmark

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 July 2022 in Electric Power Systems Research
Verified
Journal Article
Open access
RNRahul Nellikkath
Rahul Nellikkath
SCSpyros Chatzivasileiadis
Spyros Chatzivasileiadis

15 July 2020 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
AVAndreas Venzke
Andreas Venzke
SCSpyros Chatzivasileiadis
Spyros Chatzivasileiadis
This paper presents for the first time, to our knowledge, a framework for verifying neural network behavior in power system applications. Up to this moment, neural networks have been applied in power systems as a black box; this has presented a major barrier for their adoption in practice. Developing a rigorous framework based on mixed-integer linear programming, our methods can determine the range of inputs that neural networks classify as safe or unsafe, and are able to systematically identify adversarial examples. Such methods have the potential to build the missing trust of power system operators on neural networks, and unlock a series of new applications in power systems. This paper presents the framework, methods to assess and improve neural network robustness in power systems, and addresses concerns related to scalability and accuracy. We demonstrate our methods on the IEEE 9-bus, 14-bus, and 162-bus systems, treating both N-1 security and small-signal stability.

6 October 2017 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
AVAndreas Venzke
Andreas Venzke
LHLejla Halilbasic
Lejla Halilbasic
UMUros Markovic
Uros Markovic
GHGabriela Hug
Gabriela Hug
SCSpyros Chatzivasileiadis
Spyros Chatzivasileiadis
High penetration of renewable energy sources and the increasing share of stochastic loads require the explicit representation of uncertainty in tools such as the optimal power flow (OPF). Current approaches follow either a linearized approach or an iterative approximation of non-linearities. This paper proposes a semidefinite relaxation of a chance constrained AC-OPF which is able to provide guarantees for global optimality. Using a piecewise affine policy, we can ensure tractability, accurately model large power deviations, and determine suitable corrective control policies for active power, reactive power, and voltage. We state a tractable formulation for two types of uncertainty sets. Using a scenario-based approach and making no prior assumptions about the probability distribution of the forecast errors, we obtain a robust formulation for a rectangular uncertainty set. Alternatively, assuming a Gaussian distribution of the forecast errors, we propose an analytical reformulation of the chance constraints suitable for semidefinite programming. We demonstrate the performance of our approach on the IEEE 24 and 118 bus system using realistic day-ahead forecast data and obtain tight near-global optimality guarantees.

3 January 2019 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
FTFlorian Thams
Florian Thams
AVAndreas Venzke
Andreas Venzke
RERobert Eriksson
Robert Eriksson
SCSpyros Chatzivasileiadis
Spyros Chatzivasileiadis

1 August 2021 in Renewable and Sustainable Energy Transition
Verified
Journal Article
Open access
ASAlessandro Singlitico
Alessandro Singlitico
JØJacob Østergaard
Jacob Østergaard
SCSpyros Chatzivasileiadis
Spyros Chatzivasileiadis

4 October 2018 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
LHLejla Halilbasic
Lejla Halilbasic
PPPierre Pinson
Pierre Pinson
SCSpyros Chatzivasileiadis
Spyros Chatzivasileiadis
This paper deals with the impact of linear approximations for the unknown nonconvex confidence region of chance-constrained AC optimal power flow problems. Such approximations are required for the formulation of tractable chance constraints. In this context, we introduce the first formulation of a chance-constrained second-order cone (SOC) OPF. The proposed formulation provides convergence guarantees due to its convexity, while it demonstrates high computational efficiency. Combined with an AC feasibility recovery, it is able to identify better solutions than chance-constrained nonconvex AC-OPF formulations. To the best of our knowledge, this paper is the first to perform a rigorous analysis of the AC feasibility recovery procedures for robust SOC-OPF problems. We identify the issues that arise from the linear approximations, and by using a reformulation of the quadratic chance constraints, we introduce new parameters able to reshape the approximation of the confidence region. We demonstrate our method on the IEEE 118-bus system.