A LOW-COST APPROACH TO DATA-DRIVEN FUZZY CONTROL OF SERVO SYSTEMS
Bibliographic record
Abstract
Servo systems become more and more important in control systems applications in various fields as both separate control systems and actuators. Ensuring very good control system performance using few information on the servo system model (viewed as a controlled process) is a challenging task. Starting with authors’ results on data-driven model-free control, fuzzy control and the indirect model-free tuning of fuzzy controllers, this paper suggests a low-cost approach to the data-driven fuzzy control of servo systems. The data-driven fuzzy control approach consists of six steps: (i) open-loop data-driven system identification to produce the process model from input-output data expressed as the system step response, (ii) Proportional-Integral (PI) controller tuning using the Extended Symmetrical Optimum (ESO) method, (iii) PI controller parameters mapping onto parameters of Takagi-Sugeno PI-fuzzy controller in terms of the modal equivalence principle, (iv) closed-loop data-driven system identification, (v) PI controller tuning using the ESO method, (vi) PI controller parameters mapping onto parameters of Takagi-Sugeno PI-fuzzy controller. The steps (iv), (v) and (vi) are optional. The approach is applied to the position control of a nonlinear servo system. The experimental results obtained on laboratory equipment validate the approach.
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.001 | 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".