By Topic

A bounded-error approach to piecewise affine system identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
A. Bemporad ; Dipt. di Ingegneria dell'Informazione, Univ. di Siena, Italy ; A. Garulli ; S. Paoletti ; A. Vicino

This paper proposes a three-stage procedure for parametric identification of piecewise affine autoregressive exogenous (PWARX) models. The first stage simultaneously classifies the data points and estimates the number of submodels and the corresponding parameters by solving the partition into a minimum number of feasible subsystems (MIN PFS) problem for a suitable set of linear complementary inequalities derived from data. Second, a refinement procedure reduces misclassifications and improves parameter estimates. The third stage determines a polyhedral partition of the regressor set via two-class or multiclass linear separation techniques. As a main feature, the algorithm imposes that the identification error is bounded by a quantity δ. Such a bound is a useful tuning parameter to trade off between quality of fit and model complexity. The performance of the proposed PWA system identification procedure is demonstrated via numerical examples and on experimental data from an electronic component placement process in a pick-and-place machine.

Published in:

IEEE Transactions on Automatic Control  (Volume:50 ,  Issue: 10 )