Guaranteed systematic simulation of discrete-time systems defined by polynomial expressions via convex relaxations - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Robust and Nonlinear Control Année : 2018

Guaranteed systematic simulation of discrete-time systems defined by polynomial expressions via convex relaxations

Résumé

This paper concerns the simulation of a class of nonlinear discrete-time systems under a set of initial conditions described by a bounding ellipsoid. We derive a procedure allowing the propagation of such ellipsoids through time, which makes it possible to set a guaranteed hard bound on the evolution of the state of the system for all the possible initial conditions. Two versions of this procedure are given, the second of which is slightly less general but less computationally demanding. At the end of the paper, we first show an application of the method in the domain of aerospace engineering; subsequently, three academic examples of applications are presented, two of which come from the theory of fractals. Copyright c
Fichier principal
Vignette du fichier
article_journ_05.pdf (341.15 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01574320 , version 1 (05-04-2019)

Identifiants

Citer

Paolo Massioni, Gérard Scorletti. Guaranteed systematic simulation of discrete-time systems defined by polynomial expressions via convex relaxations. International Journal of Robust and Nonlinear Control, 2018, 28 (3), pp.1062-1073. ⟨10.1002/rnc.3920⟩. ⟨hal-01574320⟩
118 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More