2014
DOI: 10.1016/j.ins.2014.02.129
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and synthesis of randomly switched systems with known sojourn probabilities

Abstract: In this paper, a new approach is proposed and investigated for the stability analysis and stabilizing controller design of randomly switched linear discrete systems. The approach is based on sojourn probabilities and it is assumed that these probabilities are known a prior. A sojourn probability for a subsystem is the probability of a switched system staying in that subsystem and can be obtained, for example from the history of the switched system. Two main theorems are proved in this paper. Theorem 1 gives a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 41 publications
0
11
0
Order By: Relevance
“…In order to obtain the required results, we assume that the following conditions hold. 15,27 Assumption 1. The probability of a switched system staying in a particular subsystem is assumed to be known a priori, ie,…”
Section: Problem Formulationmentioning
confidence: 99%
See 2 more Smart Citations
“…In order to obtain the required results, we assume that the following conditions hold. 15,27 Assumption 1. The probability of a switched system staying in a particular subsystem is assumed to be known a priori, ie,…”
Section: Problem Formulationmentioning
confidence: 99%
“…However, there are only a few number of publications in the existing literature that are based on sojourn probabilities and linear matrix inequality (LMI) techniques. Tian et al 15 obtained a stabilizing controller design for randomly switched linear discrete-time systems based on sojourn probabilities, and it was assumed that these probabilities are known a priori. In the work of Banu and Balasubramaniam, 16 a new set of delay-dependent sufficient conditions was obtained for the stability and stabilization of a class of discrete-time switched fuzzy systems with known sojourn probabilities by using the Lyapunov functional technique.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A general discrete‐time switched system can be characterized by the difference equation x ( k + 1) = A r ( k ) x ( k ), where x(k)double-struckRn is the state, A r ( k ) are functions of the switching signals, piecewise‐constant function r(k):Z+scriptS is called a switching signal, and r ( k ) = i means that the i th subsystem is activated at a certain discrete‐time instant. An effective and alternative rule for switching in the stochastic switched systems known as Known Sojourn Probability (KSP) that can be calculated from the history of the system has been proposed in recent years as in . The main advantage of this KSP information is that it can be measured easily than that of the transition probabilities.…”
Section: Introductionmentioning
confidence: 99%
“…S is called a switching signal, and r.k/ D i means that the ith subsystem is activated at a certain discrete-time instant. An effective and alternative rule for switching in the stochastic switched systems known as Known Sojourn Probability (KSP) that can be calculated from the history of the system has been proposed in recent years as in [16,17]. The main advantage of this KSP information is that it can be measured easily than that of the transition probabilities.…”
Section: Introductionmentioning
confidence: 99%