Exponential<i>H</i><sub>∞</sub>filtering for uncertain discrete‐time switched linear systems with average dwell time: A µ‐dependent approach
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
Abstract In this paper, the problem of exponential H ∞ filter problem for a class of discrete‐time polytopic uncertain switched linear systems with average dwell time switching is investigated. The exponential stability result of the general discrete‐time switched systems using a discontinuous piecewise Lyapunov function approach is first explored. Then, a new µ‐ dependent approach is proposed, which means the analysis or synthesis of the underlying systems is dependent on the increase degree µ of the piecewise Lyapunov function at the switching instants. A mode‐dependent full‐order filter is designed such that the developed filter error system is robustly exponentially stable and achieves an exponential H ∞ performance. Sufficient existence conditions for the desired filter are derived and formulated in terms of a set of linear matrix inequalities, and consequently the minimal average dwell time and the corresponding filter are obtained from such conditions for a given system decay degree. A numerical example is presented to demonstrate the potential and effectiveness of the developed theoretical results. Copyright © 2007 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.001 | 0.000 |
| 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.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