Classical prediction error minimization (PEM) methods are widely used for model identification, but they are also known to provide satisfactory results only in specific identification conditions, e.g. disturbance model matching. If these conditions are not met, the obtained model may have quite different dynamical behavior compared with the original system, resulting in poor long range prediction or simulation performance, which is a critical factor for model analysis, simulation, model-based control design. In the mentioned non-ideal conditions a robust and reliable alternative is based on the minimization of the simulation error. Unfortunately, direct optimization of a simulation error minimization (SEM) criterion is an intrinsically complex and computationally intensive task. In this paper a low-complexity approximate SEM approach is discussed, based on the iteration of multi-step PEM methods. The soundness of the proposed approach is demonstrated by showing that, for sufficiently high prediction horizons, the k-steps ahead (single- or multi-step) PEM criteria converge to the SEM one. Identifiability issues and convergence properties of the algorithm are also discussed. Some examples are provided to illustrate the mentioned properties of the algorithm.

Simulation error minimization identification based on multi-stage prediction

FARINA, MARCELLO;PIRODDI, LUIGI
2011-01-01

Abstract

Classical prediction error minimization (PEM) methods are widely used for model identification, but they are also known to provide satisfactory results only in specific identification conditions, e.g. disturbance model matching. If these conditions are not met, the obtained model may have quite different dynamical behavior compared with the original system, resulting in poor long range prediction or simulation performance, which is a critical factor for model analysis, simulation, model-based control design. In the mentioned non-ideal conditions a robust and reliable alternative is based on the minimization of the simulation error. Unfortunately, direct optimization of a simulation error minimization (SEM) criterion is an intrinsically complex and computationally intensive task. In this paper a low-complexity approximate SEM approach is discussed, based on the iteration of multi-step PEM methods. The soundness of the proposed approach is demonstrated by showing that, for sufficiently high prediction horizons, the k-steps ahead (single- or multi-step) PEM criteria converge to the SEM one. Identifiability issues and convergence properties of the algorithm are also discussed. Some examples are provided to illustrate the mentioned properties of the algorithm.
2011
AUT
File in questo prodotto:
File Dimensione Formato  
2011 - IJACSP - FarinaPiroddi.pdf

Accesso riservato

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 190.76 kB
Formato Adobe PDF
190.76 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/577316
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 14
social impact