Fast and systematic approach for adjusting ROCOF relay used in islanding detection of SDG
Bibliographic record
Abstract
Frequency‐based relays, commonly used for islanding detection of synchronous distributed generation (SDG), may either have large non‐detection zones (NDZs) or wrongly operate for non‐islanding disturbances unless they are efficiently adjusted. Trial and error simulation‐based methods, employing application region (AR) and/or power imbalance AR (PIAR), are presented in the literature to adjust these relays for quick islanding detection without false trips. However, the associated settings are not optimal and finding them is time‐consuming. In this study, an approach utilising particle swarm optimisation algorithm is proposed to adjust a rate of change of frequency (ROCOF) relay, one of the most effective relays in SDG islanding detection. The proposed approach needs a set of analytical formulas for determining the ROCOF relay performance curve and NDZ as well as AR and PIAR. These formulas are developed to be employed in the relay adjustment. By applying the developed analytical formulas to the optimisation‐based approach, the ROCOF relay is adjusted fast and systematically. It is shown that while the performance of the relay adjusted by the proposed approach is close to the one with setting obtained by corresponding trial and error‐based method, the latter is much more time‐consuming than the former.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 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.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".