Adaptive Takagi–Sugeno (T–S) fuzzy observer based fault tolerant control for DC–DC converters with robustness against uncertainties
Bibliographic record
Abstract
Abstract This paper proposes a Takagi–Sugeno fuzzy system model based fault tolerant control scheme for DC–DC converters, which is robust against parameter uncertainties and achieves the output voltage of an ideal converter. The control involves estimating the duty cycle change in the form of a fault parameter required to track the output voltage, in the presence of several uncertain conditions including converter losses, variation in input voltage, and unknown and changing output load. An adaptive law is designed to estimate the fault parameter that guarantees state and parameter error convergence. The adaptive law is derived using the Lyapunov stability theorem and the required parameters are evaluated by solving a linear matrix inequalities optimization problem. The load resistance is estimated in parallel by using a Kalman filter and fed to the fault parameter estimation scheme. Furthermore, a fast and robust method to detect short and open circuit switch faults is also presented. The proposed technique offers a simple, yet effective method to regulate the output voltage under several faulty and uncertain conditions. The proposed technique is tested on a DC–DC boost converter simulation model and the demonstrated MATLAB/Simulink results show the effectiveness of the proposed algorithm.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".