This note considers the problem of identifying a discrete-time nonlinear system, within a finite family of possible models, from data sequences of a finite length. The problem is approached by resorting to the notion of output distinguishability. This amounts to asking whether output data sequences generated by different models can be distinguished from one another. A number of results are presented with examples. Connections with conditions for linear systems are established.
Distinguishability of Discrete-time Nonlinear Systems / M. Baglietto; G. Battistelli; P. Tesi. - In: IEEE TRANSACTIONS ON AUTOMATIC CONTROL. - ISSN 0018-9286. - STAMPA. - 59:(2014), pp. 1014-1020. [10.1109/TAC.2013.2283132]
Distinguishability of Discrete-time Nonlinear Systems
BATTISTELLI, GIORGIO;TESI, PIETRO
2014
Abstract
This note considers the problem of identifying a discrete-time nonlinear system, within a finite family of possible models, from data sequences of a finite length. The problem is approached by resorting to the notion of output distinguishability. This amounts to asking whether output data sequences generated by different models can be distinguished from one another. A number of results are presented with examples. Connections with conditions for linear systems are established.File | Dimensione | Formato | |
---|---|---|---|
DIST_TAC_2014.pdf
Accesso chiuso
Descrizione: Versione pubblicata
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
1.4 MB
Formato
Adobe PDF
|
1.4 MB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.