On the State-Space Realization of LPV Input-Output Models: Practical Approaches

A common problem in the context of linear parameter-varying (LPV) systems is how input-output (IO) models can be efficiently realized in terms of state-space (SS) representations. The problem originates from the fact that in the LPV literature discrete-time identification and modeling of LPV systems...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on control systems technology Jg. 20; H. 1; S. 139 - 153
Hauptverfasser: Toth, R., Abbas, H. S., Werner, H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.01.2012
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:1063-6536, 1558-0865
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A common problem in the context of linear parameter-varying (LPV) systems is how input-output (IO) models can be efficiently realized in terms of state-space (SS) representations. The problem originates from the fact that in the LPV literature discrete-time identification and modeling of LPV systems is often accomplished via IO model structures. However, to utilize these LPV-IO models for control synthesis, commonly it is required to transform them into an equivalent SS form. In general, such a transformation is complicated due to the phenomenon of dynamic dependence (dependence of the resulting representation on time-shifted versions of the scheduling signal). This conversion problem is revisited and practically applicable approaches are suggested which result in discrete-time SS representations that have only static dependence (dependence on the instantaneous value of the scheduling signal). To circumvent complexity, a criterion is also established to decide when an linear-time invariant (LTI)-type of realization approach can be used without introducing significant approximation error. To reduce the order of the resulting SS realization, an LPV Ho-Kalman-type of model reduction approach is introduced, which, besides its simplicity, is capable of reducing even non-stable plants. The proposed approaches are illustrated by application oriented examples.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1063-6536
1558-0865
DOI:10.1109/TCST.2011.2109040