Optimal Pitch Angle Controller for DFIG-Based Wind Turbine System Using Computational Optimization Techniques
Bibliographic record
Abstract
With the advent of high-speed and parallel computing, the applicability of computational optimization in engineering problems has increased, with greater validation than conventional methods. Pitch angle is an effective variable in extracting maximum wind power in a wind turbine system (WTS). The pitch angle controller contributes to improve the output power at different wind speeds. In this paper, the pitch angle controller with proportional (P) and proportional-integral (PI) controllers is used. The parameters of the controllers are tuned by computational optimization techniques for a doubly-fed induction generator (DFIG)-based WTS. The study is carried out on a 9 MW DFIG based WTS model in MATLAB/SIMULINK. Two computational optimization techniques: particle swarm optimization (PSO), a swarm intelligence algorithm, and a genetic algorithm (GA), an evolutionary algorithm, are applied. A multi-objective, multi-dimensional error function is defined and minimized by selecting an appropriate error criterion for each objective of the function which depicts the relative magnitude of each objective in the error function. The results of the output power flow and the dynamic response of the optimized P and PI controllers are compared with the conventional P and PI controller in three different cases. It is revealed that the PSO-based controllers performed better in comparison with both the conventional controllers and the GA-based controllers.
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.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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".