#### Filter Results:

- Full text PDF available (56)

#### Publication Year

2001

2017

- This year (3)
- Last 5 years (25)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Stability of time delay systems is investigated considering the delay-dependent case. The system without delays is assumed stable and conservative conditions are derived for finding the maximal delay that preserves stability. The problem is treated in the quadratic separation framework and the resulting criteria are formulated as feasibility problems of… (More)

In this note, we provided an improved way of constructing a LyapunovKrasovskii functional for a linear time delay system. This technique is based on the reformulation of the original system and a discretization scheme of the delay. A hierarchy of Linear Matrix Inequality based results with increasing number of variables is given and is proved to have… (More)

- INTERFACE, Dimitri Peaucelle, Yann Labit, Krysten Taitz, Jos F. Sturm
- 2002

This report describes a user-friendly MATLAB package for defining Linear Matrix Constraints (LMCs). It acts as an interface for the Self-Dual-Minimisation package (SEDUMI) developed by Jos F. Sturm. The functionalities of SEDUMI INTERFACE are the following: Declare an LMC problem. Five MATLAB functions allow to define completely an LMC problem which can be… (More)

This paper considers the robust stability of time delay systems by means of quadratic separation theory. Using this formalism both delay independent and delay dependent criteria are provided. In the nominal case, without uncertainties, our result is shown to be equivalent to other LMI-based results from the literature. Finally, an academic example is… (More)

- Didier Henrion, Denis Arzelier, Dimitri Peaucelle
- Automatica
- 2003

Recently several new LMI conditions for stability of linear systems have been proposed, introducing additional slack variables to reduce the gap between conservative convex quadratic stability conditions and intractable non-convex robust stability conditions. In this paper we show that these improved LMI conditions can be derived with the help of some basic… (More)

- Didier Henrion, Dimitri Peaucelle, Denis Arzelier, Michael Sebek
- IEEE Trans. Automat. Contr.
- 2003

The stability region in the space of coeecients of a polynomial is a non-convex region in general. In this paper, we propose a new convex ellipsoidal inner approximation of this region derived via optimization over linear matrix inequalities. As a byproduct, we obtain new simple suucient conditions for stability that may prove useful in robust control… (More)

- Yoshio Ebihara, Dimitri Peaucelle, Denis Arzelier
- CDC-ECE
- 2011

In this paper, we focus on the L1 gain analysis of linear time-invariant continuous-time positive systems. A positive system is characterized by the strong property that its output is always nonnegative for any nonnegative input. Because of this peculiar property, it is natural to evaluate the size of positive systems by the L1 gain (i.e. the L1 induced… (More)

A particular class of uncertain linear discrete-time periodic systems is considered. The problem of robust stabilization of real polytopic linear discrete-time periodic systems via a periodic state-feedback law is tackled here. Using additional slack variables and the periodic Lyapunov lemma, an extended sufficient condition of robust stabilization is… (More)

- Dimitri Peaucelle, Denis Arzelier, Didier Henrion, Frédéric Gouaisbaut
- Automatica
- 2007

Topological separation is investigated in the case of an uncertain time-invariant matrix interconnected with an implicit linear transformation. A quadratic separator independent of the uncertainty is shown to prove losslessly the closed-loop well-posedness. Several applications for descriptor systems are then given. First, some known results for stability… (More)

For a linear system affected by real parametric uncertainty, this paper focuses on robust stability analysis via quadratic-in-the-state Lyapunov functions polynomially dependent on the parameters. The contribution is twofold. First, if n denotes the system order and m the number of parameters, it is shown that it is enough to seek a parameterdependent… (More)