An artificial neural network for online tuning of genetic algorithm based PI controller for interior permanent magnet synchronous motor drive
Bibliographic record
Abstract
An artificial neural network (ANN) for online tuning of a genetic algorithm based PI controller for interior permanent magnet synchronous motor (IPMSM) drive is presented in this paper. The proposed controller is developed for accurate speed control of the IPMSM drive under system disturbances. In this work, initially different operating conditions are obtained based on motor dynamics incorporating various uncertainties. At each operating condition a genetic algorithm (GA) is used to optimize proportional-integral (PI) controller parameters in a closed loop vector control scheme. In the optimization procedure a performance index is developed to reflect the minimum speed deviation, minimum settling time and zero steady-state error. A radial basis function network (RBFN) is utilized for online tuning of the PI controller parameters to ensure optimum drive performance under different disturbances. The proposed controller is successfully implemented in real-time using a digital signal processor board DS1102 for a laboratory 1 hp IPMSM. The efficacy of the proposed controller is verified by simulation as well as experimental results at different dynamic operating conditions. The proposed approach is found to be a robust controller for application in the IPMSM drive.
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.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".