Expectation‐maximization algorithm for bilinear state‐space models with time‐varying delays under non‐Gaussian noise
In this paper, the parameter identification of bilinear state‐space model (SSM) in the presence of random outliers and time‐varying delays is investigated. Under the basis of the observable canonical form of the bilinear model, the system output can be written as a regressive form, and a bilinear st...
Gespeichert in:
| Veröffentlicht in: | International journal of adaptive control and signal processing Jg. 37; H. 10; S. 2706 - 2724 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Bognor Regis
Wiley Subscription Services, Inc
01.10.2023
|
| Schlagworte: | |
| ISSN: | 0890-6327, 1099-1115 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this paper, the parameter identification of bilinear state‐space model (SSM) in the presence of random outliers and time‐varying delays is investigated. Under the basis of the observable canonical form of the bilinear model, the system output can be written as a regressive form, and a bilinear state observer is applied to estimate the unknown states. To eliminate the influence of outliers and time‐varying delays on parameter estimation, we employ the Student's distribution to deal with the measurement noise and use a first‐order Markov chain to model the delays. In the framework of expectation‐maximization (EM) algorithm, the unknown parameters, delays, noise variance, states and transition probability matrix can be estimated iteratively. A numerical simulation and a continuous stirred tank reactor (CSTR) process demonstrate that the proposed algorithm has good immunity against outliers and time‐varying delays and offers good estimation accuracy for the bilinear SSM. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0890-6327 1099-1115 |
| DOI: | 10.1002/acs.3657 |