Transient stability constrained optimal power flow using independent dynamic simulation
Bibliographic record
Abstract
Transient stability constrained optimal power flow (TSC‐OPF) is originally a non‐linear optimisation problem with variables and constraints in time domain, which is not easy to deal with directly because of its huge dimension. This study presents an efficient approach to realise TSC‐OPF by introducing an independent dynamics simulation algorithm into the optimisation procedure. In the new approach, the simulation algorithm is used to realise the dynamics constraints and to deduce the transient stability constraint, whereas the optimisation algorithm verifies the steady state and the transient stability constraints together. The new TSC‐OPF has just one more constraint than that of a conventional OPF and can be solved by a conventional OPF algorithm with small modification. Moreover, the new approach makes it easy to improve the accuracy and efficiency of TSC‐OPF, because of its flexibility in choosing machine models and simulation methods, which is important for large power systems. In the study, the proposed approach is tested with two small power systems, where the two‐axis machine model and a mixed time step simulation method are used to assess system transient stability with a 1‐ms time resolution.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".