TY - GEN
T1 - Multi-area state estimation using distributed SDP for nonlinear power systems
AU - Zhu, Hao
AU - Giannakis, Georgios B.
PY - 2012/12/1
Y1 - 2012/12/1
N2 - State estimation (SE) is an important task allowing power networks to monitor accurately the underlying system state, while multi-area SE is becoming increasingly popular as the power grid comprises multiple interconnected 'subgrids.' For nonlinear AC power systems, SE per subgrid amounts to minimizing a nonlinear least-squares cost that is inherently nonconvex, thus giving rise to many local optima. Despite the non-convexity, a recent SE approach based on semidefinite programming (SDP) has been effective in approaching globally optimal performance at the price of higher computational cost. A novel reduced-complexity algorithm is developed in this paper for local control areas to solve the centralized SDP-based SE problem in a distributed fashion. It leverages results on positive semidefinite matrix completion to split a global state matrix constraint into local ones, which further allows for parallel implementation using the alternating-direction method of multipliers (ADMM). With minimal data exchanges among neighboring areas, each control center can efficiently perform local updates that scale with each area's size (number of buses). Numerical simulations using the IEEE 14-bus system demonstrate the asymptotic convergence of local state matrices, and desirable estimation accuracy attainable with a limited number of exchanges.
AB - State estimation (SE) is an important task allowing power networks to monitor accurately the underlying system state, while multi-area SE is becoming increasingly popular as the power grid comprises multiple interconnected 'subgrids.' For nonlinear AC power systems, SE per subgrid amounts to minimizing a nonlinear least-squares cost that is inherently nonconvex, thus giving rise to many local optima. Despite the non-convexity, a recent SE approach based on semidefinite programming (SDP) has been effective in approaching globally optimal performance at the price of higher computational cost. A novel reduced-complexity algorithm is developed in this paper for local control areas to solve the centralized SDP-based SE problem in a distributed fashion. It leverages results on positive semidefinite matrix completion to split a global state matrix constraint into local ones, which further allows for parallel implementation using the alternating-direction method of multipliers (ADMM). With minimal data exchanges among neighboring areas, each control center can efficiently perform local updates that scale with each area's size (number of buses). Numerical simulations using the IEEE 14-bus system demonstrate the asymptotic convergence of local state matrices, and desirable estimation accuracy attainable with a limited number of exchanges.
KW - Multi-area state estimation
KW - SCADA measurements
KW - alternating direction method of multipliers
KW - distributed semidefinite programming
UR - http://www.scopus.com/inward/record.url?scp=84876020366&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84876020366&partnerID=8YFLogxK
U2 - 10.1109/SmartGridComm.2012.6486055
DO - 10.1109/SmartGridComm.2012.6486055
M3 - Conference contribution
AN - SCOPUS:84876020366
SN - 9781467309110
T3 - 2012 IEEE 3rd International Conference on Smart Grid Communications, SmartGridComm 2012
SP - 623
EP - 628
BT - 2012 IEEE 3rd International Conference on Smart Grid Communications, SmartGridComm 2012
T2 - 2012 IEEE 3rd International Conference on Smart Grid Communications, SmartGridComm 2012
Y2 - 5 November 2012 through 8 November 2012
ER -