Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 728

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

Filtering and smoothing in an H/sup infinity / setting

Khargonekar, P.P., Nagpal, K.M. · 2003 · Proceedings of the 28th IEEE Conference on Decision and Control

Abstract

Consideration is given to the problems of filtering and smoothing for linear systems in an H/sup infinity / setting, i.e. the plant and measurement noises have bounded energies (are in L/sub 2/), but are otherwise arbitrary. Two distinct situations for the initial condition of the system are considered: in one case the initial condition is assumed known; in the other case it is not known, but the initial condition, the plant, and the measurement noise are in some weighted ball of R/sup n/*L/sub 2/. Both finite-horizon and infinite-horizon cases are considered. The authors present necessary and sufficient conditions for the existence of estimators (both filters and smoothers) that achieved a prescribed performance bound and develop algorithms that result in performance within the bounds. They also present the optimal smoother. The approach uses basic quadratic optimization theory in a time-domain setting, as a consequence of which time-varying and time-invariant linear systems can be considered with equal ease.>

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cdc.1989.70148

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 728

Metadata

Authors
Khargonekar, P. P., & Nagpal, K. M.
Venue
Proceedings of the 28th IEEE Conference on Decision and Control
Publisher
IEEE
Published
2003-01-07
Pages
415-420
ISSN
0191-2216 (ISSN-L)
OpenAlex
W2563221010
Cited by
728
References
11
FWCI
73.56
Type
conference paper
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.