Proving set inclusion via intervals: application to robust stability - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Automatica Année : 1999

Proving set inclusion via intervals: application to robust stability

Résumé

Proving that an uncertain parametric model is stable amounts to prove the inclusion of two sets : the set A of all feasible parameters and the set B of all parameters for which the model is stable. In this paper, a new algorithm, able to decide whether or not A is included in B, is presented. The method is base on interval analysis which is a numerical tool able to deal with inequalities in a global and guaranteed way. Convergence properties of the algorithm are provided. The algorithm is then applied to the robust stability of a discrete-time model where the information on the parameters is given through bounded-error data. The behavior of the algorithm with respect to the number of parameters is illustrated on a continuous-time model.
Fichier principal
Vignette du fichier
jury.pdf (170.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00844570 , version 1 (15-07-2013)

Identifiants

  • HAL Id : hal-00844570 , version 1

Citer

Luc Jaulin, Jacques Burger. Proving set inclusion via intervals: application to robust stability. Automatica, 1999, 35 (4), pp.627-632. ⟨hal-00844570⟩
95 Consultations
114 Téléchargements

Partager

Gmail Facebook X LinkedIn More