Finite-time stochastic synchronization of fuzzy bi-directional associative memory neural networks with Markovian switching and mixed time delays via intermittent quantized control

1.   Introduction

Based on the fact that the $L_\infty$-gain of dynamical systems means the maximum $L_{\infty}$ norm of the output signal for the input signal with the unit $L_\infty$ norm, the issues on computing and/or minimizing the $L_\infty$-gain have been deeply discussed in ^[1]. Here, it would be worthwhile to note that the $L_\infty$-gain problem has been also called the $L_1$ problem because the $L_{\infty}$-gain coincides with the $L_{1}$ norm of the impulse response in the case of single-input single-output (SISO) linear time-invariant (LTI) systems. The $L_1$ problem has attracted much interest in the system and control community because of the practical importance of the $L_\infty$-gain. More precisely, some early results on the $L_\infty$-gain problem ^[1,2,3] have shown that the $L_{\infty}$-gain of continuous-time LTI systems can be exactly obtained by using the arguments on linear programming (LP) ^[4] and operator theory ^[5]. Motivated by the successful results in those studies, the $L_{\infty}$-gain has been widely applied to various practical systems such as robotic manipulators ^[6,7], bipedal robots ^[8,9], and power systems ^[10].

In a similar fashion, the $L_\infty$-gain problem has been actively explored for advanced dynamical systems such as sampled-data systems ^{[11,12,13,14]}, positive systems ^[15,16,17], event-triggered control systems ^[18,19], and nonlinear systems ^{[20,21,22,23]}. To simply put it, the $L_{\infty}$-gain of a sampled-data system can be computed in ^{[11,12,13,14]} by finding an (approximate) equivalent discrete-time linear system, which are concerned with the piecewise constant and/or linear approximations of input/output signals. For positive systems, it is shown in ^[15] that the $L_{\infty}$-gain of linear positive systems can be equivalently characterized by the arguments on LP and this idea is also extended to positive delay systems ^[16] and positive fuzzy systems ^[17]. Some linear matrix inequalities (LMIs) together with piecewise linear models are introduced in ^[18,19] to characterize the $L_\infty$-gains of event-triggered systems. The $L_{\infty}$-gain of nonlinear systems is also discussed in ^{[20,21,22,23]} by employing the arguments on set-invariance principles ^[24,25,26].

On the other hand, it is also meaningful to tackle the $L_\infty$-gain for another type of dynamical system of time-delay systems ^[27], in which delayed (or retarded) terms are considered for the differential/difference equations. This is because time-delay systems have been used for describing various fields of population dynamics ^[28], epidemic models ^[29], communication network systems ^[30], time-delay-based robot control ^[31], and so on. Despite this broad applicability, there are only a few studies that deal with the $L_{\infty}$-gain of general time-delay systems, while there have been a number of studies on the asymptotic stability ^{[32,33,34,35]} and the $H_{\infty}$ performance ^{[36,37,38,39]} of time-delay systems. With respect to this, the Lyapunov-Krasovski functional (LKF) approach is taken in ^[40,41,42] to derive invariant sets for time-delay systems, by which the $L_\infty$-gain of such systems can be characterized. These LKF-based arguments lead to controller synthesis procedures for bounding the $L_{\infty}$-gain of time-delay systems in terms of some LMIs. However, the results in ^[40,41,42] do depend on characteristics of delays, and thus a resulting controller should be re-determined if the magnitudes and/or time derivatives of the considered delays are changed. This is because the LKFs in ^[40,41,42] are intrinsically dependent on the delays. Furthermore, there are other limitations of the arguments in those studies. The delays in ^[40,41] are confined to constant values with sufficiently small sizes. Even though time-varying delays can be considered in ^[42], the bound for $L_{\infty}$-gain in that study is determined after the controller synthesis is completed. Thus, we can only lead to a conservative bound for the $L_{\infty}$-gain of time-delay systems by employing the arguments in ^[42], and this feature does not fit into suppressing the $L_{\infty}$-gains in a prescribed level.

To alleviate the aforementioned limitations in ^[40,41,42], it would be required to develop a delay-independent approach to deal with the $L_{\infty}$-gain of time-delay systems with time-varying delays. Regarding this, the so-called ${{\mathcal D}}$-invariance was introduced recently in ^[43,44,45] to derive set-invariance properties for discrete-time systems without depending on the choice of delays. More precisely, it is shown in ^[43] that a polyhedral ${{\mathcal D}}$-invariance set can be formulated and such a set can be computed in terms of the LP. In a parallel line, an ellipsoidal ${{\mathcal D}}$-invariance set and its LMI-based characterizations were also introduced in ^[44,45]. However, it should be remarked for the results in ^[43,44,45] that they were limited to the case of discrete-time systems and no discussion on the $L_{\infty}$-gain was obtained.

Motivated by the previous works ^{[40,41,42,43,44,45]}, this paper aims to establish a delay-independent output-feedback controller synthesis ensuring that the $L_\infty$-gain of the resulting time-delay closed-loop system is bounded by a prescribed level $\rho$ regardless of the choice of delays. To do this, we first propose a continuous-time version of the ellipsoidal ${{\mathcal D}}$-invariance, by which a given ellipsoidal set becomes forward invariant regardless of the choice of delays. We then derive the existence condition of an ellipsoidal ${{\mathcal D}}$-invariant set in terms of LMIs. This result allows us to obtain a condition for bounding the $L_{\infty}$-gain of time-delay systems with time-varying delays in terms of LMIs. On the basis of the $L_\infty$-gain analysis, an output-feedback controller leading to the $L_{\infty}$-gain of the resulting closed-loop system to be bounded by a prescribed level $\rho$ is obtained. Because both the analysis and synthesis results on the $L_{\infty}$-gain of time-delay systems with time-varying delays are established based on the ellipsoidal ${{\mathcal D}}$-invariance, they do not depend on characteristics of delays such as magnitudes and time derivatives. The validity and effectiveness of the proposed arguments are verified by some comparative numerical results. Finally, the overall contributions of this paper compared to the existing studies ^[40,41,42] are summarized in the following and are also described in Table 1.

● The continuous-time version of the ellipsoidal ${{\mathcal D}}$-invariance is introduced for time-delay systems with time-varying delays.

● A delay-independent condition for the $L_{\infty}$-gain analysis of time-delay systems with time-varying delays is developed.

● An $L_\infty$ performance controller ensuring that the $L_{\infty}$-gain for the resulting closed-loop system is bounded by a prescribed level $\rho$ is established.

● The coefficient matrices involved in the above $L_{\infty}$ performance controller are obtained through the LMI-based approach, in which the relevant constraints do not depend on the delay characteristics.

● Thus, once such an $L_\infty$ performance controller is obtained by the aforementioned method, it can be employed regardless of the modifications of the sizes and/or rates of the considered delays.

This paper is organized as follows. The problem definition is introduced in Section 2. The notion of an ellipsoidal ${{\mathcal D}}$-invariance and the $L_\infty$-gain analysis are discussed in Section 3. We then provide the synthesis method of an $L_\infty$ performance controller in Section 4. Numerical results are provided in Section 5. Finally, the concluding remarks are given in Section 6.

The notations used in this paper can be summarized as follows. The notations ${{\mathbb R}}^{n}$ and ${{\mathbb R}}^{n\times m}$ denote the set of $n$-dimensional real vectors and the set of $n\times m$-dimensional real matrices, respectively. For any symmetric matrix $A$, the notation $A \preceq 0$ (or $A \prec 0$) implies that $A$ is negative semi-definite (or negative definite). The notation $\star$ is used to represent the symmetric part of the matrix. The notations $|\cdot|$ and $\|\cdot\|_{\infty}$ are used to imply the Euclidean norm of a vector and the $L_\infty$-norm of a continuous signal, respectively, i.e.,

For a non-empty set $S$ in ${{\mathbb R}}^{n}$, the notations $\text{Int}(S)$, $\partial S$, and $\overline{S}$ are used to denote the sets of interior points of $S$, boundary points of $S$, and closure points of $S$, respectively. For a continuously differentiable function $f:{{\mathbb R}}^{n} \to {{\mathbb R}}$, $\nabla f$ means the gradient of $f$ defined as

2.   Problem formulation

Let us consider the continuous-time plant $P$ and the output-feedback controller $C$ with the time-varying delay $d(t)$ described by

where $x(t) \in {{\mathbb R}}^{n}$, $w(t) \in {{\mathbb R}}^{p}$, $u(t) \in {{\mathbb R}}^{m}$, $z(t) \in {{\mathbb R}}^{q}$, and $y(t) \in {{\mathbb R}}^{r}$ in $P$ imply the state, the external disturbance, the control input, the regulated output, and the measurement output, respectively, and $x_{c}(t) \in {{\mathbb R}}^{n_{c}}$ is the state of the controller $C$.

Here, it should be noted that the delay $d(t)$ considered in (2.1) and (2.2) is assumed to be not necessarily bounded, i.e.,

To put it another way, this paper considers the case when the upper bound $d_{M}$ is allowed to be $\infty$ and $d(t)$ has a fast changing rate for a wider applicability of the associated arguments. For a generality of the considered plant, the measurement output $y(t)$ is assumed to consist of both the current state $x(t)$ and delayed state $x(t-d(t))$ and the external disturbance $w(t)$ is related with not only $\dot{x}(t)$ but also $z(t)$ and $y(t)$ in (2.1). To effectively tackle the disturbance rejection problem relevant to this generalized plant $P$, the delayed state value $x(t-d(t))$ is also employed in designing the output-feedback controller $C$ as in (2.2), with which the closed-loop system $\Sigma$ consisting of $P$ and $C$ as shown in Figure 1 is described by

where $\xi(t) = \begin{bmatrix}x^{T}(t) & x_{c}^{T}(t)\end{bmatrix}^{T} \in {{\mathbb R}}^{n+n_{c}}$ and the matrices are given by

Here, these expressions of $A_{cl}$ and $A_{d, cl}$ allow us to derive tractable assertions on the $L_\infty$-gain analysis and the $L_\infty$ performance controller synthesis, and the details will be discussed in the following sections.

Based on this representation of $\Sigma$, the $L_{\infty}$-gain (or the $L_{\infty}$ performance) of $\Sigma$ can be defined as

where

This implies the maximum ratio from $\|w\|_\infty$ to $\|z\|_\infty$ when the initial condition of $\Sigma$ is given by zero. With this notion in mind, let us consider the following synthesis problem for an $L_{\infty}$ performance controller.

Problem 1. For a given $\rho > 0$, design a controller $C$ such that the following assertions are established for the resulting closed-loop system $\Sigma$ with an arbitrary $d(t)$ given by (2.3).

(i) The zero solution of the differential equation in $\Sigma$ is asymptotically stable^* when $w(t) \equiv 0$.

^*The zero solution is said to be asymptotically stable ^[27] with respect to $\Sigma$ if it is stable and there exists a $\delta > 0$ such that $\lim_{t \to \infty}\xi(t) = 0$ for any initial condition $\varphi$ with $\sup_{-d_{M} \leq t \leq 0}|\varphi(t)| < \delta$.

(ii) The $L_{\infty}$-gain of $\Sigma$ is bounded by $\rho$, i.e., $\|\Sigma\|_{\infty/\infty} \leq \rho$.

This problem definition is for ensuring the $L_\infty$-gain of $\Sigma$ to be bounded by $\rho$ regardless of the choice of delay $d(t)$, and the following section is devoted to developing a method of the $L_{\infty}$-gain analysis for $\Sigma$ as a preliminary step to obtaining a relevant controller synthesis procedure.

3.   $L_{\infty}$-gain analysis for $\Sigma$ via ellipsoidal ${{\mathcal D}}$-invariance

Assuming that a controller $C$ is fixed, this section considers the $L_\infty$-gain of the closed-loop system $\Sigma$. To this end, we first define the continuous-time ${{\mathcal D}}$-invariant set for $\Sigma$ as follows.

Definition 1. For a closed set $K\in {{\mathbb R}}^{n+n_c}$, it is said to be a (continuous-time) ${{\mathcal D}}$-invariant set of $\Sigma$ if

holds for any delay $d(t)$ given by (2.3) and any initial condition $\varphi$ with $\varphi(t) \in K, \forall t \in [-d_M, 0]$.

This is a generalized concept of the conventional forward invariant set ^[46], in the sense that the invariance of $K$ for (2.4) does not depend on the choice of the delay $d(t)$. This could also be regarded as a continuous-time version of the existing discrete-time ${{\mathcal D}}$-invariance set ^[43,44,45].

To obtain a condition ensuring that a given set becomes a ${{\mathcal D}}$-invariant set, let us consider a scalar-valued function $B:{{\mathbb R}}^{n+n_{c}} \to {{\mathbb R}}$ and its $0$-sublevel set ${{\mathcal C}}$ described by

With this ${{\mathcal C}}$, we are led to the following lemma associated with characterizing the aforementioned condition.

Lemma 1. Let $B:{{\mathbb R}}^{n+n_{c}} \to {{\mathbb R}}$ be a continuously differentiable function and ${{\mathcal C}}$ be the sublevel set defined as (3.2). Suppose that the following assertion holds.

Then, ${{\mathcal C}}$ is a ${{\mathcal D}}$-invariant set of $\Sigma$.

Proof. Assume that ${{\mathcal C}}$ is not a ${{\mathcal D}}$-invariant set of $\Sigma$. Then, there exist $t_{0}, \delta > 0$ such that

for a solution $\xi$ of the differential equation in $\Sigma$ with an initial condition $\varphi(t) \in {{\mathcal C}}, \ \forall t \in [-d_M, 0]$. By the definition of ${{\mathcal C}}$, it follows that

Then, we can obtain that

where the last inequality is obtained by letting $\xi_{1} = \xi(t)$, $\xi_{2} = \xi(t-d(t))$, and $w = w(t)$ in (3.3). This contradicts the assumption that ${{\mathcal C}}$ is not a ${{\mathcal D}}$-invariant set. Thus, the proof is established. □

It would be also worthwhile to note that this lemma can be regarded as an extended version of the existing arguments on the forward invariance and the barrier function ^[26], in which we are not concerned with delay term $d(t)$.

In connection with establishing an applicability of the ${{\mathcal D}}$-invariance property to the $L_\infty$-gain analysis for $\Sigma$, we next introduce the notion of an ellipsoidal ${{\mathcal D}}$-invariant set. For a $P\succ 0$, the ellipsoidal set $\Omega_{P}$ described by

is called an ellipsoidal ${{\mathcal D}}$-invariant set if it is a ${{\mathcal D}}$-invariant set, and its schematic diagram is shown in Figure 2.

Before proceeding to apply Lemma 1 to this $\Omega_{P}$, let us note that $\Omega_{P}$ is a $0$-sublevel set of the quadratic function $B$ defined as

and the corresponding gradient is given by

This fact together with Lemma 1 leads to the following proposition establishing the existence condition of an ellipsoidal ${{\mathcal D}}$-invariant in terms of linear matrix inequalities (LMIs).

Proposition 1. There exists an ellipsoidal ${{\mathcal D}}$-invariant set if the following LMI with the decision variable $P \succ 0$ is feasible for given positive constants $\alpha_i \ (i = 1, 2)$.

Proof. It readily follows from (3.10) that

Here, the left-hand side (LHS) of (3.11) admits the representation

This turns out that the inequality

is established for any $\xi_{i}$ ($i = 1, 2$) and $w$ such that

Because the assertions in (3.14) are equivalent to

it follows from Lemma 1 that ${{\mathcal C}} = \Omega_{P}$ is a ${{\mathcal D}}$-invariant set. This completes the proof. □

It is obvious that the LMI given by (3.10) is independent of the delay $d(t)$. Hence, Proposition 1 can be regarded as an extension of the existing Lyapunov-Krasovski functional (LKF)-based approach ^[41], in which a delay-dependent argument is established for characterizing an invariant set. The feasibility of this LMI corresponds to the asymptotic stability of $\Sigma$ because the first $2 \times 2$ submatrix of ${{\mathcal M}}$ in (3.10) can be represented by ^[47]

and this leads to the asymptotic stability of $\Sigma$. Thus, we can see that the first assertion of Problem 1 is solved if the LMI given by (3.10) is feasible. The scalars $\alpha_{i}$ ($i = 1, 2$) in Proposition 1 are associated with the so-called ${{\mathcal S}}$-procedure ^[47], by which a constrained optimization can be transformed to a non-constrained one.

To characterize the relationship between an ellipsoidal ${{\mathcal D}}$-invariant set and the $L_{\infty}$-gains of $\Sigma$, we next define a set $\Xi(\rho)$ as follows.

This is the set of all states $\xi$ of $\Sigma$ such that the norm of regulated output is bounded by $\rho$ for any disturbances with the unit $L_\infty$ norm. With this set in mind, let us introduce the following lemma.

Lemma 2. The $L_{\infty}$-gain of $\Sigma$ is bounded by $\rho$, i.e., $\|\Sigma\|_{\infty/\infty} \leq \rho$, if there exists an ellipsoidal ${{\mathcal D}}$-invariant set $\Omega_{P}$ such that

We omit the proof of this lemma since it is obvious and similar to the relevant arguments in the conventional studies ^[41,48]. For a practical application of Lemma 2, we next give the following proposition associate with replacing the assertion of (3.18) with an LMI condition.

Proposition 2. The relation $\Omega_{P} \subseteq \Xi(\rho)$ is established if the following LMI with the decision variable $P(\succ 0)$ is feasible for a given constant $\lambda(>0)$.

Proof. By taking the Schur complement of ${{\mathcal M}}_{o}$ with respect to the (3, 3)-component, (3.19) is equivalent to

This turns out that

Then, it immediately follows from (3.21) that

This clearly implies that

and thus $\Omega_{P} \subseteq \Xi(\rho)$. This completes the proof. □

Note that $\lambda$ should be taken as $0 < \lambda \leq \rho^{2}$ for the LMI of (3.19) to be feasible. By combining Propositions 1 and 2 with Lemma 2, we are led to the following theorem relevant to the $L_\infty$-gain analysis for $\Sigma$ through an LMI condition.

Theorem 1. Both the assertions in Problem 1 are established if the LMIs given by (3.10) and (3.19) with the common decision variable $P(\succ 0)$ are feasible for given positive constants $\alpha_i\ (i = 1, 2)$ and $\lambda$.

It should be stressed that all the LMIs in this theorem do not depend on the delay $d(t)$. In other words, once the LMIs given by (3.10) and (3.19) are shown to be feasible, then it can be ensured that the $L_{\infty}$-gain of $\Sigma$ is bounded by $\rho$ for any choice of the delay $d(t)$. Thus, this delay-independent result can be regarded as an effective alternative to the conventional results ^[40,41,42] dependent on the properties of delays such as their magnitudes and time derivatives, especially when their detailed values cannot be obtained.

4.   $L_{\infty}$ performance controller synthesis via ellipsoidal ${{\mathcal D}}$-invariance

This section aims at establishing a controller synthesis procedure with respect to solving Problem 1. In other words, we would determine the coefficient matrices in $C$ ensuring that the assertions in Theorem 1 are satisfied with the resulting closed-loop system $\Sigma$. Because (3.10) and (3.19) do not correspond to LMIs in terms of the control coefficients, it should be required to consider adequate variable transformations.

In connection with this, let us represent the matrix $P$ in Theorem 1 and its inverse, respectively, by

Then, it immediately follows from the Schur complement ^[49] that

With this representation, we introduce the following new decision variables to replace the elements in ${{\mathcal M}}$ and ${{\mathcal M}}_{o}$ given by (3.10) and (3.19), respectively, as follows ^[37].

Next, we are led to the following theorem replacing the assertions in Theorem 1 with LMI-based conditions with the decision variables $X$, $\overline{X}$ and those in (4.3), by which a synthesis procedure of the $L_{\infty}$ performance controller discussed in Problem 1 is obtained.

Theorem 2. Assume that $n = n_{c}$ and positive constants $\rho, \lambda, \alpha_i \ (i = 1, 2)$ are given. The LMIs given by (3.10) and (3.19) are feasible with the decision variable $P \succ 0$ if and only if the LMIs given by

are feasible with the decision variables $X$, $\overline{X}$, $A_{k}$, $\tilde{A}_{k}$, $B_{k}$, $C_{k}$, $\tilde{C}_{k}$, and $D_{c}$, where

Furthermore, if the LMIs (4.4)–(4.6) are feasible, then an $L_{\infty}$ performance controller $C$ solving Problem 1 can be determined by

Proof. Suppose that the LMIs given by (4.4)–(4.6) are feasible. From $n = n_n$ and applying the Schur complement to (4.6), we can see that $X-\bar{X}^{-1}$ is positive definite and its spectral decomposition can be described by

where $Y$ and $Z$ are invertible matrices. With these matrices, a positive definite matrix $P$ as in (4.1) is obtained, and thus $\overline{Y}$ and $\overline{Z}$ involved in a positive definite matrix $P^{-1}$ are also determined. Because $\overline{Y}$ can be also given by $\overline{Y} = -X^{-1}Y\overline{Z}$ and $\overline{Z}$ is an invertible matrix, $\overline{Y}$ is ensured to be an invertible matrix. From this $\overline{X}$ together with $\overline{Y}$ in $P^{-1}$, we take the (nonsingular) transformation matrix described by

With this $T$, we note that the matrices dealt with in Theorem 1 can be described by

where $T_{i}$ ($i = 1, 2, 3$) are defined as

This clearly implies that the LMIs given by (3.10), (3.19), and $P\succ 0$ are established. The converse direction also holds because the above process is reversible. Finally, the last assertion associated with determining an $L_\infty$ performance controller holds from taking the inverse computations of (4.3). □

The details for employing the arguments in this theorem to obtain an $L_\infty$ performance controller are summarized in Algorithm 1. In an equivalent fashion to the $L_\infty$-gain analysis for $\Sigma$ discussed in the preceding section, the control parameters obtained in Theorem 2 do not depend on the delay $d(t)$. Hence, this synthesis procedure can be also regarded as a delay-independent extension of the existing works ^[40,41,42], in which the relevant analysis and synthesis are confined to delay-dependent arguments. With respect to theoretical and practical characteristics of the arguments in Theorem 2, it would be also worthwhile to discuss the following remarks.

Remark 1. The computational cost required for solving the LMI-based condition in Theorem 2 (i.e., (4.4)–(4.6)) can be regarded as similar to or smaller than those in the conventional results ^[40,41,42]. This is because the sizes of the matrices in (4.4)–(4.6) and the number of tuning parameters such as $\alpha_{i}$ ($i = 1, 2$) are not larger than the counterparts in those studies.

Remark 2. The LMIs in Theorem 2 could be (empirically) shown to be feasible if the pairs $(A, B_{u})$ and $(C_{2}, A)$ are stabilizable and detectable, respectively. Because these conditions are necessary for the nominal system without considering the effects of time delays to be stabilizable, the feasibility of (4.4)–(4.6) does not restrict the practical applicability of Theorem 2 and the relevant numerical verification will be provided in Section 5.

Remark 3. The assumption of $n = n_{c}$ in Theorem 2 is for ensuring the invertibility of the component matrices $Y$ and $Z$ in the proof of this theorem. In connection with this, it would be meaningful to obtain a reduced-order controller (i.e., $n_c < n$) as in ^[50,51]. This might be achieved by applying Finsler's lemma (or an elimination lemma) ^[50,51] to the proof of Theorem 2, but such an application is not straightforward and the relevant issue is left for an important future study.

5.   Numerical results

This section is devoted to verifying the feasibility of the developed methods (i.e., Theorems 1 and 2) and their effectiveness compared to the existing studies ^[40,41,42] through some numerical comparisons.

Let us consider the plant $P$ given by ^[42]:

In the perspective of the arguments in ^[30], we note that this plant $P$ can be regarded as a system with an internal network delay $d(t)$. For this system, we would like to verify that the LMIs given by (3.10) and (3.19) discussed in Theorem 1 are feasible without control, i.e., $u = 0$. To this end, we take the relevant parameters by $\alpha_{1} = \alpha_{2} = 1$, $\lambda = 28$, and we solve the LMIs (3.10) and (3.19) by using MATLAB's optimization library called mosek. As a result, we can see that both the LMIs are feasible for $\rho \geq 5.3$, and the resulting solution matrix $P \in {{\mathbb R}}^{2 \times 2}$ with $\rho = 5.3$ is given by

Thus, the $L_{\infty}$-gain of the above $P$ (without control) is bounded by $\rho = 5.3$ from Theorem 1.

Regarding a verification of this result, we consider the three different disturbances $w_{i}(t)$ and delays $d_{i}(t)$ ($i = 1, 2, 3$) which are given by

where ${\rm{square}}:{{\mathbb R}}_{+} \to {{\mathbb R}}$ is defined by

We then obtain the corresponding simulation results of $z$ as shown in Figure 3, and we can observe from this figure that all the vector $2$-norms of $z$ are bounded by the $5.3$. This undoubtedly demonstrates the theoretical validity of the $L_{\infty}$-gain analysis obtained in Theorem 1 for the considered three different cases of $w$, regardless of the choice of any (possibly time-varying) delays.

Beyond the effectiveness of the proposed methods in the $L_\infty$-gain analysis, we next consider the dynamic behavior of this system in terms of obtaining an ellipsoidal ${{\mathcal D}}$-invariant set. In this regard, we obtain some simulation results for three different cases of the state $x(t)$ on the ellipsoidal ${{\mathcal D}}$-invariant set $\Omega_{P}$ with $P$ given by (5.2), as shown in Figure 4, where the initial conditions $v_{i}$, disturbances $w_{i}(t)$, and delays $d_{i}(t)$ ($i = 1, 2, 3$) are described as follows.

We could observe from Figure 4 that all the cases of the state do not escape from the ellipsoidal ${{\mathcal D}}$-invariant set $\Omega_{P}$ even if all the initial conditions $v_{i}$ are taken from the boundary of $\Omega_{P}$, regardless of the choices for disturbances and delays. This verifies that this $\Omega_{P}$ becomes an ellipsoidal ${{\mathcal D}}$-invariant set for $P$, and the state should be limited inside $\Omega_P$, regardless of the choice of delay $d(t)$.

Next, we would like to verify the effectiveness of the proposed controller synthesis discussed in Theorem 2. By following Algorithm 1, we can obtain the tuning parameters $\alpha_{1} = 1$, $\alpha_{2} = 5$ and $\lambda = 0.202$, by which the LMIs in (4.4)–(4.6) are ensured to be feasible for $\rho \geq 0.45$. To achieve the $L_\infty$-gain of the resulting closed-loop system as small as possible, we determine the decision variables $X$, $\overline{X}$, $A_{k}$, $\tilde{A}_{k}$, $B_{k}$, $C_{k}$, $\tilde{C}_{k}$, and $D_{c}$ with taking $\rho = 0.45$. Substituting these variables into (4.8) derives the $L_\infty$ performance controller $C$ given by

Because the arguments in Theorem 2 are independent of the delay $d(t)$, the $L_\infty$-gain of the closed-loop system obtained by connecting $P$ and $C$ is not larger than $0.45$, regardless of the choice of the delay. To verify this fact, we obtain the simulation results for the three different cases of $w_{i}(t), d_{i}(t)\ (i = 1, 2, 3)$ described by (5.3), as shown in Figure 5. We can observe from this figure that all the vector $2$-norms of $z$ are not larger than $\rho = 0.45$, regardless of the different choices of $d(t)$. It would be also worthwhile to note that the vector $2$-norms in Figure 5 associated with the $L_\infty$ performance controller synthesis are much smaller than those in Figure 3 relevant to the plant $P$ without any controller.

On the other hand, we are in a position to evaluate the proposed methods in the presence of model uncertainties and measurement noises. To this end, we consider the model uncertainty $\Delta P$ and the measurement noise $n$ described as follows.

In other words, $P$ is assumed to be changed into $P+\delta P$, by which we mean that $A$, $A_{d}$, $B$, $B_{u}$, and $C_{1}$ are replaced by $A+\Delta A$, $A_{d}+\Delta A_{d}$, $B+\Delta B$, $B_{u}+\Delta B$, and $C_{1}+\Delta C$, respectively, and the measurement $y$ is also affected by the noise $n$, i.e., $y$ is also supposed to be changed into $y+n$. With the disturbance and delay described by (5.3) and the model uncertainty and the noise given by (5.7), we deal with the following cases.

● The case of $w_1(t)$, $d_1(t)$, and $\Delta P$ without $n(t)$.

● The case of $w_{2}(t)$, $d_{3}(t)$, and $n(t)$ without $\Delta P$.

● The case of $w_{3}(t)$, $d_{3}(t)$, $\Delta P$, and $n(t)$.

The corresponding simulation results are shown in Figure 6. We can observe from Figure 6 that the vector $2$-norms of $z$ are always smaller than the prescribed theoretical bound $\rho = 0.45$ in the presence of the model uncertainty $\Delta P$ and/or the measurement noise $n(t)$. This observation implies that the closed-loop system $\Sigma$ obtained through the proposed $L_\infty$ performance controller is not too sensitive with respect to such uncertain elements, and clearly demonstrates the possibility of extending the arguments in Theorems 1 and 2 to an $L_\infty$ robust controller synthesis for uncertain time-delay systems.

With respect to comparing the proposed results to the conventional studies ^[40,41], in which a delay-dependent controller synthesis is provided for suppressing the $L_{\infty}$-gain of linear systems with constant delays (i.e., $d(t) \equiv d$), we would like to note that the LMI-based synthesis procedure described in ^[40] is feasible for the cases of $d(t) \equiv 0.1$ and $d(t) \equiv 0.2$ for $\rho = 0.45$, but the resulting controllers are different from each other. More precisely, the controller for the case of $d(t) \equiv 0.1$ and $\rho = 0.45$ obtained by the arguments in ^[40,41] can be described by

where the other coefficients in (2.2) (e.g., $A_{cd}$) are taken by the zero, and that for the case of $d(t) \equiv 0.2$ and $\rho = 0.45$ is given by

To put it another way, the synthesis procedure in ^[40,41] does depend on the delay $d(t)$ and thus the associated controller should be re-designed when we switch the characteristics of the delay. In connection with this, it should be noted that the LMI-based synthesis procedure in ^[40,41] becomes infeasible when we take $d(t) \equiv d \geq 0.5$. To simply put it, this is because all the eigenvalues of $dA_{d}$ should be located in the unit disk to ensure the feasibility of the LMIs in ^[40,41] (see Theorem 1 in ^[40]). Hence, we can see that the results in ^[40,41] are only applicable to constant delays with sufficiently small sizes.

To summarize, the aforementioned observations clearly validate the fact that the proposed $L_\infty$ performance controller can be an effective alternative to the existing controllers introduced in ^[40,41] for the following two practical aspects. First of all, it is not required to modify/change a controller depending on the characteristics of time delays once it is obtained through the results in Theorem 2, while a trial-and-error process should be taken for different delays when we employ the results in ^[40,41]. Furthermore, the scope of delays taken in the proposed controller synthesis is broader than that of the conventional methods ^[40,41] confined to constant delays. These features are summarized in Table 2.

Finally, we compare the proposed method with the other existing method ^[42], in which a static controller ensuring a finite $L_{\infty}$-gain of linear systems with time-varying delays is introduced. Even though the allowable scope of the delays in ^[42] is broader than that of ^[40,41], the synthesis procedure in the former study is also dependent on the delays. More precisely, the controller synthesis arguments in ^[42] are feasible for $d(t) \equiv 0.1$, $d(t) \equiv 0.3$, $d(t) \equiv 0.7$, and $d(t) \equiv 1.5$ with the resulting control parameters given, respectively, by

Here, it should be remarked that the arguments in ^[42] could be interpreted as providing a quite conservative $L_\infty$-gain compared to our proposed method through simulation results. In fact, the resulting $L_\infty$-gains for the cases of $d(t) \equiv 0.1$, $d(t) \equiv 0.3$, $d(t) \equiv 0.7$, and $d(t) \equiv 1.5$ with respect to the controllers of (5.10)–(5.13) are obtained, respectively, by

These results obviously validate the fact that the methods developed in this paper are more effective than the existing methods in ^[42] for reducing the $L_\infty$-gain of time-delay systems since the $L_\infty$-gains given in (5.14) are much larger than $\rho = 0.45$ obtained through the developed methods and $\rho = 5.3$ for the case of $u = 0$. This conservatism in ^[42] might have arisen from the fact that the arguments in ^[42] are only for ensuring a finite $L_\infty$-gain and no performance level $\rho$ is employed in the controller synthesis procedure. These features are summarized in Table 3.

6.   Conclusions

This paper was concerned with establishing an extensive controller synthesis for linear time-delay systems with time-varying delays. In other words, a delay-independent output-feedback controller, so-called an $L_\infty$ performance controller, was obtained, by which the $L_\infty$-gain of such systems is bounded by a predetermined performance level $\rho$. To this end, we first introduced a continuous-time version of the conventional ellipsoidal ${{\mathcal D}}$-invariance set. We then characterized the existence condition of this continuous-time set in terms of some linear matrix inequalities (LMIs). On the basis of the condition, we could derive not only an analysis method of the $L_\infty$-gain of the aforementioned time-delay systems but also an $L_\infty$ controller synthesis procedure through the LMI approach. Because of the delay-independent property of the continuous-time ellipsoidal ${{\mathcal D}}$-invariance set, both the analysis and controller synthesis methods do not depend on the choice of delays including their magnitudes and time derivatives. The effectiveness and validity of the arguments developed in this paper were also demonstrated through some numerical results.

Finally, we would like to discuss some possible future studies relevant to this paper. Motivated by the fact that the overall arguments in this paper are related to an output-feedback $L_\infty$ performance controller, one might consider an extension of this controller to an observer-based form as in ^[52,53]. This observer-based control is expected to allow us to not only reduce the corresponding $L_\infty$ performance but also obtain an improved state estimation. As mentioned in Remark 3, it is also quite practically meaningful to modify the LMIs in Theorem 1, tailored to a reduced-order controller synthesis, as in ^[50,51]. Furthermore, constructing a theoretical framework for the robust controller synthesis relevant to measurement noises and model uncertainties is left for an interesting future study, although some empirical discussions are provided in Section 5.

Author contributions

Hyung Tae Choi: Writing original draft; Jung Hoon Kim: Supervision, writing-review & editing. All authors have read and approved the final version of the manuscript for publication.

Acknowledgments

This work was supported by project for Smart Manufacturing Innovation R & D funded Korea Ministry of SMEs and Startups in 2022 (Project No. RS–202200141122).

Conflict of interest

The authors declare that there is no conflict of interest.