A New Sum-of-Squares Design Framework for Robust Control of Polynomial Fuzzy Systems With Uncertainties

This paper presents a new sum-of-squares (SOS, for brevity) design framework for robust control of polynomial fuzzy systems with uncertainties. Two kinds of robust stabilization conditions are derived in terms of SOS. One is global SOS robust stabilization conditions that guarantee the global and as...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on fuzzy systems 2016-02, Vol.24 (1), p.94-110
Hauptverfasser: Tanaka, Kazuo, Tanaka, Motoyasu, Chen, Ying-Jen, Wang, Hua O.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a new sum-of-squares (SOS, for brevity) design framework for robust control of polynomial fuzzy systems with uncertainties. Two kinds of robust stabilization conditions are derived in terms of SOS. One is global SOS robust stabilization conditions that guarantee the global and asymptotical stability of polynomial fuzzy control systems. The other is semiglobal SOS robust stabilization conditions. The latter is available for very complicated systems that are difficult to guarantee the global and asymptotical stability of polynomial fuzzy control systems. The main feature of all the SOS robust stabilization conditions derived in this paper are to be expressed as nonconvex formulations with respect to polynomial Lyapunov function parameters and polynomial feedback gains. Since a typical transformation from nonconvex SOS design conditions to convex SOS design conditions often results in some conservative issues, the new design framework presented in this paper gives key ideas to avoid the conservative issues. The first key idea is that we directly solve nonconvex SOS design conditions without applying the typical transformation. The second key idea is that we bring a so-called copositivity concept. These ideas provide some advantages in addition to relaxations. To solve our SOS robust stabilization conditions efficiently, we introduce a gradient algorithm formulated as a minimizing optimization problem of the upper bound of the time derivative of an SOS polynomial that can be regarded as a candidate of polynomial Lyapunov functions. Three design examples are provided to illustrate the validity and applicability of the proposed design framework. The examples demonstrate advantages of our new SOS design framework for the existing linear matrix inequality approaches and the existing convex SOS approach.
ISSN:1063-6706
1941-0034
DOI:10.1109/TFUZZ.2015.2426719