Binary Search and Fit Algorithm for Improved Voltage Stability Boundary Monitoring

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

This paper introduces a binary search algorithm using second order polynomial fitting to efficiently determine the maximum power transfer to a non-controlled load when accounting for variations in Thévenin voltage magnitude due to non-linearity. This is used for voltage stability boundary monitoring of a power system in real time. The binary search with polynomial fitting (BSPF) is compared to a reference algorithm, which sweeps over different load levels, and a binary search and is shown to improve both runtime and accuracy of results. The assessment method can take advantage of parallelization, which together with the BSPF algorithm makes it possible to determine a margin for each of the 2.000 non-controlled loads in a 3.000 bus test system in less than 6 seconds. This enables early detection of voltage instability in highly dynamic future smart grid based power systems.

Original languageEnglish
Title of host publicationProceedings of 2019 IEEE PES Innovative Smart Grid Technologies Europe, ISGT-Europe 2019
Number of pages5
PublisherIEEE
Publication date1 Sep 2019
Article number8905466
ISBN (Electronic)9781538682180
DOIs
Publication statusPublished - 1 Sep 2019
Event2019 IEEE PES Innovative Smart Grid Technologies Europe, ISGT-Europe 2019 - Bucharest, Romania
Duration: 29 Sep 20192 Oct 2019

Conference

Conference2019 IEEE PES Innovative Smart Grid Technologies Europe, ISGT-Europe 2019
CountryRomania
CityBucharest
Period29/09/201902/10/2019
SeriesProceedings of 2019 IEEE PES Innovative Smart Grid Technologies Europe, ISGT-Europe 2019

Keywords

  • Power system analysis computing
  • Power system stability
  • Real-time assessment
  • Thévenin equivalent

Fingerprint Dive into the research topics of 'Binary Search and Fit Algorithm for Improved Voltage Stability Boundary Monitoring'. Together they form a unique fingerprint.

Cite this