Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case

doi:10.1109/tsg.2016.2546305

Title: Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case

Full Record
Other Related Research

Abstract

Not provided.

Authors:: Peng, Qiuyu; Low, Steven H.

Publication Date:: 2018-01-01

Research Org.:: California Inst. of Technology (CalTech), Pasadena, CA (United States); Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

Sponsoring Org.:: USDOE Advanced Research Projects Agency - Energy (ARPA-E)

OSTI Identifier:: 1541549

DOE Contract Number:: AR0000226; AC52-06NA25396

Resource Type:: Journal Article

Journal Name:: IEEE Transactions on Smart Grid

Additional Journal Information:: Journal Volume: 9; Journal Issue: 1; Journal ID: ISSN 1949-3053

Publisher:: IEEE

Country of Publication:: United States

Language:: English

Subject:: Engineering

Citation Formats


                    Peng, Qiuyu, and Low, Steven H. Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case.  United States: N. p., 2018. 
        Web.  doi:10.1109/tsg.2016.2546305.

Copy to clipboard


                    Peng, Qiuyu, & Low, Steven H. Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case.  United States.  doi:10.1109/tsg.2016.2546305.

Copy to clipboard


                    Peng, Qiuyu, and Low, Steven H. Mon .  
        "Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case".  United States.  doi:10.1109/tsg.2016.2546305.

Copy to clipboard


                    
@article{osti_1541549,

  title        = {Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case},

  author       = {Peng, Qiuyu and Low, Steven H.},

  abstractNote = {Not provided.},

  doi          = {10.1109/tsg.2016.2546305},

  journal      = {IEEE Transactions on Smart Grid},

  issn         = {1949-3053},

  number       = 1,

  volume       = 9,

  place        = {United States},

  year         = {2018},

  month        = {1}

}

Copy to clipboard

Journal Article:

DOI: 10.1109/tsg.2016.2546305

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Branch Flow Model: Relaxations and Convexification-Part I

Journal Article Farivar, M ; Low, SH - IEEE Transactions on Power Systems

We propose a branch flow model for the analysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates the voltage and current angles and the second step approximates the resulting problem by a conic program that can be solved efficiently. For radial networks, we prove that both relaxation steps are always exact, provided there are no upper bounds on loads. For mesh networks, the conic relaxation is always exact but the angle relaxation may not be exact,more »« less
DOI: 10.1109/TPWRS.2013.2255317
Branch Flow Model: Relaxations and Convexification-Part II

Journal Article Farivar, M ; Low, SH - IEEE Transactions on Power Systems

We propose a branch flow model for the analysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates the voltage and current angles and the second step approximates the resulting problem by a conic program that can be solved efficiently. For radial networks, we prove that both relaxation steps are always exact, provided there are no upper bounds on loads. For mesh networks, the conic relaxation is always exact but the angle relaxation may not be exact,more »« less
DOI: 10.1109/TPWRS.2013.2255318
Graphical models for optimal power flow

Journal Article Dvijotham, Krishnamurthy ; Chertkov, Michael ; Van Hentenryck, Pascal ; ... - Constraints

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithmmore »« less
Cited by 1
DOI: 10.1007/s10601-016-9253-y

Full Text Available
Resistive Network Optimal Power Flow: Uniqueness and Algorithms

Journal Article Tan, CW ; Cai, DWH ; Lou, X - IEEE Transactions on Power Systems

The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to designmore »« less
DOI: 10.1109/TPWRS.2014.2329324
Accelerated Voltage Regulation in Multi-Phase Distribution Networks Based on Hierarchical Distributed Algorithm

Journal Article Zhou, Xinyang ; Liu, Zhiyuan ; Zhao, Changhong ; ... - IEEE Transactions on Power Systems

Here, we introduce a hierarchical distributed algorithm to solve optimal power flow (OPF) problems that aim at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm highlights unprecedented scalability to large multi-phase distribution networks by jointly exploring the tree/subtrees structure of a large radial distribution network and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves OPF. The proposed implementation significantly reduces the computation loads compared to the centrally coordinated implementation of the same primal-dual algorithm without compromising optimality. Numericalmore »« less
DOI: 10.1109/TPWRS.2019.2948978

Similar Records