Randomized algorithms for stabilizing switching signals

DOI10.3934/MCRF.2019009MaRDI QIDQ2327733zbMATH OpenOpenAlexWikidataFDO

Authors Niranjan Balachandran, Atreyee Kundu, Debasish Chatterjee

Publication date 15 October 2019

Published in Mathematical Control and Related Fields (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.1857

zbMATH Keywords

Azuma's inequalitydiscrete-time switched systemsrandomized algorithms

Mathematics Subject Classification ID

Applications of graph theory (05C90) Randomized algorithms (68W20) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Discrete-time control/observation systems (93C55)

Abstract: In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the switching signal is expressed as an infinite walk on this weighted digraph. We employ graph-theoretic tools and discuss different algorithms for designing walks whose corresponding switching signals satisfy the stabilizing switching conditions proposed in [12]. We also address the issue of how likely/generic it is for a family of systems to admit stabilizing switching signals, and under mild assumptions give sufficient conditions for the same. Our solutions have both deterministic and probabilistic flavours.

Recommendations

• Stabilizing discrete-time switched linear systems
• Probabilistic sorting and stabilization of switched systems
• Stabilizing randomly switched systems
• Some results on the stabilization of switched systems
• On feedback stabilization of linear switched systems via switching signal control

Cites work

• Basic problems in stability and design of switched systems
• Dwell time and average dwell time methods based on the cycle ratio of the switching graph
• Finding all the negative cycles in a directed graph
• Graph colouring and the probabilistic method
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Hybrid Systems: Computation and Control
• Introduction to algorithms.
• On stability of discrete-time switched systems
• Probability. Theory and examples.
• Randomized algorithms for synthesis of switching rules for multimodal systems
• Stability analysis of large-scale distributed networked control systems with random communication delays: a switched system approach
• Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results
• Stabilizing discrete-time switched linear systems
• Stabilizing Switching Signals for Switched Systems
• Switched linear systems. Control and design.
• Switching in systems and control
• Uniform stability properties of switched systems with switchings governed by digraphs

Cited in

(3)

• Stabilizing switching signals: a transition from point-wise to asymptotic conditions
• Robust matrix commutator conditions for stability of switched linear systems under restricted switching
• Probabilistic sorting and stabilization of switched systems

This page was built for publication: Randomized algorithms for stabilizing switching signals

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