2010
DOI: 10.1002/asjc.316
|View full text |Cite
|
Sign up to set email alerts
|

An improved delay‐dependent bounded real lemma (BRL) and H controller synthesis for linear neutral systems

Abstract: In this paper, a novel delay-dependent bounded real criterion and an improved sufficient condition are derived for the design of an H ∞ statefeedback controller for linear neutral time-delay systems. On the basis of an augmented Lyapunov-Krasovskii functional, a new bounded real lemma is introduced in terms of a convex linear matrix inequality (LMI) condition that can be solved using interior point algorithms. The bounded real lemma is extended to obtain a sufficient condition for the existence of a delay-depe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…From this point of view, researchers in the time‐delay systems community have considered plenty of different approaches such as employing various model transformations, utilizing better bounding techniques for cross terms, applying Jensen‐type integral inequalities, introducing free‐weighting matrices with Newton–Leibniz relation, exploiting full information on the relationship among the delay related terms, proposing discretized or augmented Lyapunov–Krasovskii (L‐K) functional, and decomposing the delay interval uniformly/nonuniformly into equidistant/variable subintervals. Among them, the most relaxed results have usually been obtained with the last three techniques, namely with the method of exciting full information on the delay related terms, such as in , and the use of discretized or augmented form of L‐K functional such as in , and finally the utilization of delay partitioning technique such as in . Especially, in the last decade, there is a considerable amount of research effort in the literature for the analysis and design of robust or H ∞ controllers both for continuous and discrete time‐delay systems.…”
Section: Introductionmentioning
confidence: 99%
“…From this point of view, researchers in the time‐delay systems community have considered plenty of different approaches such as employing various model transformations, utilizing better bounding techniques for cross terms, applying Jensen‐type integral inequalities, introducing free‐weighting matrices with Newton–Leibniz relation, exploiting full information on the relationship among the delay related terms, proposing discretized or augmented Lyapunov–Krasovskii (L‐K) functional, and decomposing the delay interval uniformly/nonuniformly into equidistant/variable subintervals. Among them, the most relaxed results have usually been obtained with the last three techniques, namely with the method of exciting full information on the delay related terms, such as in , and the use of discretized or augmented form of L‐K functional such as in , and finally the utilization of delay partitioning technique such as in . Especially, in the last decade, there is a considerable amount of research effort in the literature for the analysis and design of robust or H ∞ controllers both for continuous and discrete time‐delay systems.…”
Section: Introductionmentioning
confidence: 99%