Autor: |
Nishio, Ayres, Do Coutto Filho, Milton Brown, Stacchini de Souza, Julio Cesar, Pereira, Jorge, Zanghi, Eric |
Zdroj: |
Journal of Control, Automation and Electrical Systems; 20240101, Issue: Preprints p1-12, 12p |
Abstrakt: |
As one of the functions integrating energy management systems, state estimation (SE) is instrumental in monitoring power networks, allowing the best possible use of energy resources. It plays a decisive role in debugging if sufficient data are available, ruined if not. Criticality analysis (CA) integrates SE as a module in which elements of the estimation process—taken one-by-one or grouped (tuples of minimal multiple cardinality)—are designated essential. The combinatorial nature of extensive CA (ExtCA), derestricted from identifying only low-cardinality critical tuples, characterizes its computational complexity and imposes defiant limits in implementing it. This paper presents the methodology for ExtCA and compares algorithms to find an efficient solution for expanding the boundaries of this analysis problem. The algorithms used for comparison are one sequential Branch&Bound (a well-known paradigm for combinatorial optimization recently used in ExtCA) and two new parallels implemented on the central processing unit (CPU) and the graphics processing unit (GPU). The conceived parallel architecture favors evaluating massive combinations of diverse cardinality measuring unit (MU) tuples in ExtCA. The acronym MU refers to the aggregate of devices deployed at substations, such as a remote terminal unit, intelligent electronic device, and phasor measurement unit. The numerical results obtained in the paper show significant speed-ups with the novel parallel GPU algorithm, tested on different and real-scale power grids. Since, the visualization of the ExtCA results is still not a well-explored field, this work also presents a novel way of graphically depicting spots of weak observability using MU-oriented ExtCA. |
Databáze: |
Supplemental Index |
Externí odkaz: |
|