The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Linear recursive state estimators under uncertain observations
Abstract
For linear systems with uncertain observations, we investigate the existence of recursive least-squares state estimators. The uncertainty in the observations is caused by a binary switching sequence γk, which is specified by a conditional probability distribution and which enters the observation equation asz_{k} = \gamma_{k} H_{k} x_{k}+\upsilon_{k}. Conditions are established which lead to a recursive filter for xk, and a procedure for constructing a mixture sequence{\gamma_{k}}that satisfies these conditions is given. Such mixture sequences model the transmission of data in multichannels as in remote sensing situations as well as data links with random interruptions. They can also serve as models for communication in the presence of multiplicative noise.
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.
Integrity signals
Registry
Cites
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.
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
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Cited by
Kalman Filtering With Intermittent Observations
Sinopoli, B., Schenato, L., Franceschetti, M., Poolla, K., Jordan, M. I., & Sastry, S. S. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834121 · Cited by 2,544
Stability of Kalman filtering with Markovian packet losses
Huang, M., & Dey, S. (2007) · Automatica · doi:10.1016/j.automatica.2006.10.023 · Cited by 426
Metadata
- Authors
- Hadidi, M., & Schwartz, S.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1979-12
- Volume
- 24
- Issue
- 6
- Pages
- 944-948
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2000491979
- Cited by
- 198
- References
- 1
- FWCI
- 1.96
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear recursive state estimators under uncertain observations. https://app.cochat.ai/papers/10.1109/tac.1979.1102171
- The paper
- Hadidi, M., & Schwartz, S. (1979). Linear recursive state estimators under uncertain observations. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1979.1102171
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.