Robust stabilization for discrete-time Takagi-Sugeno fuzzy system based on N4SID models
Bibliographic record
Abstract
Purpose Nonlinear systems identification from experimental data without any prior knowledge of the system parameters is a challenge in control and process diagnostic. It determines mathematical model parameters that are able to reproduce the dynamic behavior of a system. This paper aims to combine two fundamental research areas: MIMO state space system identification and nonlinear control system. This combination produces a technique that leads to robust stabilization of a nonlinear Takagi–Sugeno fuzzy system (T-S). Design/methodology/approach The first part of this paper describes the identification based on the Numerical algorithm for Subspace State Space System IDentification (N4SID). The second part, from the identified models of first part, explains how we use the interpolation of linear time invariants models to build a nonlinear multiple model system, T-S model. For demonstration purposes, conditions on stability and stabilization of discrete time, T-S model were discussed. Findings Stability analysis based on the quadratic Lyapunov function to simplify implementation was explained in this paper. The linear matrix inequalities technique obtained from the linearization of the bilinear matrix inequalities was computed. The suggested N4SID2 algorithm had the smallest error value compared to other algorithms for all estimated system matrices. Originality/value The stabilization of the closed-loop discrete time T-S system, using the improved parallel distributed compensation control law, was discussed to reconstruct the state from nonlinear Luenberger observers.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".