Worst-case identification of nonlinear fading memory systems

DOI10.1016/0005-1098(94)00131-2MaRDI QIDQ1893013zbMATH OpenOpenAlexFDO

Authors Munther A. Dahleh, David N. C. Tse, John N. Tsitsiklis, Eduardo D. Sontag

Publication date 28 November 1995

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0005-1098(94)00131-2

Mathematics Subject Classification ID

Spline approximation (41A15) System identification (93B30) Sensitivity (robustness) (93B35) Nonlinear systems in control theory (93C10) Perturbations in control/observation systems (93C73)

Review text

Asymptotic identification of a general class of fading memory nonlinear systems in the presence of bounded additive output noise is investigated. The worst-case asymptotic error as a measure of identification accuracy is used. A characterization of asymptotically optimal algorithms and optimal asymptotic errors is given, and optimal persistently exciting inputs minimizing the radius of the worst-case uncertainty set are then specified. Consequently, a convergent algorithm independent of the noise upper bound is provided. The algorithm is based on interpolating measured data with multivariate piecewise-linear spline functions, which are shown to be better suited for identification under presence of bounded noise than e.g. polynomials.

Recommendations

• Optimal asymptotic identification under bounded disturbances
• Worst-case errors of linear algorithms for identification in H
• Worst-case input-output identification
• Worst-case conditional system identification in a general class of norms
• Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms

Cites work

• Analysis of linear methods for robust identification in \(\ell_ 1\)
• Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
• Controller design for plants with structured uncertainty
• Fading memory and the problem of approximating nonlinear operators with Volterra series
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3997615 (Why is no real title available?)
• scientific article; zbMATH DE number 806815 (Why is no real title available?)
• Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
• On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous time
• On the time complexity of worst-case system identification
• Optimal asymptotic identification under bounded disturbances
• Optimal experiment design for dynamic system identification
• Optimal input signals for parameter estimation in dynamic systems--Survey and new results
• Robust convergence of two-stage nonlinear algorithms for identification in \({\mathcal H}_ \infty\)
• Robust identification and Galois sequences
• The sample complexity of worst-case identification of FIR linear systems
• Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds

Cited in

(6)

• Fading memory and stability.
• Rational wavelets in Wiener-like modeling
• On learning the input-output behaviour of nonlinear fading memory systems from finite data
• Set membership inversion and robust control from data of nonlinear systems
• Nonparametric output prediction for nonlinear fading memory systems
• Adaptive memory in multi-model switching control of uncertain plants

This page was built for publication: Worst-case identification of nonlinear fading memory systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893013)