SSCI Damping Controller Design for Series-Compensated DFIG-Based Wind Parks Considering Implementation Challenges
Bibliographic record
Abstract
The use of supplementary controllers for mitigating subsynchronous control interaction (SSCI) in doubly-fed induction generator based wind parks is quite promising due to their low investment costs. These SSCI damping controllers are typically designed and tested using an aggregated wind turbine (WT) model that represents the entire wind park (WP). However, no research has been reported on their implementations in a realistic WP. This paper, first presents various implementation schemes for a linear-quadratic regulator based SSCI damping controller, and discusses the corresponding practical challenges. Then, an implementation scheme that obviates the need for high rate data transfer between the WTs and the WP secondary control layer is proposed. In the proposed implementation, the SSCI damping controller receives only the WT outage information updates from the WP controller, hence it is not vulnerable to the variable communication network latency. The SSCI damping controller parameters are also modified when there is a change in WT outage information for the ultimate performance. The effectiveness of the proposed implementation scheme is confirmed with detailed electromagnetic transient simulations, considering different wind speeds at each WT and WT outages due to sudden decrease in wind speeds.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.000 |
| Open science | 0.001 | 0.000 |
| 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".