HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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

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.
Complete list of metadata

Contributor : Frédéric Grognard Connect in order to contact the contributor
Submitted on : Friday, December 5, 2014 - 10:07:33 PM
Last modification on : Tuesday, December 14, 2021 - 3:17:11 AM
Long-term archiving on: : Monday, March 9, 2015 - 6:06:30 AM


Files produced by the author(s)


  • HAL Id : hal-01091712, version 1


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⟩



Record views


Files downloads