Cross-Gramian Model Reduction Approach for Tuning Power System Stabilizers in Large Power Networks
Bibliographic record
Abstract
Poorly damped inter-area modes of oscillations represent a major concern to power system operation since they detain the power transfer capability of transmission networks. This situation becomes more stringent as the tie-lines are heavily stressed and/or large amounts of renewable energy resources are installed. To overcome this issue, a detailed mathematical model is proposed in this paper to reduce the linearized model of a large power system using the cross-Gramian technique. The presented approach divides the system into a study area which contains one generation unit with installed power system stabilizer (PSS) and an external one which comprises the rest of generation units in the system. Model order reduction is only applied to the external area with the objective of maintaining the characteristics of the original model. Meanwhile, the dynamics of the study area are preserved to provide the required damping through the designed PSS. In addition, an online tuning methodology is also presented to provide robust damping performance in response to changes in the system operating conditions. The deployed cross-Gramian model order reduction alleviates the computational burden and time associated with the online PSS tuning when original power system models are used. The effectiveness of the proposed approach is tested using the New-England 39-bus system in addition to another practical system which resembles the Northern Regional Power Grid India test system.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".