Fuzzy logic‐based adaptive gravitational search algorithm for optimal tuning of fuzzy‐controlled 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 study proposes an adaptive gravitational search algorithm (AGSA) which carries out adaptation of depreciation law of the gravitational constant and of a parameter in the weighted sum of all forces exerted from the other agents to the iteration index. The adaptation is ensured by a simple single input–two output (SITO) fuzzy block in the algorithm's structure. SITO fuzzy block operates in the iteration domain, the iteration index is the input variable and the gravitational constant and the parameter in the weighted sum of all forces are the output variables. AGSA's convergence is guaranteed by a theorem derived from Popov's hyperstability analysis results. AGSA is embedded in an original design and tuning method for Takagi‐Sugeno proportional‐integral fuzzy controllers (T‐S PI‐FCs) dedicated to servo systems modelled by second‐order models with an integral component and variable parameters. AGSA solves a minimisation‐type optimisation problem based on an objective function which depends on the sensitivity function with respect to process gain variations, therefore a reduced process gain sensitivity is offered. AGSA is validated by a case study that optimally tunes a T‐S PI‐FC for position control of a laboratory servo system.Representative experimental results are presented.
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.000 |
| Open science | 0.001 | 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