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
Domaines
Automatique / RobotiqueOrigine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...