Optimal PMU Allocation Strategy for Completely Observable Networks With Enhanced Transient Stability Characteristics
Bibliographic record
Abstract
The installation of phasor measurement units (PMUs) in contemporary electrical networks provides enhanced monitoring and control capabilities of the entire system. However, the placement of additional PMU devices is constrained by the relatively high cost and complicated communication infrastructure. Consequently, optimizing the allocation of PMU units is required to achieve complete visibility of the power system operation while minimizing the associated cost. This paper presents a coherent approach for solving the optimal PMU placement (OPP) in order to reduce the total number of PMUs that is required to completely observe the network. Furthermore, the proposed formulation of the OPP allocation problem considers several objectives such as cost minimization, redundancy and efficiency maximization in addition to various constraints like incorporation of zero-injection buses, single PMU failure, single line outage and consideration of flow measurements. Moreover, a two-stage approach is proposed to ensure the numerical observability of the obtained PMU placement. The proposed framework relies on solving a mixed integer linear programming problem for the OPP placement problem based on conventional measurements. The rank of the gain matrix is thereafter computed to check if the solution is numerically observable. In contrast to reported studies in the literature, transient stability enhancement is augmented in the formulation of the optimization problem such that the redundancy of predetermined buses is guaranteed without increasing the total number of installed PMU units. A novel spectral cluster-based online coherency grouping is employed to identify buses which possess the ideal characteristics in terms of transient stability support.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".