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

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.