Search

We focus on the proportional-integral-derivative (PID) controller design for linear time-delay systems. All the controller gains ($k_P$ , $k_I$ , and $k_D$) and the delay ($\tau$) are treated as free parameters and no particular constraints are imposed on the controlled plants. Such a problem (involving totally four free parameters) is of theoretical as well as practical importance, but, to the best of the authors’ knowledge, it has not been fully explored. First, we will develop an algebraic algorithm to solve the complete stability problem w.r.t. $\tau$. Consequently, for any given PID controller vector $(k_P, k_I, k_D)$ , the distribution of ${NU}(\tau)$ (${NU}(\tau)$ denotes the number of characteristic roots in the right-half plane, as a function of $\tau$) can be accurately obtained and the exhaustive stability range of $\tau$ may be automatically calculated. Next, a global understanding of the distribution of ${NU}(\tau)$ over the whole $(k_P, k_I, k_D)$ -space may be achieved and all structural changes regarding the ${NU}(\tau)$ distribution can be analytically determined. To achieve such a goal, a complete positive real root classification (for some appropriate auxiliary characteristic equation) will be explicitly proposed. Finally, we will give a new methodology, a new parameter-space approach, for determining the stability set in the $(k_P, k_I, k_D, \tau)$ -space. [ABSTRACT FROM AUTHOR]

This paper deals with a new approach to develop an envelope that engulfs all poles of a time-delay system. Through linear matrix inequalities, we are able to determine envelopes for retarded and neutral time-delay systems. The envelopes proposed are not only tighter than the ones in the literature, but, with our procedure, they can also be applied to verify the stability of the system and design state-feedback controllers, which cope with design requirements regarding $\alpha$ -stability. [ABSTRACT FROM AUTHOR]

For time-delay systems, the asymptotic behavior analysis of the critical imaginary roots w.r.t. the infinitely many critical delays is an open problem. In order to find a general solution, we will exploit the link between the asymptotic behavior of critical imaginary roots and the asymptotic behavior of frequency-sweeping curves, from a new analytic curve perspective. As a consequence, we will establish a frequency-sweeping framework with three main results: (1) A finer (regularity-singularity) classification for time-delay systems will be obtained. (2) The general invariance property will be proved and hence the asymptotic behavior of the critical imaginary roots w.r.t. the infinitely many critical delays can be adequately studied. (3) The complete stability problem can be fully solved. Moreover, the frequency-sweeping framework is extended to cover a broader class of time-delay systems. Finally, the geometric insights of frequency-sweeping curves are investigated. Consequently, some deeper properties on the asymptotic behavior of time-delay systems and the link to frequency-sweeping curves are found. [ABSTRACT FROM AUTHOR]

A standard approach in analyzing dynamical systems consists in identifying and understanding the eigenvalues bifurcations when crossing the imaginary axis. Efficient methods for crossing imaginary roots identification exist. However, to the best of the author's knowledge, the multiplicity of such roots was not deeply investigated. In recent papers by the authors [1], [2], it is emphasized that the multiplicity of the zero spectral value can exceed the number of the coupled scalar delay-differential equations and a constructive approach Vandermonde-based allowing to an adaptive bound for such a multiplicity is provided. Namely, it is shown that the zero spectral value multiplicity depends on the system structure (number of delays and number of non zero coefficients of the associated quasipolynomial) rather than the degree of the associated quasipolynomial [3]. This technical note extends the constructive approach in investigating the multiplicity of crossing imaginary roots $j\omega$ where $\omega\neq 0$ and establishes a link with a new class of functional confluent Vandermonde matrices. A symbolic algorithm for computing the LU-factorization for such matrices is provided. As a byproduct of the proposed approach, a bound sharper than the Polya-Szegö generic bound arising from the principle argument is established. [ABSTRACT FROM AUTHOR]

Obtaining the Puiseux series of multiple imaginary (characteristic) roots (MIRs) is a fundamental issue in the stability analysis of time-delay systems. However, to the best of the authors' knowledge, this issue has not been fully investigated up to date. This note focuses on the Puiseux series expansion of MIRs of linear time-invariant systems including commensurate delays. For an MIR of any multiplicity, we propose an algorithm for defining the structure of the Puiseux series, as well as the explicit computation of the corresponding coefficients. By using the proposed method, we can find all the Puiseux series corresponding to all the root loci. [ABSTRACT FROM AUTHOR]

In this paper, we study the robust stability of uncertain time-delay systems. We consider uncertain quasi-polynomials whose coefficients may vary in a certain prescribed range. Our goal is to derive necessary and sufficient conditions for such uncertain quasi-polynomials to maintain stability independent of delay parameters. Our primary contributions are frequency-sweeping conditions for interval, diamond, and spherical quasi-polynomial families, which can be readily checked, requiring only the computation of two simple frequency-dependent functions. Additionally, we also obtain vertex- and edge-type results in the spirit of the Kharitonov approach known in robust stability analysis, showing that the stability of interval and diamond quasi-polynomials can be ascertained by checking the stability of certain special vertex and/or edge members in those families. Both type of results provide necessary and sufficient conditions for the quasi-polynomial families to be robustly stable independent of delay. [ABSTRACT FROM AUTHOR]