Computation of Maximal Safe Sets for Switching Systems

DOI10.1109/TAC.2003.822860MaRDI QIDQ5273678zbMATHFDO

Authors Maria D. Di Benedetto, Luca Berardi, Elena De Santis

Publication date 12 July 2017

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

Mathematics Subject Classification ID

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

Cited in

(17)

• 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
• Equivalence of switching linear systems by bisimulation
• Reliability and time-to-failure bounds for discrete-time constrained Markov jump linear systems
• Almost always observable hybrid systems
• Stability results for linear parameter varying and switching systems
• Theory and computation of discrete state space decompositions for hybrid systems
• A new formulation for the safe set problem on graphs
• Discussion on: ``Global regulation of input-saturated discrete-time linear systems subject to persistent disturbances
• Digital idle speed control of automotive engines: a safety problem for hybrid systems
• Stabilizability of linear switching systems
• Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances
• Optimized robust control invariance for linear discrete-time systems: theoretical foundations
• Approximate equivalence and synchronization of metric transition systems
• A complexity reduction approach to detectability of switching systems
• Constrained control of switching systems: a positive invariant approach
• Exact Computation of Maximal Invariant Sets for Safe Markov Chains—Lattice Theoretic Approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273678)