Konstantinos Smpoukis

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general setting, a switching sequence is admissible if it is accepted by an automaton. For this family of systems, stability does(More)
We study discrete time linear constrained switching systems with additive disturbances, in the general setting where the switching acts on the system matrices, the disturbance sets, and the state constraint sets. Our primary goal is to extend the existing invariant set constructions when the switching signal is constrained by a given automation. We achieve(More)
We study discrete time linear switching systems subject to additive disturbances. We consider two types of constraints, namely on the states and on the switching signal. A switching sequence is admissible if it is accepted by an automaton. Contrary to the arbitrary switching case, stability does not imply the existence of an invariant<sup>1</sup> set. In(More)
  • 1