Loading web-font TeX/Math/Italic
Uniqueness of Power Flow Solutions Using Graph-Theoretic Notions | IEEE Journals & Magazine | IEEE Xplore

Uniqueness of Power Flow Solutions Using Graph-Theoretic Notions


Abstract:

This article extends the uniqueness theory in (Park et al., 2021) and establishes general necessary and sufficient conditions for the uniqueness of P\Theta power flo...Show More

Abstract:

This article extends the uniqueness theory in (Park et al., 2021) and establishes general necessary and sufficient conditions for the uniqueness of P\Theta power flow solutions in an AC power system using some properties of the monotone regime and the power network topology. We show that the necessary and sufficient conditions can lead to tighter sufficient conditions for the uniqueness in several special cases. Our results are based on the existing notion of maximal girth and our new notion of maximal eye. Moreover, we develop a series–parallel reduction method and search-based algorithms for computing the maximal eye and the maximal girth, which are necessary for the uniqueness analysis. Reduction to a single line using the proposed reduction method is guaranteed for 2-vertex-connected series–parallel graphs. The relations between the parameters of the network before and after reduction are obtained. It is verified on real-world networks that the computation of the maximal eye can be reduced to the analysis of a much smaller power network, while the maximal girth is computed during the reduction process.
Published in: IEEE Transactions on Control of Network Systems ( Volume: 9, Issue: 1, March 2022)
Page(s): 100 - 112
Date of Publication: 25 January 2022

ISSN Information:

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.