The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Optimal linear filtering under parameter uncertainty
Abstract
This paper addresses the problem of designing a guaranteed minimum error variance robust filter for convex bounded parameter uncertainty in the state, output, and input matrices. The design procedure is valid for linear filters that are obtained from the minimization of an upper bound of the error variance holding for all admissible parameter uncertainty. The results provided generalize the ones available in the literature to date in several directions. First, all system matrices can be corrupted by parameter uncertainty, and the admissible uncertainty may be structured. Assuming the order of the uncertain system is known, the optimal robust linear filter is proved to be of the same order as the order of the system. In the present case of convex bounded parameter uncertainty, the basic numerical design tools are linear matrix inequality (LMI) solvers instead of the Riccati equation solvers used for the design of robust filters available in the literature to date. The paper that contains the most important and very recent results on robust filtering is used for comparison purposes. In particular, it is shown that under the same assumptions, our results are generally better as far as the minimization of a guaranteed error variance is considered. Some numerical examples illustrate the theoretical results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
A linear matrix inequality approach to robust H/sub ∞/ filtering
Li, H., & Fu, M. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.622956 · Cited by 414
Control Theory and Design: An Rh2 and Rh Viewpoint
Geromel, J. C., Colaneri, P., & Locatelli, A. (1997) · Medical Entomology and Zoology · Cited by 93
Self-citation
Cited by
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
Metadata
- Authors
- Geromel, J. C.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1999
- Volume
- 47
- Issue
- 1
- Pages
- 168-175
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2111812602
- Cited by
- 283
- References
- 3
- FWCI
- 20.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.