2020
DOI: 10.1049/iet-gtd.2019.0760
|View full text |Cite
|
Sign up to set email alerts
|

Allocation of PMU channels at substations for topology processing and state estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…The attack-resistant OPP technique proposed in this research uses reinforcement learning guided tree search to arrange PMUs in a specific order, with the exploration of placement orders being done via reinforcement learning’s sequential decision-making [ 14 ]. The unique aspect of this work is positioning the PMUs so that weak buses can be observed with the most significant possible number of PMUs to determine the system’s full observability and stability under various conditions, such as taking zero injection nodes into account and experiencing a single PMU outage in [ 15 ]. The two distinct stages: in phase 1, the coordination sites in the search tree are examined by depth-first search, and in phase 2, the primary simplex is configured using the basic feasible solution from phase 1 till the global optimum is identified in [ 16 ].…”
Section: Introductionmentioning
confidence: 99%
“…The attack-resistant OPP technique proposed in this research uses reinforcement learning guided tree search to arrange PMUs in a specific order, with the exploration of placement orders being done via reinforcement learning’s sequential decision-making [ 14 ]. The unique aspect of this work is positioning the PMUs so that weak buses can be observed with the most significant possible number of PMUs to determine the system’s full observability and stability under various conditions, such as taking zero injection nodes into account and experiencing a single PMU outage in [ 15 ]. The two distinct stages: in phase 1, the coordination sites in the search tree are examined by depth-first search, and in phase 2, the primary simplex is configured using the basic feasible solution from phase 1 till the global optimum is identified in [ 16 ].…”
Section: Introductionmentioning
confidence: 99%