Controlling AVR System Based on Optimal FOPID Controllers: A Comparative Study
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this study different schemes of Fractional Order PID (FOPID) controllers are suggested to maintain the Automatic Voltage Regulator (AVR), the controllers' gains are selected using Gorilla Troops Optimization (GTO) and the fitness function Integral Time Absolute Error (ITAE) is used to monitor and obtain the efficient system behavior.The transient analysis is adopted to adjust and obtain the desired response.the nonlinear FOPID faces these signals with a small period and lowest settling time 0.164 sec., it is superior to conventional FOPID by 75.226% and superior to arctan FOPID by 81.898% in simulation time equal to 5 seconds, it reaches its peak value fast (t=0.126seconds) with a very small value equal to 0.00103 then it will obey the system to a stable level of its desired response efficiently, then the robustness analysis's are tested by adding two external disturbances signals with values equal to 0.3 v, the three controllers suggested conventional FOPID, arctan FOPID, and the nonlinear FOPID controller try to fix the deviation done by these signals, the nonlinear FOPID faces these signal with small time till reach to the stable desired values.The second one is utilized by varying the original gains model for two parts of the system amplifier and sensor to 25% from its real value, the best performance also appeared in the nonlinear controller if compared to the other two controllers in adjusting the system response in a small period of time.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it