A Novel Steady State Wind Turbine Simulator Using an Inverter Controlled Induction Motor
Bibliographic record
Abstract
This paper presents a new wind turbine simulator for steady state conditions. In order to provide a test platform for wind turbine drive trains, the authors have developed an experimental system to simulate the static characteristics of real wind turbines. This system consists of a 10 hp induction motor (IM), which drives a synchronous generator and is driven by a 10 kW variable-speed drive inverter, and real time control software. A microcontroller, a PC interfaced to a LAB Windows I/O board, and an IGBT inverter-controlled induction motor are used instead of a real wind turbine to supply shaft torque. A control program written in the C language is developed that obtains wind profiles and, by using turbine characteristics and the rotational speed of the IM, calculates the theoretical shaft torque of a real wind turbine. Based on the comparison of the measured torque with this demand torque, the shaft torque of the IM is regulated accordingly by controlling stator current demand and frequency demand of an inverter. In this way, the relationships between shaft rotating speed, shaft torque of the IM and wind speed are made to conform to the characteristics of a real wind turbine. The drive is controlled using the measured shaft torque directly, instead of estimating it as conventional drives do.
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.000 |
| 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.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".