Abstract

The power flow (PF) problem is a fundamental problem in power system engineering. Many popular solvers like PF and optimal PF (OPF) face challenges, such as divergence and network information sharing between multi-areas. One can try to rewrite the PF problem into a fixed point (FP) equation (more stable), which can be solved exponentially fast. But, existing FP methods are not distributed and also have unrealistic assumptions such as requiring a specific network topology. While preserving its stable nature, a novel FP equation that is distributed in nature is proposed to calculate the voltage at each bus. This distributed computation enables the proposed algorithm to compute the voltages for multi-area networks without sharing private topology information. Unlike existing distributed methods, the proposed method does not use any approximate network equivalents to represent the neighboring area. Thus, it is approximation-free, and it also finds use cases in distributed AC OPFs. We compare the performance of our FP algorithm with state-of-the-art methods, showing that the proposed method can correctly find the solutions when other methods cannot, due to high condition number matrices. In addition, we empirically show that the FP algorithm is more robust to bad initialization points than the existing methods.

Highlights

  • T HE power flow problem is one of the canonical problems in power engineering and it is frequently used in power system operation and planning studies [1]

  • Existing power flow methods mostly rely on iterative methods such as NewtonRaphson (NR) [2] or fast decoupled load flow (FDLF) [3], [4]

  • This work presents a distributed fixed point method that is approximation-free and it is not prone to inaccuracies. This approach is based on a coordinate transformation, where power flow solutions are interpreted as the intersections of circles, where the parameters of the circles depend linearly on the voltages of the neighboring buses

Read more

Summary

A Matrix-Inversion-Free Fixed-Point Method for Distributed Power Flow Analysis

Kishan Prudhvi Guddanti , Student Member, IEEE, Yang Weng , Senior Member, IEEE, and Baosen Zhang , Member, IEEE. While preserving its stable nature, a novel FP equation that is distributed in nature is proposed to calculate the voltage at each bus This distributed computation enables the proposed algorithm to compute the voltages for multi-area networks without sharing private topology information. Centers of the circles representing real and reactive power equations respectively. Vector with concatenation of all real (vk,r ∀k ∈ N (d)) followed by all imaginary (vk,i ∀k ∈ N (d)) voltage parts of the neighboring buses to bus d. Vector of complex voltages at all buses in the power network. Specified net real and reactive power injections at bus i. Radii of the circles representing real and reactive power equations respectively.

INTRODUCTION
Power Flow Equations in Rectangular Coordinates
PV Buses
FIXED POINT EQUATION FOR POWER FLOW
Description of the Distributed FP Algorithm
Basic Block in FP Method
For Numerical Stability
Orthogonal Circle
Point of Intersection
NUMERICAL RESULTS
Performance of Proposed Method
Heavily Loaded Networks
Sensitivity to Initial Conditions
Distributed Approximation-Free Multi-Area Power System Analysis
CONCLUSION
Handling PQ and PV Buses
Bus Type Switching for PV Buses

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.