2020
DOI: 10.1002/rnc.4930
|View full text |Cite
|
Sign up to set email alerts
|

State‐dependent switching law design with guaranteed dwell time for switched nonlinear systems

Abstract: In this article, without the help of predesigned dwell time constraints, a new state-dependent switching law with guaranteed dwell time for switched nonlinear systems is studied. Some sufficient conditions for asymptotic stability of switched nonlinear systems are derived. Also, all the abovementioned conditions can be transformed to a set of sum of squares (SOS) constraints, which can be checked by using the bilinear SOS methodology. Meanwhile, an improved path following method is provided to solve a bilinear… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 26 publications
(39 reference statements)
0
6
0
Order By: Relevance
“…Proof The proof procedure consists of three major steps: The first step is to present that there exists a positive dwell time constraint between any two consecutive switching instants under the switching law (14). The second step is to prove the stability of the switched system (1). The last step is to show that the switched system (1) is of asymptotic stability. In the first step, owing to conditions (11c) and (11d) in Assumption 1, following the same proof procedure of theorem 1 in Reference 30, we can present that between tjk and tjk+1, there exists a positive dwell time constraint δj which is defined in (8d). In the second step, we will prove that the switched system (1) is of the stability by making use of Lemma 1.…”
Section: Resultsmentioning
confidence: 99%
“…Proof The proof procedure consists of three major steps: The first step is to present that there exists a positive dwell time constraint between any two consecutive switching instants under the switching law (14). The second step is to prove the stability of the switched system (1). The last step is to show that the switched system (1) is of asymptotic stability. In the first step, owing to conditions (11c) and (11d) in Assumption 1, following the same proof procedure of theorem 1 in Reference 30, we can present that between tjk and tjk+1, there exists a positive dwell time constraint δj which is defined in (8d). In the second step, we will prove that the switched system (1) is of the stability by making use of Lemma 1.…”
Section: Resultsmentioning
confidence: 99%
“…Assume that matrices U ∈ S + (N+3)n , Q, and S ∈ S + n , T ∈ R n×n , Ω > 0 ∈ R n×n and a positive diagonal matrix Ξ ∈ R n×n , s.t. the LMI (19) and the following LMI (39) and (40) hold.…”
Section: Resultsmentioning
confidence: 99%
“…Generally speaking, these factors often affect the performance of nonlinear delay system and even cause the instability of the system 12‐15 . Over the past decades, many results regarding nonlinear uncertain system with delays have been investigated 16‐19 …”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, when the eigenvalues of each subsystem are fully positive real parts, namely, there is no stabilizing factor for each subsystem, the above switching strategy is no longer feasible. Under such circumstances, one should resort to state-dependent switching mechanism, which is event-driven and depends on state information to determine when and how to switch [29,30]. In essence, state-dependent switching is a closed-loop switching mechanism with strong robustness and weak conservativeness.…”
mentioning
confidence: 99%