A Fixed-Step Under Frequency Load Shedding Scheme Based on Load Criticality
Bibliographic record
Abstract
Under frequency load shedding (UFLS) schemes are the last resort protection mechanism in order to avoid the collapse of a power system upon a sudden large loss of generation. These schemes disconnect load if the frequency decline exceeds a pre-established threshold. Although existing multi-stage UFLS schemes are not considered an optimal solution, they are widely deployed in practice for their simplicity and reliability. Typically, UFLS operators exclude critical facilities from shedding, while the remaining load is divided among the UFLS stages in an arbitrary way. This current approach does not take into account load sensitivity to outages. In this paper, the concept of a multistage criticality-informed UFLS scheme is introduced to demonstrate the benefits of including high-granularity criticality data in the load assignment process. Employed criticality functions can potentially include social, economic, and demographic data, which are more detailed than the blunt aggregation of loads based on types. In addition, the developed methodology supports time-dependent criticality functions, which are taken into account in the load assignment process. This approach is valid for existing traditional power systems structures, without the need for additional resources. The proposed concept is verified with the Quebec 29-bus system in a MATLAB/Simulink testbed. The results show that the proposed approach effectively constrains the criticality of loads shed across the 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.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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".