Management of Cascading Outage Risk Based on Risk Gradient and Markovian Tree Search
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
Since cascading outages are major threats to power systems, it is important to reduce the risk of potential cascading outages. In this paper, a risk management method of cascading outages based on Markovian tree search is proposed. With the tree expansion on the cascading outage risk, risk gradient is computed efficiently by a forward-backward tree search scheme with good convergence, and it is then employed in an optimization model to minimize control cost while effectively reducing the cascading outage risk. To overcome the limitation with linearization in computing risk gradient, an iterative risk management (IRM) approach is further developed. Tests on the RTS-96 3-area system verify the accuracy of the computed risk gradient and its effectiveness for risk reduction. Time performance of the proposed IRM approach is tested on the RTS-96 system, a 410-bus U.S.-Canada northeast system, and a 1354-bus mid-European system, and demonstrates its potentials for decision support on practical power systems online or on hourly basis.
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