A probabilistic interpretation of set-membership filtering: Application to polynomial systems through polytopic bounding. (August 2016)

• Record Type: Journal Article
• Authors: Benavoli, Alessio; Piga, Dario
• Is Part Of: Automatica. Volume 70(2016)
• Page Start: 158
• Page End: 172
• Publication Date: 2016-08
• Subjects: State estimation -- Filtering -- Set-membership estimation -- Set of probability measures -- Sum-of-squares polynomials; Automatic control -- Periodicals; Automation -- Periodicals; 629.805
• DOI: 10.1016/j.automatica.2016.03.021
• Languages: English
• ISSNs: 0005-1098

Abstract

Abstract: Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a special case of the truncated moment problem in which only the zeroth order moment is known (i.e., the support). By writing the dual of the above semi-infinite linear programming problem, it is shown that, if the nonlinearities in the measurement and process equations are polynomial and if the bounding sets for initial state, process and measurement noises are described by polynomial inequalities, then an approximation of this semi-infinite linear programming problem can efficiently be obtained by using the theory of sum-of-squares polynomial optimization. We then derive a smart greedy procedure to compute a polytopic outer-approximation of the true membership-set, by computing the minimum-volume polytope that outer-bounds the set that includes all the means computed with respect to P .