The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Recursive state estimation: Unknown but bounded errors and system inputs
Abstract
A method is discussed for estimating the state of a linear dynamic system using noisy observations, when the input to the dynamic system and the observation errors are completely unknown except for bounds on their magnitude or energy. The state estimate is actually a set in state space rather than a single vector. The optimum estimate is the smallest calculable set which contains the unknown system state, but it is usually impractical to calculate this set. A recursive algorithm is developed which calculates a time-varying ellipsoid in state space that always contains the system's true state. Unfortunately the algorithm is still unproven in the sense that its performance has not yet been evaluated. The algorithm is closely related in structure but not in performance to the algorithm obtained when the system inputs and observation errors are white Gaussian processes. The algorithm development is motivated by the problem of tracking an evasive target, but the results have wider applications.
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
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
New Results in Linear Filtering and Prediction Theory
Kalman, R. E., & Bucy, R. S. (1961) · Journal of Basic Engineering · doi:10.1115/1.3658902 · Cited by 6,387
The Mathematical Theory of Optimal Processes.
Blum, E. K., Pontryagin, Boltyanskii, Gamkrelidze, & Mishchenko (1963) · The American Mathematical Monthly · doi:10.2307/2312867 · Cited by 4,261
Cited by
Robust model predictive control: A survey
Bemporad, A., & Morari, M. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0109870 · Cited by 1,066
Control and Communication Challenges in Networked Real-Time Systems
Baillieul, J., & Antsaklis, P. J. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887290 · Cited by 924
Recursive state estimation for a set-membership description of uncertainty
Bertsekas, D., & Rhodes, I. (1971) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1971.1099674 · Cited by 719
Optimal estimation theory for dynamic systems with set membership uncertainty
Milanese, M., & Vicino, A. (1991) · Automatica · doi:10.1016/0005-1098(91)90134-n · Cited by 683
Linear Matrix Inequalities In System And Control Theory
Yaz, E. E. (1998) · Proceedings of the IEEE · doi:10.1109/jproc.1998.735454 · Cited by 428
Metadata
- Authors
- Schweppe, F.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1968-02
- Volume
- 13
- Issue
- 1
- Pages
- 22-28
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2103988321
- Cited by
- 952
- References
- 3
- FWCI
- 4.24
- 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: Recursive state estimation: Unknown but bounded errors and system inputs. https://app.cochat.ai/papers/10.1109/tac.1968.1098790
- The paper
- Schweppe, F. (1968). Recursive state estimation: Unknown but bounded errors and system inputs. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1968.1098790
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.