Disaggregation for Networked Power Systems

Electricity data such as supply, demand, prices, and line flows, are sensitive. Utility companies, understandably do not want to, in fact often cannot, make this data publicly available. However, such data is critical in many fundamental areas in power systems research. As a compromise, aggregated data sets are sometimes made available. In such a setting it may be the case that data is aggregated over a geographical region and time. This forces researchers to try and “invert” the data to obtain dis aggregated data sets. In this paper we rigorously formulate the disaggregation problem for networked power systems and present two algorithms that provide solutions to the DC version of the problem. We show that it is possible to invert the data, but that does not imply that ground truth solutions are obtained, thus the utility companies maintain a notion of privacy. The aim of this paper is to highlight the potential benefits to both the research community and utility companies of releasing aggregated data.

[1]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[2]  Kunal Talwar,et al.  Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[3]  Stephan Dempe,et al.  Foundations of Bilevel Programming , 2002 .

[4]  Daniel K. Molzahn,et al.  Power system structure and confidentiality preserving transformation of Optimal Power Flow problem , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  Charles E. Blair,et al.  Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[6]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[7]  Thomas J. Overbye,et al.  Grid Structural Characteristics as Validation Criteria for Synthetic Networks , 2017, IEEE Transactions on Power Systems.

[8]  Jason R. Marden,et al.  Joint Strategy Fictitious Play with Inertia for Potential Games , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[9]  Ufuk Topcu,et al.  Differentially Private Distributed Constrained Optimization , 2014, IEEE Transactions on Automatic Control.

[10]  Patrice Marcotte,et al.  An overview of bilevel optimization , 2007, Ann. Oper. Res..

[11]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[12]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[13]  Daniel K. Molzahn,et al.  Confidentiality-preserving optimal power flow for cloud computing , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  J. Bard Some properties of the bilevel programming problem , 1991 .

[15]  Dan Wu,et al.  Feasibility of power system structure preserving linear transformations for the AC optimal power flow problem , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).