Premium
Guaranteed recursive non‐linear state bounding using interval analysis
Author(s) -
Kieffer Michel,
Jaulin Luc,
Walter Éric
Publication year - 2002
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/acs.680
Subject(s) - bounding overwatch , estimator , bounded function , interval arithmetic , computation , state (computer science) , computer science , interval (graph theory) , mathematical optimization , set (abstract data type) , mathematics , state estimator , algorithm , context (archaeology) , noise (video) , statistics , artificial intelligence , mathematical analysis , paleontology , image (mathematics) , combinatorics , biology , programming language
The problem considered here is state estimation in the presence of unknown but bounded state perturbations and measurement noise. In this context, most available results are for linear models, and the purpose of the present paper is to deal with the non‐linear case. Based on interval analysis and the notion of set inversion, a new state estimator is presented, which evaluates a set estimate guaranteed to contain all values of the state that are consistent with the available observations, given the perturbation and noise bounds and a set containing the initial value of the state. To the best of our knowledge, it is the first estimator for which this claim can be made. The precision of the set estimate can be improved, at the cost of more computation. Theoretical properties of the estimator are studied, and computer implementation receives special attention. A simple illustrative example is treated. Copyright © 2002 John Wiley & Sons, Ltd.