Abstract : 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.
Type de document :
Communication dans un congrès
European Control Conference (ECC03), Sep 2003, Cambridge, United Kingdom. 2003
https://hal.inria.fr/hal-01091712
Contributeur : Frédéric Grognard
<>
Soumis le : vendredi 5 décembre 2014 - 22:07:33
Dernière modification le : mardi 29 mai 2018 - 12:50:49
Document(s) archivé(s) le : lundi 9 mars 2015 - 06:06:30
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. 2003. 〈hal-01091712〉
