Robust \(H_2/H_{\infty}\) filtering for linear systems with error variance constraints (Q2760881)

From MaRDI portal





scientific article; zbMATH DE number 1682385
Language Label Description Also known as
English
Robust \(H_2/H_{\infty}\) filtering for linear systems with error variance constraints
scientific article; zbMATH DE number 1682385

    Statements

    0 references
    0 references
    13 December 2001
    0 references
    filtering problem
    0 references
    Riccati type equation
    0 references
    uncertain system
    0 references
    Robust \(H_2/H_{\infty}\) filtering for linear systems with error variance constraints (English)
    0 references
    The authors deal with the following class of linear uncertain continuous time systems: NEWLINE\[NEWLINE\dot x(t)=(A+\Delta A)x(t)+D_1w(t);\quad y(t)=(C+\Delta C)x(t)+D_2w(t),NEWLINE\]NEWLINE where \(x\in{\mathbb R}^n\), \(y\in{\mathbb R}^p\), \(w(t)\) is a Gaussian white noise and \(A,C,D_1,D_2\) are known constant matrices. The linear full-order filter under consideration is determined by \(\dot{\widehat{x}}(t)=G\widehat{x}(t)+Ky(t)\), where \(\widehat{x}(t)\) denotes the state estimate and \(G,K\) are filter parameters to be determined. The corresponding discrete time system is considered, too. The problem is to find a linear filtering procedure that does not depend on the parameter perturbations such that: the filtering process is asymptotically stable; the variance of the estimation is not greater than the prescribed value; the transfer function from noise inputs to error state outputs is not greater than the prescribed \(H_{\infty}\) norm upper bound. The authors show that in both continuous and discrete time cases the considered filtering problem can be solved in terms of solutions of the corresponding algebraic Riccati type equations/inequalities. A numerical example demonstrates the performance of the proposed algorithms.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references