On the Stability of Interval Type-2 TSK Fuzzy Logic Control 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
Type-2 fuzzy logic systems have recently been utilized in many control processes due to their ability to model uncertainties. This paper proposes a novel inference mechanism for an interval type-2 Takagi-Sugeno-Kang fuzzy logic control system (IT2 TSK FLCS) when antecedents are type-2 fuzzy sets and consequents are crisp numbers (A2-C0). The proposed inference mechanism has a closed form which makes it more feasible to analyze the stability of this FLCS. This paper focuses on control applications for the following cases: 1) Both plant and controller use A2-C0 TSK models, and 2) the plant uses type-1 Takagi-Sugeno (TS) and the controller uses IT2 TS models. In both cases, sufficient stability conditions for the stability of the closed-loop system are derived. Furthermore, novel linear-matrix-inequality-based algorithms are developed for satisfying the stability conditions. Numerical analyses are included which validate the effectiveness of the new inference methods. Case studies reveal that an IT2 TS FLCS using the proposed inference engine clearly outperforms its type-1 TSK counterpart. Moreover, due to the simple nature of the proposed inference engine, it is easy to implement in real-time control systems. The methods presented in this paper lay the mathematical foundations for analyzing the stability and facilitating the design of stabilizing controllers of IT2 TSK FLCSs and IT2 TS FLCSs with significantly improved performance over type-1 approaches.
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.001 | 0.000 |
| 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.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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