A scheduled-asynchronous distributed optimization algorithm for the optimal power flow problem

Optimal power flow (OPF) problems are non-convex and large-scale optimization problems. Finding an optimal solution for the OPF problem in real time is challenging and important in various applications. Recent studies show that a wide class of OPF problems have an exact semidefinite programming (SDP) convex relaxation. However, only few works have considered distributed algorithms to solve these. In this paper, we propose a scheduled-asynchronous algorithm with this objective. The proposed algorithm follows an ADMM-like iteration for every edge in the electrical network and is asynchronous in the sense that the agents do not simultaneously update their local variables, but only do so when they have received fresh information from all of their neighbors. In addition, if the electrical network topology is bipartite, the proposed algorithm has a convergence rate of O(1/n), where n is the iteration per agent. The asynchronous property and fast convergence rate make the proposed algorithm suitable for the OPF problem. Simulation studies demonstrate that the proposed algorithm is scalable with the number of buses and robust to network effects including delays and packet drops.

[1]  R. Adapa,et al.  A review of selected optimal power flow literature to 1993. I. Nonlinear and quadratic programming approaches , 1999 .

[2]  Enrique Mallada,et al.  The Role of Convexity in Saddle-Point Dynamics: Lyapunov Function and Robustness , 2016, IEEE Transactions on Automatic Control.

[3]  Ian A. Hiskens,et al.  A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems , 2017, IEEE Transactions on Power Systems.

[4]  Kin Cheong Sou,et al.  A branch-decomposition approach to power network design , 2015, 2016 American Control Conference (ACC).

[5]  Baosen Zhang,et al.  Control and Optimization of Power Systems with Renewables: Voltage Regulation and Generator Dispatch , 2013 .

[6]  S. Low,et al.  Zero Duality Gap in Optimal Power Flow Problem , 2012, IEEE Transactions on Power Systems.

[7]  K. Mani Chandy,et al.  Optimal power flow over tree networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  R. W. Deming.  Acyclic orientations of a graph and chromatic and independence numbers , 1979, J. Comb. Theory, Ser. B.

[9]  Daniel K. Molzahn,et al.  Application of semidefinite optimization techniques to problems in electric power systems , 2013 .

[10]  Bruce P. Graham,et al.  An Algorithm for Determining the Chromatic Number of a Graph , 1973, SIAM J. Comput..

[11]  Wei Zhang,et al.  On exact and near optimal power flow solutions for microgrid applications , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[12]  Robin Thomas,et al.  Efficiently four-coloring planar graphs , 1996, STOC '96.

[13]  David Tse,et al.  Distributed algorithms for optimal power flow problem , 2011, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[14]  Bingsheng He,et al.  On non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliers , 2014, Numerische Mathematik.

[15]  Cid C. de Souza,et al.  Acyclic Orientations with Path Constraints , 2008, RAIRO Oper. Res..

[16]  Javad Lavaei,et al.  Promises of Conic Relaxation for Contingency-Constrained Optimal Power Flow Problem , 2014, IEEE Transactions on Power Systems.

[17]  Georgios B. Giannakis,et al.  Distributed Optimal Power Flow for Smart Microgrids , 2012, IEEE Transactions on Smart Grid.

[18]  M. A. Abido,et al.  Optimal power flow using particle swarm optimization , 2002 .

[19]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[20]  José M. F. Moura,et al.  Fast Distributed Gradient Methods , 2011, IEEE Transactions on Automatic Control.

[21]  G. Sheblé,et al.  Power generation operation and control — 2nd edition , 1996 .

[22]  Venkataramana Ajjarapu,et al.  The continuation power flow: a tool for steady state voltage stability analysis , 1991 .

[23]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..