Search

This article discusses invariant subspaces of a matrix with a given partition structure. The existence of a nontrivial structured invariant subspace is equivalent to the possibility of decomposing the associated system with multiple feedback blocks such that the feedback operators are subject to a given constraint. The formulation is especially useful in the stability analysis of time‐delay systems using the Lyapunov–Krasovskii functional approach where computational efficiency is essential in order to achieve accuracy for large scale systems. The set of all structured invariant subspaces are obtained (thus all possible decompositions are obtained as a result) for the coupled differential‐difference equations (DDE) associated with the DDE of retarded and neutral types, as well as systems with a time‐varying delay. It was shown that the known ad hoc methods of reducing the dimensions of delay channels can be considered as special cases of decomposition where one subsystem has trivial dynamics. The reduction of computational cost is demonstrated by a numerical example. For the general case, a recursive procedure is developed to obtain the set of all structured invariant subspaces. Based on this procedure, a method is presented to obtain a nontrivial structured invariant subspace that considers computational efficiency and increased possibility of terminating in a finite number of steps. [ABSTRACT FROM AUTHOR]

This article developed a new method to described the set of stabilizing PID control. The method is based on D‐parameterization with natural description of the set. It was found that the stability crossing surface is a ruled surface that is completely determined by a curve known as discriminant. The discriminant is divided into sectors at the cusps. Corresponding to the sectors, the stability crossing surface is divided into positive and negative patches. A systematic study is conducted to identify the regions with a fixed number of right half‐plane characteristic roots. The crossing directions of characteristic roots for positive patches and negative patches are also studied. As a result, a systematic method is developed to identify the regions of PID parameter such that the system is stabilized. [ABSTRACT FROM AUTHOR]

This paper studies the migration of double imaginary roots of the systems’ characteristic equation when two parameters are subjected to small deviations. The proposed approach covers a wide range of models. Under the least degeneracy assumptions, we found that the local stability crossing curve has a cusp at the point that corresponds to the double root, and it divides the neighborhood of this point into an S-sector and a G-sector. When the parameters move into the G-sector, one of the roots moves to the right half-plane, and the other moves to the left half-plane. When the parameters move into the S-sector, both roots move either to the left half-plane or the right half-plane depending on the sign of a quantity that depends on the characteristic function and its derivatives up to the third order. [ABSTRACT FROM AUTHOR]

This article studies the strong stability of scalar difference equations of continuous time in which the delays are sums of a number of independent parameters τ i , i = 1 , 2 , … , K . The characteristic quasipolynomial of such an equation is a multilinear function of e − τ i s . It is known that the characteristic quasipolynomial of any difference equation set in the form of one-delay-per-scalar-channel (ODPSC) model is also in such a multilinear form. However, it is shown in this article that some multilinear forms of quasipolynomials are not characteristic quasipolynomials of any ODPSC difference equation set. The equivalence between local strong stability, the exponential stability of a fixed set of rationally independent delays, and the stability for all positive delays is shown, and relations with the structured singular value problem are presented. A procedure to determine strong stability in the special case of up to three independent delay parameters in finite steps is developed. This procedure means that the structured singular value problem in the case of up to three scalar complex uncertain blocks can be solved in finite steps. [ABSTRACT FROM AUTHOR]

Abstract: In general, a system with time delay may have multiple stable delay intervals. Especially, a stable delay interval does not always contain zero. Asymptotically accurate stability conditions such as discretized Lyapunov–Krasovskii functional (DLF) method and sum-of-square (SOS) method are especially effective for such systems. In this article, a DLF-based method is proposed to estimate the maximal stable delay interval accurately without using bisection when one point in this interval is given. The method is formulated as a generalized eigenvalue problem (GEVP) of linear matrix inequalities (LMIs), and an accurate estimate may be reached by iteration either in a finite number of steps or asymptotically. The coupled differential–difference equation formulation is used to illustrate the method. However, the idea can be easily adapted to the traditional differential–difference equation setting. [Copyright &y& Elsevier]

Abstract: This article studies the stability crossing set of linear time-invariant systems with two scalar-delay channels. This study is crucial to the complete stability analysis along the idea of D-subdivision method. The characteristic quasipolynomial of such systems contains an exponential term with the sum of two delays in its exponent (cross term). A complete parameterization and geometric characterization of the stability crossing set is conducted. It was found instrumental to relate it to an associated quasipolynomial without such a cross term through an elimination process. However, a spurious stability crossing set may arise in this process. A revised parameterization method is derived that automatically eliminates such a spurious stability crossing set. [Copyright &y& Elsevier]

This paper reviews some subtleties in time-delay systems of neutral type that are believed to be of particular relevance in practice. Both traditional formulation and the coupled differentialdifference equation formulation are used. The discontinuity of the spectrum as a function of delays is discussed. Conditions to guarantee stability under small parameter variations are given. A number of subjects that have been discussed in the literature, often using different methods, are reviewed to illustrate some fundamental concepts. These include systems with small delays, the sensitivity of Smith predictor to small delay mismatch, and the discrete implementation of distributed-delay feedback control. The framework prsented in this paper makes it possible to provide simpler formulation and strengthen, generalize, or provide alternative interpretation of the existing results. [ABSTRACT FROM AUTHOR]

Abstract: Many practical systems have a large number of state variables, but only a few components involve time delays. These components are often scalar or low dimensional, and typically only one delay is present in each such component. A special form of coupled differential–difference equations with one delay per channel proposed recently is well suited to formulate such systems. This article extends the discretized Lyapunov–Krasovskii functional method to this class of systems. In addition to generality, this formulation also drastically reduces the computational cost for a typical system, and therefore is appropriate to use even for time-delay systems of retarded type. The discretized formulation is also simpler than the previous formulation for systems with multiple delays. [Copyright &y& Elsevier]

Abstract: A new form of coupled differential–difference equations with one delay in each channel is proposed to model systems with multiple delays. This formulation has significant advantage over the traditional differential–difference equations or the prevailing form of coupled differential–difference equations with multiple delays. Fundamental solutions, general solutions, and the construction of the Lyapunov–Krasovskii functional are discussed. For systems with a large number of state variables with multiple low-dimensional delay elements, this formulation allows a drastic reduction of computational cost as compared to the traditional differential–difference equation formulation when the discretized Lyapunov–Krasovskii functional method is used. [Copyright &y& Elsevier]

Abstract: This article discusses the Lyapunov–Krasovskii functional approach for the stability problem of coupled differential-functional equations. Such systems include, as special cases, many types of time-delay systems, including the lossless propagation model, some neutral time-delay systems and singular time-delay systems. After the general stability theory, the special case of coupled differential-difference equations is discussed, and the necessity for the existence of quadratic Lyapunov–Krasovskii functional is established. Discretization is used to render the stability criterion to an LMI form. [Copyright &y& Elsevier]

Abstract: For the general linear scalar time-delay systems of arbitrary order with two delays, this article provides a detailed study on the stability crossing curves consisting of all the delays such that the characteristic quasipolynomial has at least one imaginary zero. The crossing set, consisting of all the frequencies corresponding to all the points in the stability crossing curves, are expressed in terms of simple inequality constraints and can be easily identified from the gain response curves of the coefficient transfer functions of the delay terms. This crossing set forms a finite number of intervals of finite length. The corresponding stability crossing curves form a series of smooth curves except at the points corresponding to multiple zeros and a number of other degenerate cases. These curves may be closed curves, open ended curves, and spiral-like curves oriented horizontally, vertically, or diagonally. The category of curves are determined by which constraints are violated at the two ends of the corresponding intervals of the crossing set. The directions in which the zeros cross the imaginary axis are explicitly expressed. An algorithm may be devised to calculate the maximum delay deviation without changing the number of right half plane zeros of the characteristic quasipolynomial (and preservation of stability as a special case). [Copyright &y& Elsevier]

The discretized Lyapunov functional method for the stability problem of time-delay systems is further refined using a combination of integral inequality and variable elimination technique. As a result, the computational requirement is further reduced for the same discretization mesh. For systems without uncertainty, the convergence to the analytical solution is greatly accelerated. For uncertain systems, the new method is much less conservative. Numerical examples are presented to illustrate the effectiveness of the method. [ABSTRACT FROM AUTHOR]

The stability problem for systems with distributed delay is considered using discretized Lyapunov functional. The coefficients associated with the distributed delay are assumed to be piecewise constant, and the discretization mesh may be non-uniform. The resulting stability criteria are written in the form of linear matrix inequality. Numerical examples are also provided to illustrate the effectiveness of the method. The basic idea can be extended to a more general setting with more involved formulation. [ABSTRACT FROM AUTHOR]

The stability of uncertain systems with multiple time-delay is studied using a quadratic Lyapunov functional. By choosing piecewise linear parameters for the kernel of a quadratic expression, the guaranteed stability condition is formulated in the form of linear matrix inequality. The extent of conservatism depends on the grid size. However, numerical results show that even a very coarse discretization can produce quite satisfactory results. The possibility of non-uniform grid size and more general Lyapunov functional is of interest even for a single delay system. Numerical examples are presented. [ABSTRACT FROM AUTHOR]

The design problem of model-based adaptive control of robots with unknown parameters is considered. By introducing a nonholonomic transformation of the error dynamics, a general class of adaptive algorithms is obtained, which includes some previously derived results as special cases. The algorithms can be implemented through fast recursive schemes such as the Newton-Euler formulation without requiring excessive feedback gains. By setting certain terms, it is also possible to obtain an exponential convergence of the joint errors. [ABSTRACT FROM AUTHOR]

This paper studies strong delay-independent stability of linear time-invariant systems. It is known that delay-independent stability of time-delay systems is equivalent to some frequency-dependent linear matrix inequalities. To reduce or eliminate conservatism of stability criteria, the frequency domain is discretized into several sub-intervals, and piecewise constant Lyapunov matrices are employed to analyze the frequency-dependent stability condition. Applying the generalized Kalman–Yakubovich–Popov lemma, new necessary and sufficient criteria are then obtained for strong delay-independent stability of systems with a single delay. The effectiveness of the proposed method is illustrated by a numerical example. [ABSTRACT FROM AUTHOR]

In this paper, we present a geometric method for describing the effects of the ‘delay-induced uncertainty’ on the stability of a standard Smith predictor control scheme. The method consists of deriving the ‘stability crossing curves’ in the parameter space defined by the ‘nominal delay’ and ‘delay uncertainty’, respectively. More precisely, we start by computing the ‘crossing set’, which consists of all frequencies corresponding to all points on the stability crossing curve, and next we give their ‘complete classification’, including also the explicit characterization of the ‘directions’ in which the zeros cross the imaginary axis. This approach complements existing algebraic stability tests, and it allows some new insights in the stability analysis of such control schemes. Several illustrative examples are also included. [ABSTRACT FROM PUBLISHER]