Converging Approximations of Attractors via Almost Lyapunov Functions and Semidefinite Programming - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Article Dans Une Revue IEEE Control Systems Letters Année : 2022

Converging Approximations of Attractors via Almost Lyapunov Functions and Semidefinite Programming

Corbinian Schlosser

Résumé

In this paper we combine the approaches from [21] and [11] for approximating global attractors. In [21] the global attractors is arbitrarily well approximated by sets that are not necessarily positively invariant. On the contrary, the method from [11] provides supersets of the global attractor which are positively invariant but not necessarily converging. In this paper we marry both approaches by combining their techniques and get converging outer approximations of the global attractor consisting of positively invariant sets. Because both the methods from [21] and [11] are based on convex optimization via sum-of-squares techniques the same is true for our proposed method. The method is easy to use and numerical examples illustrate the procedure.
Fichier principal
Vignette du fichier
root.pdf (509.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03740699 , version 1 (29-07-2022)

Identifiants

Citer

Corbinian Schlosser. Converging Approximations of Attractors via Almost Lyapunov Functions and Semidefinite Programming. IEEE Control Systems Letters, 2022, 6, pp.2912-2917. ⟨10.1109/LCSYS.2022.3180110⟩. ⟨hal-03740699⟩
34 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More