Statistical approach for transient stability constrained optimal power flow
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The transient stability constrained optimal power flow (TSC‐OPF) is a big challenge in the field of power systems because of its high complexity and extensive computation effort involved in its solution. This study presents a new approach to compute the transient stability constraint formulated by the critical clearing time (CCT) in TSC‐OPF. CCT has been determined by dual‐kriging, a space interpolation method which has primarily been used in natural resources evaluation. Given the huge dimensionality of the problem, Pareto analysis is firstly used to reduce the number of input variables in an initial database to those which are significant to compute CCT. With the reduced variables, a new database has been constructed using a design of experiment to obtain a reduced number of observed points. As a result of this approach, the sets of dynamic and transient stability constraints to be considered in the optimisation process are reduced to one single stability constraint with only a few variables. Ultimately, the size of the resulting optimisation problem is almost similar to that of a conventional optimal power flow. The effectiveness of the proposed method is tested on the New England 10‐machine 39‐bus system and the larger 50‐machine 145‐bus power 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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it