Computation of Maximal Safe Sets for Switching Systems
From MaRDI portal
Publication:5273678
DOI10.1109/TAC.2003.822860zbMATH Open1365.93287MaRDI QIDQ5273678FDOQ5273678
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)
Cited In (17)
- Theory and computation of discrete state space decompositions for hybrid systems
- A complexity reduction approach to detectability of switching systems
- Stabilizability of linear switching systems
- Equivalence of switching linear systems by bisimulation
- Stability results for linear parameter varying and switching systems
- Optimized robust control invariance for linear discrete-time systems: theoretical foundations
- Characterization and computation of disturbance invariant sets for constrained switched linear systems with dwell time restriction
- A new formulation for the safe set problem on graphs
- Digital idle speed control of automotive engines: a safety problem for hybrid systems
- Reliability and time-to-failure bounds for discrete-time constrained Markov jump linear systems
- Exact Computation of Maximal Invariant Sets for Safe Markov Chains—Lattice Theoretic Approach
- Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances
- Discussion on: ``Global regulation of input-saturated discrete-time linear systems subject to persistent disturbances
- Constrained control of switching systems: a positive invariant approach
- Almost always observable hybrid systems
- Combinatorial methods for invariance and safety of hybrid systems
- Approximate equivalence and synchronization of metric transition systems
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)
