Convergence of Backward/Forward Sweep for Power Flow Solution in Radial Networks
Refereed conference paper presented and published in conference proceedings

Altmetrics Information

Other information
AbstractSolving power flow is perhaps the most fundamental calculation related to the steady state behavior of alternating-current (AC) power systems. The normally radial (tree) topology of a distribution network induces a spatially recursive structure in power flow equations, which enables a class of efficient solution methods called backward/forward sweep (BFS). In this paper, we revisit BFS from a new perspective, focusing on its convergence. Specifically, we describe a general formulation of BFS, interpret it as a special Gauss-Seidel algorithm, and then illustrate it in a single-phase power flow model. We prove a sufficient condition under which the BFS is a contraction mapping on a closed set of safe voltages and thus converges geometrically to a unique power flow solution. We verify the convergence condition, as well as the accuracy and computational efficiency of BFS, through numerical experiments in IEEE test systems.
All Author(s) ListBohang Fang, Changhong Zhao, Steven H. Low
Name of Conference62nd IEEE Conference on Decision and Control (CDC)
Start Date of Conference13/12/2023
End Date of Conference15/12/2023
Place of ConferenceSingapore
Country/Region of ConferenceSingapore
Proceedings Title2023 62nd IEEE Conference on Decision and Control (CDC)
LanguagesEnglish-United States

Last updated on 2024-31-01 at 11:51