This paper proposes a three-stage procedure for parametric identification of piece wise affine auto regressive exogenous (PWARX) models. The first stage simultaneously classifies the data points and estimates the number of submodels and the corresponding parameters by solving the MIN PFS problem (partition into a minimum number of feasible subsystems) for a set of linear complementary inequalities derived from input-output data. Then, a refinement procedure reduces misclassifications and improves parameter estimates. The last stage determines a polyhedral partition of the regressor set via two-class or multi-class linear separation techniques. As a main feature, the algorithm imposes that the identification error is bounded by a fixed quantity. Such a bound is a useful tuning parameter to trade off between quality of fit and model complexity. Ideas for efficiently addressing the MIN PFS problem, and for improving data classification are also discussed in the paper. The performance of the proposed identification procedure is demonstrated on experimental data from an electronic component placement process in a pick-and-place machine.

A., B., Garulli, A., Paoletti, S., & Vicino, A. (2004). Data classification and parameter estimation for the identification of piecewise affine models. In Proc. of 43rd IEEE Conference on Decision and Control (pp.20-25). IEEE [10.1109/CDC.2004.1428600].

Data classification and parameter estimation for the identification of piecewise affine models

GARULLI, ANDREA;PAOLETTI, SIMONE;VICINO, ANTONIO
2004

Abstract

This paper proposes a three-stage procedure for parametric identification of piece wise affine auto regressive exogenous (PWARX) models. The first stage simultaneously classifies the data points and estimates the number of submodels and the corresponding parameters by solving the MIN PFS problem (partition into a minimum number of feasible subsystems) for a set of linear complementary inequalities derived from input-output data. Then, a refinement procedure reduces misclassifications and improves parameter estimates. The last stage determines a polyhedral partition of the regressor set via two-class or multi-class linear separation techniques. As a main feature, the algorithm imposes that the identification error is bounded by a fixed quantity. Such a bound is a useful tuning parameter to trade off between quality of fit and model complexity. Ideas for efficiently addressing the MIN PFS problem, and for improving data classification are also discussed in the paper. The performance of the proposed identification procedure is demonstrated on experimental data from an electronic component placement process in a pick-and-place machine.
0780386825
A., B., Garulli, A., Paoletti, S., & Vicino, A. (2004). Data classification and parameter estimation for the identification of piecewise affine models. In Proc. of 43rd IEEE Conference on Decision and Control (pp.20-25). IEEE [10.1109/CDC.2004.1428600].
File in questo prodotto:
File Dimensione Formato  
BGPV04.pdf

non disponibili

Tipologia: Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 154.82 kB
Formato Adobe PDF
154.82 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

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/25149
 Attenzione

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