RobustH∞ filtering for switched linear discrete-time systems with polytopic uncertainties
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
In this paper, the problem of robust H∞ filtering for switched linear discrete-time systems with polytopic uncertainties is investigated. Based on the mode-switching idea and parameter-dependent stability result, a robust switched linear filter is designed such that the corresponding filtering error system achieves robust asymptotic stability and guarantees a prescribed H∞ performance index for all admissible uncertainties. The existence condition of such filter is derived and formulated in terms of a set of linear matrix inequalities (LMIs) by the introduction of slack variables to eliminate the cross coupling of system matrices and Lyapunov matrices among different subsystems. The desired filter can be constructed by solving the corresponding convex optimization problem, which also provides an optimal H∞ noise-attenuation level bound for the resultant filtering error system. A numerical example is given to show the effectiveness and the potential of the proposed techniques. Copyright © 2006 John Wiley & Sons, Ltd.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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