Brief Robustness in H∞ identification

  • Authors:

  • P. M. MäKilä;J. R. Partington

  • Affiliations:

  • Automation and Control Institute, Tampere University of Technology, P.O. Box 692, FIN-33101 Tampere, Finland;School of Mathematics, University of Leeds, Leeds LS2 9JT, UK

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2000

Quantified Score

Hi-index 22.15

Visualization

Abstract

We consider identification (in both the time domain, for suitable choices of inputs, and the frequency domain) using a deterministic formulation that is less conservative than the usual worst-case approach, in that it allows for a certain number of outliers. Two new identification methods, the Orlicz and the Top K method, respectively, are proposed and analysed. Theoretical H"~ error bounds for the identified models are provided, and the proposed methods are illustrated by a numerical example.