Output Error MISO System Identification Using Fractional Models
This paper deals with system identification for continuous-time multiple-input single-output (MISO) fractional differentiation models. An output error optimization algorithm is proposed for estimating all parameters, namely the coefficients and the differentiation orders. Given the high number of pa...
Gespeichert in:
Veröffentlicht in: | Fractional calculus & applied analysis 2021-10, Vol.24 (5), p.1601-1618 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper deals with system identification for continuous-time multiple-input single-output (MISO) fractional differentiation models. An output error optimization algorithm is proposed for estimating all parameters, namely the coefficients and the differentiation orders. Given the high number of parameters to be estimated, the output error method can converge to a local minimum. Therefore, an initialization procedure is proposed to help the convergence to the optimum by using three variants of the algorithm. Moreover, a new definition of structured-commensurability (or S-commensurability) has been introduced to cope with the differentiation order estimation. First, a global S-commensurate order is estimated for all subsystems. Then, local S-commensurate orders are estimated (one for each subsystem). Finally the S-commensurability constraint being released, all differentiation orders are further adjusted. Estimating a global S-commensurate order greatly reduces the number of parameters and helps initializing the second variant, where local S-commensurate orders are estimated which, in turn, are used as a good initial hit for the last variant. It is known that such an initialization procedure progressively increases the number of parameters and provides good efficiency of the optimization algorithm. Monte Carlo simulation analysis are provided to evaluate the performances of this algorithm. |
---|---|
ISSN: | 1311-0454 1314-2224 |
DOI: | 10.1515/fca-2021-0067 |