A systematic study of fuzzy PID controllers-function-based evaluation approach
Bibliographic record
Abstract
A function-based evaluation approach is proposed for a systematic study of fuzzy proportional-integral-derivative (PID)-like controllers. This approach is applied for deriving process-independent design guidelines from addressing two issues: simplicity and nonlinearity. To examine the simplicity of fuzzy PID controllers, we conclude that direct-action controllers exhibit simpler design properties than gain-scheduling controllers. Then, we evaluate the inference structures of direct-action controllers in five criteria: control-action composition, input coupling, gain dependency, gain-role change, and rule/parameter growth. Three types of fuzzy PID controllers, using one-, two- and three-input inference structures, are analyzed. The results, according to the criteria, demonstrate some shortcomings in Mamdani's two-input controllers. For keeping the simplicity feature like a linear PID controller, a one-input fuzzy PID controller with "one-to-three" mapping inference engine is recommended. We discuss three evaluation approaches in a nonlinear approximation study: function-estimation-based, generalization-capability-based and nonlinearity-variation-based approximations. The study focuses on the last approach. A nonlinearity evaluation is then performed for several one-input fuzzy PID controllers based on two measures: nonlinearity variation index and linearity approximation index. Using these quantitative indices, one can make a reasonable selection of fuzzy reasoning mechanisms and membership functions without requiring any process information. From the study we observed that the Zadeh-Mamdani's "max-min-gravity" scheme produces the highest score in terms of nonlinearity variations, which is superior to other schemes, such as Mizumoto's "product-sum-gravity" and "Takagi-Sugeno-Kang" schemes.
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.009 | 0.014 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".