A novel PI gain scheduler for a vector controlled doubly-fed wind driven induction generator
Bibliographic record
Abstract
Wound-rotor induction generator has numerous advantages in wind power generation over other generators. One scheme for wound-rotor induction generator is realized when a converter cascade is used between the slip-ring terminals and the utility grid to control the rotor power. This configuration is called the doubly-fed induction generator (DFIG). A vector control scheme is developed to control the rotor side voltage-source converter. This scheme allows the independent control of the generated active and reactive power as well as the rotor speed to track the maximum wind power point. Conventionally, the controller type used in vector controllers is of the PI type with a fixed proportional and integral gain. In this paper, a simple yet efficient way by which the controller can change its behavior is proposed. In the proposed controller, different characteristics representing the variation in the proportional and the integral gains as a function of the absolute value of the discrepancy between the set speed (for max. power generation) and the actual rotor speed, i.e. the error, is used. These characteristics are expressed by linear, exponential, piece wise linear, second- and fourth-order functions. The transient speed responses using the aforementioned characteristics are compared with the ones determined by using the conventional PI controller with fixed gains. By using the proposed controller, it can be seen that more accurate control and quicker transient response is achieved for different operating conditions
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.001 | 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.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".