Stability of discrete-time switching systems with constrained switching sequences

We introduce a novel framework for the stability analysis of discrete-time linear switching systems with switching sequences constrained by an automaton. The key element of the framework is the algebraic concept of multinorm, which associates a different norm per node of the automaton, and allows to...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) 2016-10, Vol.72, p.242-250
Main Authors: Philippe, Matthew, Essick, Ray, Dullerud, Geir E., Jungers, Raphaël M.
Format: Article
Language:English
Subjects:
Automata
Discrete-time linear switching systems
Stability analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a novel framework for the stability analysis of discrete-time linear switching systems with switching sequences constrained by an automaton. The key element of the framework is the algebraic concept of multinorm, which associates a different norm per node of the automaton, and allows to exactly characterize stability. Building upon this tool, we develop the first arbitrarily accurate approximation schemes for estimating the constrained joint spectral radius ρˆ, that is the exponential growth rate of a switching system with constrained switching sequences. More precisely, given a relative accuracy r>0, the algorithms compute an estimate of ρˆ within the range [ρˆ,(1+r)ρˆ]. These algorithms amount to solve a well defined convex optimization program with known time-complexity, and whose size depends on the desired relative accuracy r>0.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2016.05.015