Slime Mould Algorithm-Based Tuning of Cost-Effective Fuzzy Controllers for Servo Systems
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
This paper suggests five new contributions with respect to the state-of-the-art. First, the optimal tuning of cost-effective fuzzy controllers represented by Takagi-Sugeno-Kang proportional-integral fuzzy controllers (TSK PI-FCs) is carried out using a fresh metaheuristic algorithm, namely the Slime Mould Algorithm (SMA), and a fuzzy controller tuning approach is offered. Second, a relatively easily understandable formulation of SMA is offered. Third, a real-world application of SMA is given, focusing on the optimal tuning of TSK PI-FCs for nonlinear servo systems in terms of optimization problems that target the minimization of discrete-time cost functions defined as the sum of time multiplied by squared control error. Fourth, using the concept of improving the performance of metaheuristic algorithms with information feedback models, proposed by Wang and Tan, Improving metaheuristic algorithms with information feedback models, IEEE Trans. Cybern. 49 (2019), 542-555, Gu and Wang, Improving NSGA-III algorithms with information feedback models for large-scale many-objective optimization, Fut. Gen. Comput. Syst. 107 (2020), 49-69, and Zhang et al., Enhancing MOEA/D with information feedback models for large-scale many-objective optimization, Inf. Sci. 522 ( Fifth, the real-time validation of the cost-effective fuzzy controllers and their tuning approach is performed in the framework of angular position control of laboratory servo system. The comparison with other metaheuristic algorithms that solve the same optimization problem for optimal parameter tuning of cost-effective fuzzy controllers suggestively highlights the superiority of SMA. Experimental results are included.
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.002 | 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.001 |
| Open science | 0.002 | 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