Deciding the boundedness and dead-beat stability of constrained switching systems
From MaRDI portal
Publication:2374570
DOI10.1016/J.NAHS.2016.03.001zbMATH Open1351.93124arXiv1512.04887OpenAlexW2963725623MaRDI QIDQ2374570FDOQ2374570
Authors: Matthew Philippe, G. Millerioux, Raphaël M. Jungers 
Publication date: 15 December 2016
Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)
Abstract: We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the maximal exponential growth rate equals one. The condition generalizes the notion of the irreducibility of a matrix set, which is a well known sufficient condition for boundedness in the arbitrary switching (i.e. unconstrained) case. Second, we provide a polynomial time algorithm for deciding the dead-beat stability of a system, i.e. that all trajectories vanish to the origin in finite time. The algorithm generalizes one proposed by Gurvits for arbitrary switching systems, and is illustrated with a real-world case study.
Full work available at URL: https://arxiv.org/abs/1512.04887
Recommendations
- On Stabilizability of Switched Linear Systems Under Restricted Switching
- Stability of discrete-time switching systems with constrained switching sequences
- Stabilization of a class of switched systems with state constraints
- Reachability analysis of constrained switched linear systems
- Dead-Beat Stabilizability of Discrete-Time Switched Linear Systems: Algorithms and Applications
- Stabilization of switched linear systems with constrained inputs
- Finite-time boundedness and stabilization of switched linear systems
- Stability of Continuous Time Linear Systems with Bounded Switching Intervals
- Stabilizing switched nonlinear systems under restricted switching
- Stability of uniformly bounded switched systems and observability
Linear systems in control theory (93C05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Discrete-time control/observation systems (93C55) Asymptotic stability in control theory (93D20)
Cites Work
- Title not available (Why is that?)
- Stability Criteria for Switched and Hybrid Systems
- Synchronizing Automata and the Černý Conjecture
- Basic problems in stability and design of switched systems
- Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results
- The boundedness of all products of a pair of matrices is undecidable
- Joint spectral radius and path-complete graph Lyapunov functions
- Bounded semigroups of matrices
- Exact computation of joint spectral characteristics of linear operators
- The Berger-Wang formula for the Markovian joint spectral radius
- Uniform stabilization of discrete-time switched and Markovian jump linear systems
- Stabilizing Switching Signals for Switched Systems
- Control of Linear Switched Systems With Receding Horizon Modal Information
- A sufficient condition for the boundedness of matrix products accepted by an automaton
- Stability of discrete-time switching systems with constrained switching sequences
- Compositional Modeling and Analysis of Multi-Hop Control Networks
- A Gel'fand-type spectral radius formula and stability of linear constrained switching systems
- Parameter dependent Lyapunov functions for discrete time systems with time varying parametric uncertainties
- Invertibility and Flatness of Switched Linear Discrete-Time Systems
- The common invariant subspace problem: an approach via Gröbner bases
- State Deadbeat Response and Observability in Multi-Modal Systems
- Nilpotent semigroups for the characterization of flat outputs of switched linear and LPV discrete-time systems
- Flatness of Switched Linear Discrete-Time Systems
Cited In (7)
- A sufficient condition for the boundedness of matrix products accepted by an automaton
- Linear switched dynamical systems on graphs
- Stability of discrete-time switching systems with constrained switching sequences
- On the length of switching intervals of a stable dynamical system
- Characterization of flat outputs of switched linear discrete-time systems: algebraic condition and algorithm
- Stability of Continuous Time Linear Systems with Bounded Switching Intervals
- Switching systems with dwell time: computing the maximal Lyapunov exponent
This page was built for publication: Deciding the boundedness and dead-beat stability of constrained switching systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374570)
