z-logo
Premium
Optimal filtering for polynomial system states with polynomial multiplicative noise
Author(s) -
Basin Michael,
Perez Joel,
Skliar Mikhail
Publication year - 2006
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.1055
Subject(s) - multiplicative noise , mathematics , polynomial , kalman filter , noise (video) , multiplicative function , filtering problem , control theory (sociology) , extended kalman filter , computer science , mathematical analysis , statistics , control (management) , signal transfer function , digital signal processing , artificial intelligence , analog signal , computer hardware , image (mathematics)
Abstract In this paper, the optimal filtering problem for polynomial system states with polynomial multiplicative noise over linear observations is treated proceeding from the general expression for the stochastic Ito differential of the optimal estimate and the error variance. As a result, the Ito differentials for the optimal estimate and error variance corresponding to the stated filtering problem are first derived. The procedure for obtaining a closed system of the filtering equations for any polynomial state with polynomial multiplicative noise over linear observations is then established, which yields the explicit closed form of the filtering equations in the particular cases of a linear state equation with linear multiplicative noise and a bilinear state equation with bilinear multiplicative noise. In the example, performance of the designed optimal filter is verified for a quadratic state with a quadratic multiplicative noise over linear observations against the optimal filter for a quadratic state with a state‐independent noise and a conventional extended Kalman–Bucy filter. Copyright © 2006 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here