Computation of Maximal Safe Sets for Switching Systems

DOI10.1109/TAC.2003.822860zbMath1365.93287MaRDI QIDQ5273678

Luca Berardi, Maria Domenica Di Benedetto, Elena De Santis

Publication date: 12 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Related Items (16)

Reliability and time‐to‐failure bounds for discrete‐time constrained Markov jump linear systems ⋮ Almost always observable hybrid systems ⋮ Optimized robust control invariance for linear discrete-time systems: theoretical foundations ⋮ Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances ⋮ Theory and computation of discrete state space decompositions for hybrid systems ⋮ Characterization and computation of disturbance invariant sets for constrained switched linear systems with dwell time restriction ⋮ Combinatorial methods for invariance and safety of hybrid systems ⋮ Constrained control of switching systems: a positive invariant approach ⋮ Stability results for linear parameter varying and switching systems ⋮ Stabilizability of linear switching systems ⋮ A new formulation for the safe set problem on graphs ⋮ Equivalence of switching linear systems by bisimulation ⋮ A complexity reduction approach to detectability of switching systems ⋮ Digital idle speed control of automotive engines: a safety problem for hybrid systems ⋮ Discussion on: ``Global regulation of input-saturated discrete-time linear systems subject to persistent disturbances ⋮ Approximate equivalence and synchronization of metric transition systems

This page was built for publication: Computation of Maximal Safe Sets for Switching Systems