Robust H/sub 2//H/sub ∞/ filtering for linear systems with error variance constraints
Bibliographic record
Abstract
In this correspondence, we consider the robust H/sub 2//H/sub /spl infin// filtering problem for linear perturbed systems with steady-state error variance constraints. The purpose of this multiobjective problem is to design a linear filter that does not depend on the parameter perturbations such that the following three performance requirements are simultaneously satisfied. (1) The filtering process is asymptotically stable. (2) The steady-state variance of the estimation error of each state is not more than the individual prespecified value. (3) The transfer function from exogenous noise inputs to error state outputs meets the prespecified H/sub /spl infin// norm upper bound constraint. We show that in both continuous and discrete-time cases, the addressed filtering problem can effectively be solved in terms of the solutions of a couple of algebraic Riccati-like equations/inequalities. We present both the existence conditions and the explicit expression of desired robust filters. An illustrative numerical example is provided to demonstrate the flexibility of the proposed design approach.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| 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".