Sequential approximation of feasible parameter sets for identification with set membership uncertainty

In this paper the problem of approximating the feasible parameter set for identification of a system in a set membership setting is considered. The system model is linear in the unknown parameters. A recursive procedure providing an approximation of the parameter set of interest through parallelotop...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 1996-06, Vol.41 (6), p.774-785
Main Authors: Vicino, A., Zappa, G.
Format: Article
Language:English
Subjects:
Applied sciences
Approximation algorithms
Autoregressive processes
Computational complexity
Computational modeling
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
Measurement uncertainty
Modelling and identification
Robust control
Robust stability
Robustness
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper the problem of approximating the feasible parameter set for identification of a system in a set membership setting is considered. The system model is linear in the unknown parameters. A recursive procedure providing an approximation of the parameter set of interest through parallelotopes is presented, and an efficient algorithm is proposed. Its computational complexity is similar to that of the commonly used ellipsoidal approximation schemes. Numerical results are also reported on some simulation experiments conducted to assess the performance of the proposed algorithm.
ISSN:0018-9286
1558-2523
DOI:10.1109/9.506230