Loading…

Conditional central algorithms for worst case set-membership identification and filtering

This paper deals with conditional central estimators in a set membership setting. The role and importance of these algorithms in identification and filtering is illustrated by showing that problems like worst case optimal identification and state filtering, in contexts in which disturbances are desc...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2000-01, Vol.45 (1), p.14-23
Main Authors: Garulli, A., Vicino, A., Zappa, G.
Format: Article
Language:English
Subjects:
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:This paper deals with conditional central estimators in a set membership setting. The role and importance of these algorithms in identification and filtering is illustrated by showing that problems like worst case optimal identification and state filtering, in contexts in which disturbances are described through norm bounds, are reducible to the computation of conditional central algorithms. The conditional Chebyshev center problem is solved for the case when energy norm-bounded disturbances are considered. A closed-form solution is obtained by finding the unique real root of a polynomial equation in a semi-infinite interval.
ISSN:0018-9286
1558-2523
DOI:10.1109/9.827352