Computation of time-optimal switchings for linear systems with complex poles - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Computation of time-optimal switchings for linear systems with complex poles

Résumé

The minimum-time bounded control of linear systems is generically bang-bang and the number of switchings does not exceed the dimension of the system if the eigenvalues of the system matrix are real or if the initial condition is sufficiently close to the target. This paper extends the method of Grognard & Sepulchre (2001) for computing the switching times of time-optimal controllers to linear systems with complex poles and demonstrates its application on MPC schemes.
Fichier principal
Vignette du fichier
articleECC3.pdf (285.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01091712 , version 1 (05-12-2014)

Identifiants

  • HAL Id : hal-01091712 , version 1

Citer

Frédéric Grognard, Rodolphe Sepulchre. Computation of time-optimal switchings for linear systems with complex poles. European Control Conference (ECC03), Sep 2003, Cambridge, United Kingdom. ⟨hal-01091712⟩
281 Consultations
113 Téléchargements

Partager

Gmail Facebook X LinkedIn More