Robust and scalable power system state estimation via composite optimization

Gang Wang, Georgios B. Giannakis, Jie Chen

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In today's cyber-enabled smart grids, high penetration of uncertain renewables, purposeful manipulation of meter readings, and the need for wide-area situational awareness, call for fast, accurate, and robust power system state estimation. The least-absolute-value (LAV) estimator is known for its robustness relative to the weighted least-squares one. However, due to nonconvexity and nonsmoothness, existing LAV solvers based on linear programming are typically slow and, hence, inadequate for real-time system monitoring. This paper, develops two novel algorithms for efficient LAV estimation, which draw from recent advances in composite optimization. The first is a deterministic linear proximal scheme that handles a sequence of (5 10 in general) convex quadratic problems, each efficiently solvable either via off-the-shelf toolboxes or through the alternating direction method of multipliers. Leveraging the sparse connectivity inherent to power networks, the second scheme is stochastic and updates only a few entries of the complex voltage state vector per iteration. In particular, when voltage magnitude and (re)active power flow measurements are used only, this number reduces to one or two regardless of the number of buses in the network. This computational complexity evidently scales well to large-size power systems. Furthermore, by carefully mini-batching the voltage and power flow measurements, accelerated implementation of the stochastic iterations becomes possible. The developed algorithms are numerically evaluated using a variety of benchmark power networks. Simulated tests corroborate that improved robustness can be attained at comparable or markedly reduced computation times for medium- or large-size networks relative to existing alternatives.

Original languageEnglish (US)
Article number8632764
Pages (from-to)6137-6147
Number of pages11
JournalIEEE Transactions on Smart Grid
Volume10
Issue number6
DOIs
StatePublished - Nov 2019

Fingerprint

State estimation
Flow measurement
Composite materials
Electric potential
Real time systems
Linear programming
Computational complexity
Monitoring

Keywords

  • SCADA measurements
  • alternating direction method of multipliers
  • cyberattacks
  • nonlinear AC estimation
  • prox-linear algorithms

Cite this

Robust and scalable power system state estimation via composite optimization. / Wang, Gang; Giannakis, Georgios B.; Chen, Jie.

In: IEEE Transactions on Smart Grid, Vol. 10, No. 6, 8632764, 11.2019, p. 6137-6147.

Research output: Contribution to journalArticle

@article{ab62a40c461b46e2bc6be547871a458e,
title = "Robust and scalable power system state estimation via composite optimization",
abstract = "In today's cyber-enabled smart grids, high penetration of uncertain renewables, purposeful manipulation of meter readings, and the need for wide-area situational awareness, call for fast, accurate, and robust power system state estimation. The least-absolute-value (LAV) estimator is known for its robustness relative to the weighted least-squares one. However, due to nonconvexity and nonsmoothness, existing LAV solvers based on linear programming are typically slow and, hence, inadequate for real-time system monitoring. This paper, develops two novel algorithms for efficient LAV estimation, which draw from recent advances in composite optimization. The first is a deterministic linear proximal scheme that handles a sequence of (5 10 in general) convex quadratic problems, each efficiently solvable either via off-the-shelf toolboxes or through the alternating direction method of multipliers. Leveraging the sparse connectivity inherent to power networks, the second scheme is stochastic and updates only a few entries of the complex voltage state vector per iteration. In particular, when voltage magnitude and (re)active power flow measurements are used only, this number reduces to one or two regardless of the number of buses in the network. This computational complexity evidently scales well to large-size power systems. Furthermore, by carefully mini-batching the voltage and power flow measurements, accelerated implementation of the stochastic iterations becomes possible. The developed algorithms are numerically evaluated using a variety of benchmark power networks. Simulated tests corroborate that improved robustness can be attained at comparable or markedly reduced computation times for medium- or large-size networks relative to existing alternatives.",
keywords = "SCADA measurements, alternating direction method of multipliers, cyberattacks, nonlinear AC estimation, prox-linear algorithms",
author = "Gang Wang and Giannakis, {Georgios B.} and Jie Chen",
year = "2019",
month = "11",
doi = "10.1109/TSG.2019.2897100",
language = "English (US)",
volume = "10",
pages = "6137--6147",
journal = "IEEE Transactions on Smart Grid",
issn = "1949-3053",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Robust and scalable power system state estimation via composite optimization

AU - Wang, Gang

AU - Giannakis, Georgios B.

AU - Chen, Jie

PY - 2019/11

Y1 - 2019/11

N2 - In today's cyber-enabled smart grids, high penetration of uncertain renewables, purposeful manipulation of meter readings, and the need for wide-area situational awareness, call for fast, accurate, and robust power system state estimation. The least-absolute-value (LAV) estimator is known for its robustness relative to the weighted least-squares one. However, due to nonconvexity and nonsmoothness, existing LAV solvers based on linear programming are typically slow and, hence, inadequate for real-time system monitoring. This paper, develops two novel algorithms for efficient LAV estimation, which draw from recent advances in composite optimization. The first is a deterministic linear proximal scheme that handles a sequence of (5 10 in general) convex quadratic problems, each efficiently solvable either via off-the-shelf toolboxes or through the alternating direction method of multipliers. Leveraging the sparse connectivity inherent to power networks, the second scheme is stochastic and updates only a few entries of the complex voltage state vector per iteration. In particular, when voltage magnitude and (re)active power flow measurements are used only, this number reduces to one or two regardless of the number of buses in the network. This computational complexity evidently scales well to large-size power systems. Furthermore, by carefully mini-batching the voltage and power flow measurements, accelerated implementation of the stochastic iterations becomes possible. The developed algorithms are numerically evaluated using a variety of benchmark power networks. Simulated tests corroborate that improved robustness can be attained at comparable or markedly reduced computation times for medium- or large-size networks relative to existing alternatives.

AB - In today's cyber-enabled smart grids, high penetration of uncertain renewables, purposeful manipulation of meter readings, and the need for wide-area situational awareness, call for fast, accurate, and robust power system state estimation. The least-absolute-value (LAV) estimator is known for its robustness relative to the weighted least-squares one. However, due to nonconvexity and nonsmoothness, existing LAV solvers based on linear programming are typically slow and, hence, inadequate for real-time system monitoring. This paper, develops two novel algorithms for efficient LAV estimation, which draw from recent advances in composite optimization. The first is a deterministic linear proximal scheme that handles a sequence of (5 10 in general) convex quadratic problems, each efficiently solvable either via off-the-shelf toolboxes or through the alternating direction method of multipliers. Leveraging the sparse connectivity inherent to power networks, the second scheme is stochastic and updates only a few entries of the complex voltage state vector per iteration. In particular, when voltage magnitude and (re)active power flow measurements are used only, this number reduces to one or two regardless of the number of buses in the network. This computational complexity evidently scales well to large-size power systems. Furthermore, by carefully mini-batching the voltage and power flow measurements, accelerated implementation of the stochastic iterations becomes possible. The developed algorithms are numerically evaluated using a variety of benchmark power networks. Simulated tests corroborate that improved robustness can be attained at comparable or markedly reduced computation times for medium- or large-size networks relative to existing alternatives.

KW - SCADA measurements

KW - alternating direction method of multipliers

KW - cyberattacks

KW - nonlinear AC estimation

KW - prox-linear algorithms

UR - http://www.scopus.com/inward/record.url?scp=85074190439&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074190439&partnerID=8YFLogxK

U2 - 10.1109/TSG.2019.2897100

DO - 10.1109/TSG.2019.2897100

M3 - Article

AN - SCOPUS:85074190439

VL - 10

SP - 6137

EP - 6147

JO - IEEE Transactions on Smart Grid

JF - IEEE Transactions on Smart Grid

SN - 1949-3053

IS - 6

M1 - 8632764

ER -