Spatiotemporal load curve data cleansing and imputation via sparsity and low rank

The smart grid vision is to build an intelligent power network with an unprecedented level of situational awareness and controllability over its services and infrastructure. This paper advocates statistical inference methods to robustify power monitoring tasks against the outlier effects owing to faulty readings and malicious attacks, as well as against missing data due to privacy concerns and communication errors. In this context, a novel load cleansing and imputation scheme is developed leveraging the low intrinsic-dimensionality of spatiotemporal load profiles and the sparse nature of “bad data.” A robust estimator based on principal components pursuit (PCP) is adopted, which effects a twofold sparsity-promoting regularization through an ℓ1-norm of the outliers, and the nuclear norm of the nominal load profiles. After recasting the non-separable nuclear norm into a form amenable to distributed optimization, a distributed (D-) PCP algorithm is developed to carry out the imputation and cleansing tasks using a network of interconnected smart meters. Computer simulations and tests with real load curve data corroborate the convergence and effectiveness of the novel D-PCP algorithm.

[1]  Jiguo Cao,et al.  Automated Load Curve Data Cleansing in Power Systems , 2010, IEEE Transactions on Smart Grid.

[2]  Zuyi Li,et al.  Market Operations in Electric Power Systems : Forecasting, Scheduling, and Risk Management , 2002 .

[3]  Xiaodong Li,et al.  Stable Principal Component Pursuit , 2010, 2010 IEEE International Symposium on Information Theory.

[4]  Morteza Mardani,et al.  Decentralized Sparsity-Regularized Rank Minimization: Algorithms and Applications , 2012, IEEE Transactions on Signal Processing.

[5]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[6]  Gonzalo Mateos,et al.  Distributed Sparse Linear Regression , 2010, IEEE Transactions on Signal Processing.

[7]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[8]  Mohammad Shahidehpour,et al.  Electricity Price Forecasting , 2002 .

[9]  Gonzalo Mateos,et al.  Robust Nonparametric Regression via Sparsity Control With Application to Load Curve Data Cleansing , 2011, IEEE Transactions on Signal Processing.

[10]  Karen Jackson,et al.  Great Achievements and Great Challenges , 2013 .

[11]  Peng Ning,et al.  False data injection attacks against state estimation in electric power grids , 2011, TSEC.

[12]  Arvind Ganesh,et al.  Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix , 2009 .

[13]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[14]  Christopher Ré,et al.  Parallel stochastic gradient algorithms for large-scale matrix completion , 2013, Mathematical Programming Computation.

[15]  Hadi Saadat,et al.  Power System Analysis , 1998 .

[16]  Dima Grigoriev,et al.  Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields , 1984, MFCS.

[17]  Xiaoming Yuan,et al.  Sparse and low-rank matrix decomposition via alternating direction method , 2013 .

[18]  Lang Tong,et al.  Malicious Data Attacks on the Smart Grid , 2011, IEEE Transactions on Smart Grid.

[19]  Thomas J. Overbye,et al.  Identification of power system topology from synchrophasor data , 2011, 2011 IEEE/PES Power Systems Conference and Exposition.

[20]  Pablo A. Parrilo,et al.  Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..