On line H/sub 2/, H/sub infinity / and pointwise uncertainty bound quantification in identification of restricted complexity models

E.-W Bai; S Raman

doi:10.1109/CDC.1992.371133

Back

Conference proceeding

On line H/sub 2/, H/sub infinity / and pointwise uncertainty bound quantification in identification of restricted complexity models

E.-W Bai and S Raman

[1992] Proceedings of the 31st IEEE Conference on Decision and Control, pp.1719-1724 vol.2

IEEE Conference on Decision and Control, 31 (Tucson, Arizona, 12/16/1992–12/18/1992)

1992

DOI: 10.1109/CDC.1992.371133

View Online

Abstract

The authors consider the problem of online uncertainty bound quantification in identification of restricted complexity models. The algorithms presented provide a hard and tight upper bound on the unknown model uncertainty in H/sub 2/, H/sub infinity /, and pointwise senses. The algorithms proposed are simple, online, and recursive. This allows robust control and adaptive identification to be combined.< >

Adaptive control

Programmable control

Robust control

Uncertainty

Upper bound

Details

Title: Subtitle: On line H/sub 2/, H/sub infinity / and pointwise uncertainty bound quantification in identification of restricted complexity models
Creators: E.-W Bai - University of Iowa
S Raman - University of Iowa
Resource Type: Conference proceeding
Publication Details: [1992] Proceedings of the 31st IEEE Conference on Decision and Control, pp.1719-1724 vol.2
Conference: IEEE Conference on Decision and Control, 31 (Tucson, Arizona, 12/16/1992–12/18/1992)
DOI: 10.1109/CDC.1992.371133
Publisher: IEEE
Language: English
Date published: 1992
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984197915302771

Metrics

8 Record Views