Robust \({\mathcal H}_\infty\)-filtering design with pole placement constraint via linear matrix inequalities (Q1807814): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:23, 1 February 2024

scientific article
Language Label Description Also known as
English
Robust \({\mathcal H}_\infty\)-filtering design with pole placement constraint via linear matrix inequalities
scientific article

    Statements

    Robust \({\mathcal H}_\infty\)-filtering design with pole placement constraint via linear matrix inequalities (English)
    0 references
    0 references
    0 references
    19 December 1999
    0 references
    Consider the linear time-invariant continuous system \(x'(t)= Ax(t)+ Bw(t)\), \(x(0)= x_0\) with state vector \(x(t)\), measurements output vector \(y(t)= Cx(t)+ Dw(t)\), noise signal vector \(w(t)\) and estimated signal \(z(t)= Lx(t)+ Tw(t)\). Here the matrix 6-tuple \((A,B,C,D,L,T)\) is uncertain and belongs to a given convex compact set of polytopic type. A robust filter is designed for which the filtering error is quadratically stable. Conditions for existence of the robust filter are given in terms of linear matrix inequalities (LMI) which can be solved by standard optimization techniques. A filter synthesis procedure under pole placement conditions is also considered. The latter requires the solution of additional LMI's.
    0 references
    0 references
    quadratic stability
    0 references
    robust filter
    0 references
    linear matrix inequalities
    0 references
    filter synthesis
    0 references
    pole placement
    0 references

    Identifiers