2015
DOI: 10.1016/j.automatica.2015.09.030
|View full text |Cite
|
Sign up to set email alerts
|

Complete quadratic Lyapunov functionals for distributed delay systems

Abstract: International audienceThis paper is concerned with the stability analysis of distributed delay systems using complete-Lyapunov functionals. Numerous articles aim at approximating their parameters thanks to a discretization method or polynomial modeling. The interest of such approximations is the design of tractable sufficient stability conditions. In the present article, we provide an alternative method based on polynomial approximation which takes advantages of the Legendre polynomials and their properties. T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
76
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 73 publications
(77 citation statements)
references
References 26 publications
0
76
0
Order By: Relevance
“…They are also based on Lyapunov functionals with extended state variables() at the cost of increased computational complexity. At the heart of all these techniques is the use of integral inequalities as Jensen's, Wirtinger's ones,() or Bessel inequalities (see the works of Seuret et al() for the general case and the works of Zeng et al and Park et al for some particular refined cases). These inequalities are essential and have been developed to take advantage of information on delayed signals.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…They are also based on Lyapunov functionals with extended state variables() at the cost of increased computational complexity. At the heart of all these techniques is the use of integral inequalities as Jensen's, Wirtinger's ones,() or Bessel inequalities (see the works of Seuret et al() for the general case and the works of Zeng et al and Park et al for some particular refined cases). These inequalities are essential and have been developed to take advantage of information on delayed signals.…”
Section: Introductionmentioning
confidence: 99%
“…Compared with previous results on quadratic separation for time‐delay systems with a constant delay, even if the methodology studied here is the same, the embedding in the work of Gouaisbaut and Peaucelle depends on Jensen's inequality, which makes it more conservative and can be viewed as a particular case of the proposed results. Notice that the use of Bessel inequality has been also studied successfully in the works of Seuret et al() in the Lyapunov‐Krasovskii functional framework. In this approach, the Bessel inequality is used to reduce the pessimism of some integral inequalities.…”
Section: Introductionmentioning
confidence: 99%
“…Time delay is a common phenomenon in many dynamic systems such as chemical systems, biological systems, mechanical engineering systems, and networked control systems . Since such phenomenon often causes control performance degradation or even system instability, there have been considerable efforts to solve stability analysis problems for time‐delay systems before implementing control strategies . Stability analysis for delayed discrete‐time systems can be classified into two types of problems depending on delay properties: constant time delays and time‐varying delays.…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, the Jensen integral inequality was successfully extended to general ones called the Bessel‐Legendre (B‐L) inequalities, which are constructed with the Bessel inequality and arbitrary‐order Legendre polynomials . At the same time, it was shown that high‐order orthogonal polynomials provide more precise bounds of integral quadratic functions and contribute to the developing less conservative stability conditions than the low‐order ones. Similarly, for stability analysis of delayed discrete‐time systems, there have been various efforts to reduce a bounding gap between the Jensen summation inequality and a summation quadratic function by using zero‐, first‐, second‐, and third‐order discrete orthogonal polynomials obtained from Gram‐Schmidt orthogonalization process .…”
Section: Introductionmentioning
confidence: 99%
“…In[14], a delay bounding interval [0.200, 1.877] was obtained with 16 decision variables, while the authors of[2] derived the delay bounding interval [0.2000, 1.9504] from Theorem 1 with 59 decision variables. In[16], the lower bound of the delay was found to be 0.2001, while…”
mentioning
confidence: 98%