A Preventive Dispatching Method for High Wind Power-Integrated Electrical Systems Considering Probabilistic Transient Stability Constraints
Bibliographic record
Abstract
This paper proposes a probabilistic transient stability-constrained preventive dispatching method for power systems under a high inclusion of wind power. First, a set of instability mode (IM)-categorized probabilistic transient stability constraints (PTSCs) are constructed, which facilitate the development of a dispatching plan against various fault scenarios. Next, to avoid massive transient stability simulations in each dispatching operation, a machine learning-based model is trained to predict the critical clearing time (CCT) and IM for all preconceived fault scenarios. Based on the predictions, the system operation plan is assessed with respect to the PTSCs. Then, the sensitivity of the probabilistic level of the CCT is calculated to the active power generated from the critical generators for each IM category. Accordingly, the implicit PTSCs are converted into explicit dispatching constraints, and the dispatch is rescheduled to ensure the probabilistic stability requirements of the system are met at an economical operating cost. The proposed approach is validated on two modified IEEE test systems, reporting high computational efficiency and high-quality solutions.
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.001 |
| 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.001 | 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".