Recursive \(l^1\) robust identification algorithms (Q2725415)

From MaRDI portal





scientific article; zbMATH DE number 1619208
Language Label Description Also known as
English
Recursive \(l^1\) robust identification algorithms
scientific article; zbMATH DE number 1619208

    Statements

    0 references
    0 references
    0 references
    2 January 2002
    0 references
    recursive \(l^1\) robust identification
    0 references
    model set
    0 references
    fixed data window
    0 references
    error bound
    0 references
    convergence
    0 references
    Recursive \(l^1\) robust identification algorithms (English)
    0 references
    The authors consider the problem of \(l^1\) robust identification for dynamic systems with norm bounded, unstructured uncertainty. They first show that the set of considered model parameters is a convex polyhedron, assuming less a priori system knowledge and bounded noise. Based on the above result, they propose a simple, recursive algorithm for determining the nominal model and the identification error bound. Moreover, they analyze the convergence of the proposed recursive algorithm. A simulation example is presented to illustrate its effectiveness.
    0 references
    0 references

    Identifiers