In this paper the problem of optimal input design for the identification of Hammerstein models is considered under the assumption that the linear dynamic part of the model is a FIR and that lower and upper bounds are available for the additive measurement errors. The parameters of the Hammerstein model can then be estimated via the identification of a linearized augmented Hammerstein model. External approximations of the feasible intervals for the parameters of the original Hammerstein models are then derived (which may correspond to the actual feasible intervals). This paper deals with the design of input sequences minimizing parameter uncertainty for the linearized augmented Hammerstein model. Some new results are also reported about optimal input design for polynomial non-linear blocks, that may be part of Hammerstein models.
Optimal Input Design for Set-membership Identification of Hammerstein Models
GAY, Paolo
2003-01-01
Abstract
In this paper the problem of optimal input design for the identification of Hammerstein models is considered under the assumption that the linear dynamic part of the model is a FIR and that lower and upper bounds are available for the additive measurement errors. The parameters of the Hammerstein model can then be estimated via the identification of a linearized augmented Hammerstein model. External approximations of the feasible intervals for the parameters of the original Hammerstein models are then derived (which may correspond to the actual feasible intervals). This paper deals with the design of input sequences minimizing parameter uncertainty for the linearized augmented Hammerstein model. Some new results are also reported about optimal input design for polynomial non-linear blocks, that may be part of Hammerstein models.File | Dimensione | Formato | |
---|---|---|---|
International_Journal_Control_2003.pdf
Accesso aperto
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
153.72 kB
Formato
Adobe PDF
|
153.72 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.