CUED Publications database

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

Grognard, F and Sepulchre, R (2003) Computation of time-optimal switchings for linear systems with complex poles. In: UNSPECIFIED pp. 2190-2195..

Full text not available from this repository.

Abstract

© 2003 EUCA. 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 [8] for computing the switching times of time-optimal controllers to linear systems with complex poles and demonstrates its application on MPC schemes.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Subjects: UNSPECIFIED
Divisions: Div F > Control
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 19:42
Last Modified: 24 Oct 2019 13:24
DOI: