2013
DOI: 10.2478/bpasts-2013-0055
|View full text |Cite
|
Sign up to set email alerts
|

Stability and controllability of switched systems

Abstract: Abstract. The study of properties of switched and hybrid systems gives rise to a number of interesting and challenging mathematical problems. This paper aims to briefly survey recent results on stability and controllability of switched linear systems. First, the stability analysis for switched systems is reviewed. We focus on the stability analysis for switched linear systems under arbitrary switching, and we highlight necessary and sufficient conditions for asymptotic stability. After that, we review the cont… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 52 publications
(33 citation statements)
references
References 69 publications
0
33
0
Order By: Relevance
“…However, one advantage is that these computations need to be performed only once for all integers k ≤ k max and a selected h max , and the results can be saved for later use. The formulation of any nonlinear dependency collection: (27) and other operations that could be required during the solution process (such as differentiation during Jacobian matrix evaluations) do not introduce much numerical weight for efficient symbolic computation implementations [49]. The dependencies in each f NL (w) can be used when addressing N(w) in (23).…”
Section: Symbolic Computation Approachmentioning
confidence: 99%
“…However, one advantage is that these computations need to be performed only once for all integers k ≤ k max and a selected h max , and the results can be saved for later use. The formulation of any nonlinear dependency collection: (27) and other operations that could be required during the solution process (such as differentiation during Jacobian matrix evaluations) do not introduce much numerical weight for efficient symbolic computation implementations [49]. The dependencies in each f NL (w) can be used when addressing N(w) in (23).…”
Section: Symbolic Computation Approachmentioning
confidence: 99%
“…We also model the behavior of TCP/UDP/XCP mixed traffic. Our fluid flow model is a type of switched system [36]. We extended the fluid-flow model that considered the impact of the UDP traffic on the stability of the bottleneck network.…”
Section: Fluid Flow Approximation Of Time-limited Tcp/udp/xcp Streamsmentioning
confidence: 99%
“…where g and Ω are called generator vector and fundamental matrix, respectively, which can be determined recursively for r inputs w 1 , w 2 , ..., w r according to (6) through assuming the initial generator g 0 = 1 and fundamental matrix Ω 0 = 1:…”
Section: P1-ts Fuzzy Scheduling Control Schemementioning
confidence: 99%
“…The gain scheduling design is frequently an iterative process, based on the series expansion linearization of a system about its equilibrium points at which a family of local linear controllers is determined to satisfy the system robustness. The survey of scheduled control synthesis is presented in [1,2], however, the effectiveness of a gain scheduling control system is still the subject of attention in the recent works [3][4][5][6]. The numerous research works demonstrate the usefulness of a fuzzy scheduled based control in different applications [7][8][9], developed especially based on the Takagi-Sugeno (TS) model [10].…”
Section: Introductionmentioning
confidence: 99%