In this paper, a procedure for the recursive approximation of the feasible parameter set of a linear model with a set membership uncertainty description is provided. Approximating regions of parallelotopic shape are considered. The new contribution of this paper consists in devising a general procedure allowing for block processing of q > 1 measurements at each recursion step. Based on this, several approximation strategies for polytopes are presented. Simulation experiments are performed, showing the effectiveness of the algorithm as compared to the original algorithm processing one measurement at each step.

L., C., Garulli, A., Vicino, A., & G., Z. (1998). Block recursive parallelotopic bounding in set membership identification. AUTOMATICA, 34(1), 15-22 [10.1016/S0005-1098(97)00160-X].

Block recursive parallelotopic bounding in set membership identification

GARULLI, ANDREA;VICINO, ANTONIO;
1998

Abstract

In this paper, a procedure for the recursive approximation of the feasible parameter set of a linear model with a set membership uncertainty description is provided. Approximating regions of parallelotopic shape are considered. The new contribution of this paper consists in devising a general procedure allowing for block processing of q > 1 measurements at each recursion step. Based on this, several approximation strategies for polytopes are presented. Simulation experiments are performed, showing the effectiveness of the algorithm as compared to the original algorithm processing one measurement at each step.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: http://hdl.handle.net/11365/8828
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo