1 Introduction

During the past couple of decades, the distributed consensus problems for multiagent systems have been drawing an ever increasing concern due to the description of various physical systems such as mobile robots, flocks or swarms, and unmanned aerial vehicles (see [1,2,3,4,5,6,7,8,9,10,11] and the references therein). Recently, the nonlinear multiagent systems which are described by the strict-feedback form and satisfy Lipschitz conditions have been widely regarded as a control target owing to their vast applications [12,13,14,15,16,17]. In [12], the general case where the nonlinear characteristic of the agents are described by feedforward nonlinearities with the growth rate being unknown priori was considered. Based on this, Chang et al [12] both proposed the state feedback regulation protocol and the output feedback regulation protocol such that the tracking performance was well-guaranteed. The distributed prescribed finite-time observer was first designed for a strict-feedback nonlinear system with external disturbance in [13]. Zhang et al [14] designed the distributed control protocols such that the leader-following consensus was achieved for the nonlinear multiagent systems which were supposed to satisfy Lipschitz conditions with time-varying gains. The event-triggered output feedback controllers were developed for a class of switched nonlinear strict-feedback systems, where the nonlinear functions are supposed to be bounded by a continuous function of the output multiplied by unmeasured states [15, 16]. In [17], the consensus problem was investigated for the multiagent systems with unknown smooth nonlinear term. Although these consensus control mechanisms express better tracking performance for the nonlinear multiagent systems, they are difficult to be generalized to the delayed nonlinear counterparts.

At present, the outcomes about the consensus problem investigation for multiagent systems with time delay only have focused on the its linear parts, and that of the nonlinear counterparts still has not obtained enough attention. In practical engineering applications, however, the time delay is inevitable. For instance, state delay, input delay as well as communication delay are often encountered in the multiagent systems (see [19,20,21,22,23] and the references therein). The delay effect will degrade system performance at certain degree, and even cause the instability of the system. Therefore, researchers gradually show solicitude for the consensus analysis for nonlinear multiagent systems with time delay [24,25,26,27]. Hua et al [24] explored the leader-following output consensus problem for a class of nonlinear multiagent system with delay measurements under the directed communication graph. Li et al [25] further investigated this problem by establishing the dynamic gain compensator. Chen et al [26] proposed a novel control strategy for asymptotically stabilizing chained nonholonomic systems with input delay by utilizing the input-state-scaling technique and the static gain control method.

It is worthy that most of the consensus protocols of nonlinear multiagent systems were formulated under the assumption that the state variables of each agent were available [28,29,30,31]. This assumption, however, was much serious for some practical systems and also limited the practicality of control framework derived from the state feedback viewpoint. Generally speaking, not all state information is available in practical applications, instead only a few part of information in terms of output can be measured. Hence, the state observer shall be developed with the potential ability to tackle the impact induced by the immeasurable state variables. With the help of the dynamic gain method, You et al [29] made a profound investigation for the leader-following consensus of the higher-order stochastic nonlinear multiagent systems, and the distributed observer-type controller was formulated using the relative output measurements of neighboring agents. In [28], the lower triangular system was considered, and the output feedback controller was established. Zhang et al [30] further extended output feedback control method to the case of unmodeled dynamics. Another limitation of the theoretical results are obtained based on an assumption that the Lipschitz growth rates are known constants.

Regarding statements presented above, the current research primarily focuses on the leader-following consensus problem for a class of nonlinear multiagent systems with time delay. The agent dynamics are assumed to be in the strict-feedback form and satisfy Lipschitz conditions both with fixed gains and time-varying gains. The investigation seems to be distinguished mainly resulted from the evident challenging summarized as follows:

  1. 1.

    How to analyze the influence induced by the time delay and immeasurable state variables as well as nonlinear terms?

  2. 2.

    How to formulate the distributed controller for each follower by only using the agent’s output and the relative output of its neighbor agents?

  3. 3.

    How to design the dynamic gain such that the leader-following consensus problem of nonlinear multiagent systems with time delay on the state can be addressed?

Thereby, in this paper, the output-feedback consensus control problem for nonlinear multiagent systems with time delay has been explored. The main novelties include the following three folds:

  1. 1.

    The practical case that the multiagent systems suffered from intrinsic nonlinear characteristic and time delay as well as the immeasurable state variables is considered.

  2. 2.

    The state observer of each agent is established by applying dynamic gain method to compensate the effect of the immeasurable state variables.

  3. 3.

    The distributed output feedback consensus protocols are proposed such that the output of each agent can track that of the leader both for cases that the Lipschitz growth rates of the nonlinear function are known constants and unknown time-varying function.

2 Preliminaries and problem formulation

This section covers some terminologies on the graph, and the model as well as the problem will be addressed.

2.1 Graph theory

The weighted undirected graph is described by \({\mathcal {G}}\triangleq (V,E,{\mathcal {A}})\), where \(V=\{v_{1},v_{2},\ldots ,v_{N}\}\) is the vertex set, \(E\subseteq V\times V\) denotes the edge set, and the weighted adjacency matrix is represented by \({\mathcal {A}}=[a_{ij}]_{N\times N}\). The edge \((v_{j},v_{i})\) is included in the edge set E if and only if the agent i and agent j can obtain information from each other. The adjacency matrix \({\mathcal {A}}\) is defined such that \(a_{ij}>0\) yields \((v_{j},v_{i})\in E\), otherwise \(a_{ij}=0\). Without loss of generality, the self-loop is excluded in this paper, i.e, \(a_{ii}=0\). The path of the undirected graph between vertex \(v_{i}\) and \(v_{j}\) is a sequence of edges \((v_{i},v_{k_{1}})\),\((v_{k_{1}},v_{k_{2}})\),...,\((v_{k_{n}},v_{j})\). The undirected graph is said to be connected if there exists a path between any two vertex. The Laplacian matrix of the graph \({\mathcal {G}}\) is defined as \({\mathcal {L}}=[\ell _{ij}]_{N\times N}\), where \(\ell _{ij}=-a_{ij}\), if \(i\ne j\) and \(\ell _{ii}=d_{i}=\sum _{i=1}^{j}a_{ij}\). A subgraph \({\mathcal {H}}\) of \({\mathcal {G}}\) is said to be an induced subgraph if two vertices are adjacent in \({\mathcal {H}}\) only if they are adjacent in \({\mathcal {G}}\). The component of \({\mathcal {G}}\) is an induced subgraph which is maximal, subjected to be connected. The composition graph \(\mathcal {{\bar{G}}}\) is associated with the system containing N agents and a leader. \(\mathcal {{\bar{G}}}\) consists of \({\mathcal {G}}\) and a leader with some edges describing the relationships between some agents and the leader. The connection weighted matrix \({\mathcal {B}}\) is determined as \({\mathcal {B}}=\mathrm {diag}\{b_{1},b_{2},\ldots ,b_{N}\}\) where \(b_{i}>0\) implies the agent i can obtain information from the leader; otherwise, \(b_{i}=0\). \(\mathcal {{\bar{G}}}\) is said to be connected if at least one agent in each component can obtain information from the leader. Denote \(\hat{{\mathcal {L}}}={\mathcal {L}}+{\mathcal {B}}\).

2.2 Model and problem formulation

Consider a flock of nonlinear multiagent systems with \(N+1\) agents containing N followers consecutively labeled from 1 to N and a leader indexed by 0. The dynamics of ith agent can be explicitly described by the following uncertain delayed nonlinear strict-feedback form:

$$\begin{aligned} {\dot{x}}_{i,m}(t)&=x_{i,m+1}(t)+h_{m}(t,{\underline{x}}_{i,m}(t), {\underline{x}}_{i,m}(t-\tau (t))),\nonumber \\ {\dot{x}}_{i,n}(t)&=u_{i}(t)+h_{n}(t,{\underline{x}}_{i,n}(t), {\underline{x}}_{i,n}(t-\tau (t))),\\ y_{i}(t)&=x_{i,1}(t)\nonumber , \end{aligned}$$
(1)

where \(i=0,1,....,N\), \(m=1,2,\ldots ,n-1\), n stands for the dimension of the dynamics of each agent. \({\underline{x}}_{i,m}(t)=\mathrm {col}\{x_{i,1}(t),x_{i,2}(t),....,x_{i,m}(t)\}\in {\mathbb {R}}^{m}\) and \({\underline{x}}_{i,m}(t-\tau (t))=\mathrm {col}\{x_{i,1}(t-\tau (t)),x_{i,2}(t-\tau (t)),....,x_{i,m}(t-\tau (t))\}\in {\mathbb {R}}^{m}\) denote the state vector without or with the time delay on the state, respectively. \(u_{i}(t)\in {\mathbb {R}}\) and \(y_{i}(t)\in {\mathbb {R}}\) refer to as the control input and the output of the ith agent. Without any particular statement, the control input of the leader \(u_{0}(t)\) is supposed to satisfying \(u_{0}(t)=0\). The nonlinear term \(h_{m}(t,{\underline{x}}_{i,m}(t),{\underline{x}}_{i,m}(t-\tau (t))):{\mathbb {R}}\times {\mathbb {R}}^{m}\times {\mathbb {R}}^{m}\rightarrow {\mathbb {R}}\) represents the intrinsic uncertain nonlinear features.

Remark 1

Recently, there has been a trend in regarding the nonlinear multiagent systems as a control target owing to their vast applications [12,13,14,15,16,17]. Most of the related results, however, have been implicitly paid attention to the case where the nonlinear multiagent systems were not subjected to the delay effect, which inevitably results in the limitation of the applications. It is worthy that many real physical systems only can be modeled as the system with time delay [24,25,26,27], such as the chemical reactors shown in Fig. 1. Hence, it is necessary to investigate the consensus problem for multiagent systems subjected to the delay on state.

Fig. 1
figure 1

Two-stage chemical reactors

Just as the statements in the introduction, the state variables except the output signals of some practical systems may not be available as a result of complicated and volatile environment. Hence, regarding the nonlinear multiagent systems with time delay on the state, how to put forward an effective distributed consensus protocol only based on their relative output information such that the output of each follower can asymptotically track that of the leader is one of the challenging topics. Hence, the primary objective of this paper is to address this problem. To be specific, we concentrate upon determining the dynamic gain of the state observer and formulating the distributed consensus protocol such that the output of each follower can asymptotically track that of the leader. Before proceeding, some necessary assumptions and lemmas shall be imposed.

Assumption 1

Suppose that the time delay \(\tau (t)\) and its derivative satisfies

$$\begin{aligned} 0\le \tau (t)\le \tau ^{*},~~{\dot{\tau }}(t)\le {\bar{\tau }}<1,~~\forall t, \end{aligned}$$
(2)

where \(\tau ^{*}\) and \({\bar{\tau }}\) are positive scalars.

Assumption 2

Suppose that there exist positive constants \(c_{k1}\) and \(c_{k2}\) such the following inequality holds for each \(m=1,2,\ldots ,n\)

$$\begin{aligned}&|h_{m}(t,{\underline{x}}_{i,m}(t),{\underline{x}}_{i,m} (t-\tau (t)))\nonumber \\&\quad -h_{m}(t,{\underline{x}}_{0,m}(t),{\underline{x}}_{0,m} (t-\tau (t)))|\nonumber \\&\quad \le \sum _{k=1}^{m}c_{k1}|x_{ik}-x_{0k}|+\sum _{k=1}^{m}c_{k2} |x_{ik\tau }-x_{0k\tau }|~~\forall t, \end{aligned}$$
(3)

where \(x_{ik\tau }=x_{i,k}(t-\tau (t))\).

Assumption 3

The augmented graph \(\mathcal {{\bar{G}}}\) associated with the communication topology of the multiagent systems is fixed and connected.

Lemma 1

[14] Let \(A\!\!=\!\!\left[ \begin{matrix}0&{} I_{n-1}\\ 0&{}0\end{matrix}\right] \), \(b\!=\!\left[ 1,\underbrace{0,0,\ldots ,0}_{n-1}\right] ^{\mathrm {T}}\), \(c=\left[ \underbrace{0,0,\cdot \cdot \cdot }_{n-1},1\right] ^{\mathrm {T}}\), where \(I_{n-1}\) is an identity matrix of order \(n-1\). There exist matrices \(Q=\left[ q_{1},q_{2},\ldots ,q_{n}\right] ^{\mathrm {T}}\), \(L=\left[ l_{1},l_{2},\ldots ,l_{n}\right] ^{\mathrm {T}}\), such that \(M_{i},i=1,2\) are hurwitz stable, where \(M_{1}=I_{N}\otimes A-(\hat{{\mathcal {L}}}\otimes (cQ^{\mathrm {T}}))\) and \(M_{2}=I_{N}\otimes A-I_{N}\otimes (Lb^{\mathrm {T}})\). In other words, there are positive definite matrices \(P_{1}\in {\mathbb {R}}^{nN\times nN}\), \(P_{2}\in {\mathbb {R}}^{nN\times nN}\), and positive constants \(\eta _{1}\), \(\eta _{2}\) such that

$$\begin{aligned} P_{1}M_{1}+M_{1}^{\mathrm {T}}P_{1}&\le -\eta _{1}P_{1}, \end{aligned}$$
(4)
$$\begin{aligned} P_{2}M_{2}+M_{2}^{\mathrm {T}}P_{2}&\le -\eta _{2}P_{2}. \end{aligned}$$
(5)

Remark 2

The conditions in assumptions 1 and 2 are reasonable in many physical systems (e. g., inverted pendulums and chemical reactors). Without loss of generality, let

$$\begin{aligned}&h_{m}(t,{\underline{x}}_{i,m}(t),{\underline{x}}_{i,m}(t-\tau (t)))\\&\quad =\sum _{k=1}^{m}f(x_{ik}(t))+\sum _{k=1}^{m}g(x_{ik}(t-\tau (t))) \end{aligned}$$

Then,

$$\begin{aligned}&\bigg | h_{m}(t,{\underline{x}}_{i,m}(t),{\underline{x}}_{i,m} (t-\tau (t)))\nonumber \\&\quad -h_{m}(t,{\underline{x}}_{0,m}(t),{\underline{x}}_{0,m}(t-\tau (t)))\bigg |\\&\quad =\bigg |\sum _{k=1}^{m}f(x_{ik}(t))-\sum _{k=1}^{m}f(x_{0k}(t))\\&\qquad +\sum _{k=1}^{m}g(x_{ik}(t-\tau (t)))-\sum _{k=1}^{m}g(x_{0k}(t-\tau (t)))\bigg |\\&\quad \le \sum _{k=1}^{m}\bigg |f(x_{ik}(t))-f(x_{0k}(t))\bigg |\\&\qquad +\sum _{k=1}^{m}\bigg |g(x_{ik}(t-\tau (t)))+g(x_{0k}(t-\tau (t)))\bigg | \end{aligned}$$

If the functions \(f(\cdot )\) and \(g(\cdot )\) both satisfy the Lipschitz condition, then, there exist positive constants \(c_{k1}\) and \(c_{k2}\) such that the assumption is hold. For instance, the function \(f(\cdot )\) and \(h(\cdot )\) are defined as \(f(\cdot )=\mathrm {sin}(\cdot )\) and \(h(\cdot )=\mathrm {cos}(\cdot )\). Both of them satisfy the Lipschitz condition because of their bounded derivative. One notes that if the time delay is not considered, i. e., \(\tau (t)=0\), the assumption 2 is transformed into a widespread one, which has been widely applied in the analysis of the output feedback control for nonlinear multiagent systems without time delay (Please refer to [20, 29]). In addition, assumption 3 is a general and necessary assumption, which is often used to describe the communication topology among the agents (see [14, 19]).

3 Main results

In this section, the distributed leader-following consensus protocols are established by applying the dynamic gain method. In order to facilitate later analysis for the ith agent with immeasurable state variables, the state observer for each agent is formulated as:

$$\begin{aligned} \dot{{\hat{x}}}_{i,m}(t)&={\hat{x}}_{i,m+1}(t)+l_{m}K^{m}(x_{i,1}(t) -{\hat{x}}_{i,1}(t)),\nonumber \\ \dot{{\hat{x}}}_{i,n}(t)&=u_{i}(t)+l_{n}K^{n}(x_{i,1}(t)-{\hat{x}}_{i,1}(t)), \end{aligned}$$
(6)

where \({\hat{x}}_{i,m}(t)\) (\(i=0,1,2,\ldots ,N\), \(m=1,2,\ldots ,n\)) is the estimate of the state variables \(x_{i,m}(t)\), \(l_{m}\) is the coefficient selected such that the condition (5) in lemma 1 is satisfied, and \(K(t)\ge 1\) denotes the dynamic gain to be specified subsequently. \(K^{m}\) refers to as the mth power of K.

Define

$$\begin{aligned}&e_{i,m}(t)=x_{i,m}(t)-x_{0,m}(t),\\&z_{i,m}={\hat{x}}_{i,m}(t) -{\hat{x}}_{0,m}(t),\\&m=1,2,\ldots ,n, i=1,2,\ldots ,N,\\&e_{i}=\left[ e_{i,1},\ldots ,e_{i,n}\right] ^{\mathrm {T}}, z_{i}=\left[ z_{i,1},\ldots ,z_{i,n}\right] ^{\mathrm {T}},\\&e=\left[ e_{1}^{\mathrm {T}},\ldots ,e_{N}^{\mathrm {T}}\right] ^{\mathrm {T}}, z=\left[ z_{1}^{\mathrm {T}},\ldots ,z_{N}^{\mathrm {T}}\right] ^{\mathrm {T}}. \end{aligned}$$

According to (1), the tracking error system for ith agent can be described as

$$\begin{aligned} {\dot{e}}_{i,m}(t)&=e_{i,m+1}(t)+h_{m}(t,{\underline{x}}_{i,m}(t),{\underline{x}}_{i,m}(t-\tau (t)))\nonumber \\&\quad -h_{m}(t,{\underline{x}}_{0,m}(t),{\underline{x}}_{0,m}(t-\tau (t))),\nonumber \\ {\dot{e}}_{i,n}(t)&=u_{i}(t)+h_{n}(t,{\underline{x}}_{i,n}(t),{\underline{x}}_{i,n}(t-\tau (t)))\nonumber \\&\quad -h_{n}(t,{\underline{x}}_{0,n}(t),{\underline{x}}_{0,n}(t-\tau (t))). \end{aligned}$$
(7)

From (6), one has

$$\begin{aligned} {\dot{z}}_{i,m}(t)&=z_{i,m+1}(t)+l_{m}K^{m}(e_{i,1}(t)-z_{i,1}(t)),\nonumber \\ {\dot{z}}_{i,n}(t)&=u_{i}(t)+l_{n}K^{n}(e_{i,1}(t)-z_{i,1}(t)). \end{aligned}$$
(8)

Therefore, the leader-following consensus problem of the multiagent system (1) is transformed into the stabilization problems of (7) and (8). Let \(s_{i,m}=e_{i,m}-z_{i,m}\), \(m=1,2,\ldots ,n\), \(i=1,2,\ldots ,N\), one has

$$\begin{aligned} {\dot{s}}_{i,m}(t)&=s_{i,m+1}(t)-l_{m}K^{m}s_{i,1}(t)\nonumber \\&\quad +h_{m}(t,{\underline{x}}_{i,m}(t),{\underline{x}}_{i,m}(t-\tau (t)))\nonumber \\&\quad -h_{m}(t,{\underline{x}}_{0,m}(t),{\underline{x}}_{0,m}(t-\tau (t))),\nonumber \\ {\dot{s}}_{i,n}(t)&=-l_{n}K^{n}s_{i,1}(t)+h_{n}(t,{\underline{x}}_{i,n}(t), {\underline{x}}_{i,n}(t-\tau (t)))\nonumber \\&\quad -h_{n}(t,{\underline{x}}_{0,n}(t),{\underline{x}}_{0,n}(t-\tau (t))). \end{aligned}$$
(9)

For ease of derivation, the following transformations are conducted:

$$\begin{aligned}&{\tilde{z}}_{i,m}(t)=K^{1-m-\iota }z_{i,m}(t),{\tilde{s}}_{i,m}(t)=K^{1-m-\iota }s_{i,m}(t), \end{aligned}$$
(10)

where \(\iota \) is a positive scalar.

Thus, the systems (8) and (9) can be respectively reorganized as

$$\begin{aligned} \dot{{\tilde{z}}}_{i,m}(t)&=K{\tilde{z}}_{i,m+1}(t)+(1-m-\iota ) \frac{{\dot{K}}}{K}{\tilde{z}}_{i,m}(t)\nonumber \\&\quad +l_{m}K{\tilde{s}}_{i,1}(t),\nonumber \\ \dot{{\tilde{z}}}_{i,n}(t)&=Ku_{i}(t)+(1-n-\iota )\frac{{\dot{K}}}{K} {\tilde{z}}_{i,n}(t)\nonumber \\&\quad +l_{n}K{\tilde{s}}_{i,1}(t), \end{aligned}$$
(11)

and

$$\begin{aligned} \dot{{\tilde{s}}}_{i,m}(t)&=K{\tilde{s}}_{i,m+1}(t)+(1-m-\iota )\frac{{\dot{K}}}{K} {\tilde{s}}_{i,m}(t)\nonumber \\&\quad -l_{m}K{\tilde{s}}_{i,1}(t)\nonumber \\&\quad +K^{1-m-\iota }\left[ h_{m}({\underline{x}}_{i,m}(t),{\underline{x}}_{i,m} (t-\tau (t)))\right. \nonumber \\&\quad \left. -h_{m}(t,{\underline{x}}_{0,m}(t),{\underline{x}}_{0,m}(t-\tau (t)))\right] ,\nonumber \\ \dot{{\tilde{s}}}_{i,n}(t)&=(1-n-\iota )\frac{{\dot{K}}}{K}{\tilde{s}}_{i,n} (t)-l_{n}K{\tilde{s}}_{i,1}(t)\nonumber \\&\quad +K^{1-n-\iota }\left[ h_{n}(t,{\underline{x}}_{i,n}(t),{\underline{x}}_{i,n} (t-\tau (t)))\right. \nonumber \\&\quad \left. -h_{n}(t,{\underline{x}}_{0,n}(t),{\underline{x}}_{0,n}(t-\tau (t)))\right] . \end{aligned}$$
(12)

With all the analysis above taking into account, we are now in a position to formulate our main result, which describes distributed consensus protocol for the nonlinear multiagent systems in the presence of state delay and immeasurable state variables simultaneously. The main result of this paper is proposed in the manner of theorem 1.

Theorem 1

Suppose that assumptions 1-3 hold for the multiagent systems (1). Then, the output of each follower can ultimately asymptotically track that of the leader under the following distributed output feedback consensus protocol

$$\begin{aligned} u_{i}(t)&=-Q^{\mathrm {T}}\varGamma \left( \sum _{j=1}^{N}a_{ij}({\hat{x}}_{i}(t)\right. \nonumber \\&\quad \left. -{\hat{x}}_{j}(t))+b_{i}({\hat{x}}_{i}(t)-{\hat{x}}_{0}(t))\right) , \end{aligned}$$
(13)
$$\begin{aligned} {\dot{K}}(t)&=\mathrm {max}\left\{ -\phi K^{2}(t)+\varrho K(t),0\right\} , \end{aligned}$$
(14)

where \({\hat{x}}_{i}(t)\), \(i=0,1,2,\ldots ,N\) refers to as the estimate of the state variables \(x_{i}(t)\), which is defined in (6), \(\varGamma =\mathrm {diag}\{K^{n},K^{n-1},\ldots ,K\}\), \(Q=[q_{1},q_{2},\ldots ,q_{n}]^{\mathrm {T}}\) denotes the control variables, \(\phi \) and \(\varrho \) are positive coefficients of the dynamic gain K(t) determined such that \(K(t)\ge 1\).

Proof

According to (13), the control protocol of ith agent \(u_{i}(t)\) can be reorganized as

$$\begin{aligned} u_{i}=-(\varLambda _{i}\otimes Q^{\mathrm {T}}){\tilde{z}}, \end{aligned}$$
(15)

where \(\varLambda _{i}\) is the \(i\mathrm {th}\) row of the matrix \(\hat{{\mathcal {L}}}\). \({\tilde{z}}_{i}(t)=\mathrm {col}\{{\tilde{z}}_{i,1}(t),{\tilde{z}}_{i,2}(t),\ldots ,{\tilde{z}}_{i,n}(t)\}\), \({\tilde{z}}(t)=[{\tilde{z}}_{1}^{\mathrm {T}}(t),\ldots , {\tilde{z}}_{N}^{\mathrm {T}}(t)]^{\mathrm {T}}\). Substituting (15) into (11), one obtains

$$\begin{aligned} \dot{{\tilde{z}}}_{i,m}&=K{\tilde{z}}_{i,m+1}+(1-m-\iota )\frac{{\dot{K}}}{K}{\tilde{z}}_{i,m}+l_{m}K{\tilde{s}}_{i,1},\nonumber \\ \dot{{\tilde{z}}}_{i,n}&=-K(\varLambda _{i}\otimes Q^{\mathrm {T}}){\tilde{z}}+(1-n-\iota )\frac{{\dot{K}}}{K}{\tilde{z}}_{i,n}\nonumber \\&\quad +l_{n}K{\tilde{s}}_{i,1}. \end{aligned}$$
(16)

Define \({\tilde{s}}_{i}(t)=\mathrm {col}\{{\tilde{s}}_{i,1}(t),{\tilde{s}}_{i,2}(t),\ldots ,{\tilde{s}}_{i,n}(t)\}\). Then, the systems (12) and (16) can be rewritten as

$$\begin{aligned} \dot{{\tilde{z}}}_{i}(t)&=KA{\tilde{z}}_{i}(t)-K(\varLambda _{i}\otimes cQ^{\mathrm {T}}){\tilde{z}}(t)\nonumber \\&\quad -\frac{{\dot{K}}}{K}(\iota I_{n}+G){\tilde{z}}_{i}(t)+KL{\tilde{s}}_{i,1}(t), \end{aligned}$$
(17)
$$\begin{aligned} \dot{{\tilde{s}}}_{i}(t)&=K(A-Lb^{\mathrm {T}}){\tilde{s}}_{i}(t)\nonumber \\&\quad -\frac{{\dot{K}}}{K}(\iota I_{n}+G){\tilde{s}}_{i}(t)+f_{i}(t), \end{aligned}$$
(18)

where \(f_{i}(t)=[f_{i,1}(t),\ldots ,f_{i,n}(t)]^{\mathrm {T}}\), \(f_{i,m}(t)=K^{1-m-\iota }\left[ h_{m}(t,{\underline{x}}_{i,m},{\underline{x}}_{i,m\tau })-h_{m}(t,{\underline{x}}_{0,m},{\underline{x}}_{0,m\tau })\right] \), with \(m=1,2,\ldots ,n\) and \(\iota \) is defined in (10), \({\underline{x}}_{i,m\tau }={\underline{x}}_{i,m}(t-\tau (t))\), \(G=\mathrm {diag}\{0,1,\ldots ,n-1\}\). Let \({\tilde{s}}(t)=[{\tilde{s}}_{1}^{\mathrm {T}}(t),\ldots ,{\tilde{s}}_{N}^{\mathrm {T}}(t)]^{\mathrm {T}}\), \(f(t)=[f_{1}^{\mathrm {T}}(t),\ldots ,f_{N}^{\mathrm {T}}(t)]^{\mathrm {T}}\), thus, one has

$$\begin{aligned} \dot{{\tilde{z}}}(t)&=K(I_{N}\otimes A-\hat{{\mathcal {L}}}\otimes c Q^{\mathrm {T}}){\tilde{z}}(t)\nonumber \\&\quad -\frac{{\dot{K}}}{K}(I_{N}\otimes D){\tilde{z}}(t)+K({\hat{s}}(t)\otimes L), \end{aligned}$$
(19)
$$\begin{aligned} \dot{{\tilde{s}}}(t)&=K(I_{N}\otimes (A-Lb^{\mathrm {T}})){\tilde{s}}(t)\nonumber \\&\quad -\frac{{\dot{K}}}{K}(I_{N}\otimes D){\tilde{s}}(t)+f(t), \end{aligned}$$
(20)

with \(D=\iota I_{n}+G\), \({\hat{s}}(t)=\left[ {\tilde{s}}_{1,1}(t),{\tilde{s}}_{2,1}(t),\ldots ,{\tilde{s}}_{N,1}(t)\right] ^{\mathrm {T}}\).

In what follows, by utilizing the Lyapunov stability theory, the stability problems of systems (19) and (20) will be resolved. So as to achieve this objective, the following Lyapunov function candidate shall be established

$$\begin{aligned} V(t)=\sum _{k=1}^{3}V_{k}(t) \end{aligned}$$
(21)

with

$$\begin{aligned} V_{1}(t)&={\tilde{z}}^{\mathrm {T}}(t)P_{1}{\tilde{z}}(t), \\ V_{2}(t)&={\tilde{s}}^{\mathrm {T}}(t)P_{2}{\tilde{s}}(t),\\ V_{3}(t)&=\frac{e^{\rho \tau ^{*}}}{1-{\bar{\tau }}} \int _{t-\tau (t)}^{t}e^{-\rho (t-\mu )}(\lambda _{2}\Vert P_{2}\Vert \Vert {\tilde{z}}(\mu )\Vert ^{2}\\&\quad +\lambda _{3}\Vert P_{2}\Vert \Vert {\tilde{s}}(\mu )\Vert ^{2})d\mu , \end{aligned}$$

where \(\rho \), \(\lambda _{2}\), and \(\lambda _{3}\) are positive scalars.

The derivative of V(t) along (19) and (21) is expressed as

$$\begin{aligned} {\dot{V}}_{1}(t)&=2{\tilde{z}}^{\mathrm {T}}P_{1}\dot{{\tilde{z}}}\nonumber \\&=2{\tilde{z}}^{\mathrm {T}}P_{1}\left[ K(I_{N}\otimes A-\hat{{\mathcal {L}}}\otimes c Q^{\mathrm {T}}){\tilde{z}}\right] \nonumber \\&\quad +2{\tilde{z}}^{\mathrm {T}}P_{1}\left[ -\frac{{\dot{K}}}{K}(I_{N}\otimes D){\tilde{z}}+K({\hat{s}}\otimes L)\right] , \end{aligned}$$
(22)
$$\begin{aligned} {\dot{V}}_{2}(t)&=2{\tilde{s}}^{\mathrm {T}}P_{2}\dot{{\tilde{s}}} \end{aligned}$$
(23)
$$\begin{aligned}&=2{\tilde{s}}^{\mathrm {T}}P_{2}\left[ K(I_{N}\otimes (A-Lb^{\mathrm {T}})){\tilde{s}}\right. \nonumber \\&\quad \left. -\frac{{\dot{K}}}{K}(I_{N}\otimes D){\tilde{s}}+f\right] ,\nonumber \\ {\dot{V}}_{3}(t)&\le -\rho V_{3}+\frac{\lambda _{2}e^{\rho \tau ^{*}}}{1-{\bar{\tau }}}\Vert P_{1}\Vert \Vert {\tilde{z}}\Vert ^{2}+\frac{\lambda _{3}e^{\rho \tau ^{*}}}{1-{\bar{\tau }}}\Vert P_{2}\Vert \Vert {\tilde{s}}\Vert ^{2}\nonumber \\&\quad -\lambda _{2}\Vert P_{2}\Vert \Vert {\tilde{z}}_{\tau }\Vert ^{2} -\lambda _{3}\Vert P_{2}\Vert \Vert {\tilde{s}}_{\tau }\Vert ^{2}. \end{aligned}$$
(24)

Based on lemma 1, one has

$$\begin{aligned} K{\tilde{z}}^{\mathrm {T}}(P_{1}M_{1}+M_{1}^{\mathrm {T}}P_{1}){\tilde{z}}\le -\eta _{1}K{\tilde{z}}^{\mathrm {T}}P_{1}{\tilde{z}}, \end{aligned}$$
(25)

According to the contributions in [25], there exists strictly positive constant \(\iota _{i}\) such that \(-\iota _{i}P_{i}\le P_{i}(I_{N}\otimes D)+(I_{N}\otimes D)P_{i}\le \iota _{i}P_{i}\) for \(i=1,2\). Hence, one has

$$\begin{aligned} -2\frac{{\dot{K}}}{K}{\tilde{z}}^{\mathrm {T}}P_{1}(I_{N}\otimes D){\tilde{z}}&\le -\iota _{1}\frac{{\dot{K}}}{K}{\tilde{z}}^{\mathrm {T}}P_{1}{\tilde{z}},\nonumber \\ -2\frac{{\dot{K}}}{K}{\tilde{s}}^{\mathrm {T}}P_{2}(I_{N}\otimes G){\tilde{s}}&\le -\iota _{2}\frac{{\dot{K}}}{K}{\tilde{s}}^{\mathrm {T}}P_{2}{\tilde{s}}. \end{aligned}$$
(26)

On the other hand, one obtains

$$\begin{aligned} 2K{\tilde{z}}^{\mathrm {T}}P_{1}({\hat{s}}\otimes L)&\le 2K\Vert P_{1}\Vert \sqrt{\sum _{j=1}^{n}l_{j}^{2}}\Vert {\tilde{z}}\Vert \Vert {\tilde{s}}\Vert \nonumber \\&\le \alpha _{1}K{\tilde{z}}^{\mathrm {T}}P_{1}{\tilde{z}} +\alpha _{2}K{\tilde{s}}^{\mathrm {T}}P_{2}{\tilde{s}}, \end{aligned}$$
(27)

where \(\alpha _{1}=\frac{\Vert P_{1}\Vert \sqrt{\sum _{j=1}^{n}l_{j}^{2}}}{\lambda _{\mathrm {min}}(P_{1})}\), \(\alpha _{2}=\frac{\Vert P_{1}\Vert \sqrt{\sum _{j=1}^{n}l_{j}^{2}}}{\lambda _{\mathrm {min}}(P_{2})}\).

According to lemma 1, one gets

$$\begin{aligned} 2{\tilde{s}}^{\mathrm {T}}P_{2}K(I_{N}\otimes (A-Lb^{\mathrm {T}})){\tilde{s}}\le -\eta _{2}K{\tilde{s}}^{\mathrm {T}}P_{2}{\tilde{s}}. \end{aligned}$$
(28)

In addition, combining with assumption 2, one obtains

$$\begin{aligned} |f_{i,m}|&=K^{1-m-\iota }\left| h_{m}(t,{\underline{x}}_{i,m},{\underline{x}}_{i,m\tau }) -h_{m}(t,{\underline{x}}_{0,m},{\underline{x}}_{0,m\tau })\right| \nonumber \\&\le K^{1-m-\iota }\left[ \sum _{k=1}^{m}c_{k1}|x_{ik}-x_{0k}|+\sum _{k=1}^{m}c_{k2}|x_{ik\tau } -x_{0k\tau }|\right] \nonumber \\&\le K^{1-m-\iota }\left[ \sum _{k=1}^{m}c_{k1}|s_{ik}+z_{ik}|+\sum _{k=1}^{m}c_{k2}|s_{ik\tau } +z_{ik\tau }|\right] \\&\le K^{1-m-\iota }\left[ \sum _{k=1}^{m}K^{m-1+\iota }c_{k1}\left| {\tilde{s}}_{ik} +{\tilde{z}}_{ik}\right| \right. \nonumber \\&\quad \left. +\sum _{k=1}^{m}K_{\tau }^{m-1+\iota }c_{k2} \left| {\tilde{s}}_{ik\tau }+{\tilde{z}}_{ik\tau }\right| \right] \nonumber \end{aligned}$$
(29)

where \(K_{\tau }=K(t-\tau (t))\), \(m=1,2,\ldots ,n\) and \(\iota \) is defined in (10).

One notes that \(m-1+\iota >0\). Based on the condition (14) and \(\tau (t)\ge 0\), one has \( K(t)\ge K(t-\tau (t))\ge 1\). That is, \(K_{\tau }^{m-1+\iota }\le K^{m-1+\iota }\), which implies

$$\begin{aligned} |f_{i,m}|\le \sum _{k=1}^{m}c_{k1}\left| {\tilde{s}}_{ik}+{\tilde{z}}_{ik}\right| +\sum _{k=1}^{m}c_{k2}\left| {\tilde{s}}_{ik\tau }+{\tilde{z}}_{ik\tau }\right| . \end{aligned}$$
(30)

Therefore, one has

$$\begin{aligned} 2{\tilde{s}}^{\mathrm {T}}P_{2}f&\le 2\Vert {\tilde{s}} \Vert \Vert P_{2}\Vert (c_{1}(\Vert {\tilde{s}}\Vert +\Vert {\tilde{z}}\Vert )\nonumber \\&\quad +c_{2}(\Vert {\tilde{s}}_{\tau }\Vert +\Vert {\tilde{z}}_{\tau }\Vert ), \end{aligned}$$
(31)

where \(c_{1}=\mathrm {max}\left\{ \sqrt{\frac{n(n+1)}{2}}c_{k1}\right\} \), \(c_{2}=\mathrm {max}\left\{ \sqrt{\frac{n(n+1)}{2}}c_{k2}\right\} \), \(k=1,2,\ldots ,n\).

By applying the Young’s inequality, it yields

$$\begin{aligned} 2c_{1}\Vert P_{2}\Vert \Vert {\tilde{s}}\Vert \Vert {\tilde{z}}\Vert&\le \frac{c_{1}^{2}}{\lambda _{1}}\Vert P_{2}\Vert \Vert {\tilde{s}}\Vert ^{2} +\lambda _{1}\Vert P_{2}\Vert \Vert {\tilde{z}}\Vert ^{2}, \end{aligned}$$
(32)
$$\begin{aligned} 2c_{2}\Vert P_{2}\Vert \Vert {\tilde{s}}\Vert \Vert {\tilde{z}}_{\tau }\Vert&\le \frac{c_{2}^{2}}{\lambda _{2}}\Vert P_{2}\Vert \Vert {\tilde{s}}\Vert ^{2} +\lambda _{2}\Vert P_{2}\Vert \Vert {\tilde{z}}_{\tau }\Vert ^{2},\end{aligned}$$
(33)
$$\begin{aligned} 2c_{2}\Vert P_{2}\Vert \Vert {\tilde{s}}\Vert \Vert {\tilde{s}}_{\tau }\Vert&\le \frac{c_{2}^{2}}{\lambda _{3}}\Vert P_{2}\Vert \Vert {\tilde{s}}\Vert ^{2 }+\lambda _{3}\Vert P_{2}\Vert \Vert {\tilde{s}}_{\tau }\Vert ^{2}, \end{aligned}$$
(34)

where \(\lambda _{1}\), \(\lambda _{2}\) and \(\lambda _{3}\) are positive constants.

Substituting equations (32)–(34) into (31), one has

$$\begin{aligned} 2{\tilde{s}}^{\mathrm {T}}P_{2}f&\le \alpha _{3}{\tilde{z}}^{\mathrm {T}}P_{1}{\tilde{z}}+\alpha _{4}{\tilde{s} }^{\mathrm {T}}P_{2}{\tilde{s}}\nonumber \\&\quad +\lambda _{2}\Vert P_{2}\Vert \Vert {\tilde{z}}_{\tau }\Vert ^{2}+\lambda _{3}\Vert P_{2}\Vert \Vert {\tilde{s}}_{\tau }\Vert ^{2}, \end{aligned}$$
(35)

where \(\alpha _{3}=\frac{\lambda _{1}\Vert P_{2}\Vert }{\lambda _{\mathrm {min}}(P_{1})}\), \(\alpha _{4}=\Bigg (2c_{1}\Vert P_{2}\Vert +\frac{c_{1}^{2}\Vert P_{2}\Vert }{\lambda _{1}}+\frac{c_{2}^{2}\Vert P_{2}\Vert }{\lambda _{2}}+\frac{c_{2}^{2}\Vert P_{2}\Vert }{\lambda _{3}}\Bigg )/\lambda _{\mathrm {min}}(P_{2})\).

According to system (6) and equations (22)–(25), the derivative of V(t) can be reorganized as

$$\begin{aligned} {\dot{V}}(t)&\le -\rho V_{3}-\left[ \left( \eta _{1}-\alpha _{1}-\iota _{1}\phi \right) K+\left( \iota _{1}\varrho -{\bar{\alpha }}_{3}\right) \right] )V_{1}(t)\nonumber \\&\quad -\left[ \left( \eta _{2}-\alpha _{2}-\iota _{2}\phi \right) K +\left( \iota _{2}\varrho -{\bar{\alpha }}_{4}\right) \right] V_{2}(t). \end{aligned}$$
(36)

where \({\bar{\alpha }}_{3}=\alpha _{3}+\frac{\lambda _{2}e^{\rho \tau ^{*}}\Vert P_{1}\Vert }{(1-{\bar{\tau }})\lambda _{\mathrm {min}}(P_{1})}\), \({\bar{\alpha }}_{4}=\alpha _{4}+\frac{\lambda _{3}e^{\rho \tau ^{*}}\Vert P_{2}\Vert }{(1-{\bar{\tau }})\lambda _{\mathrm {min}}(P_{2})}\).

One can select the parameters \(\phi \) and \(\varrho \) such that

$$\begin{aligned}&\eta _{1}-\alpha _{1}-\iota _{1}\phi >0,~~\eta _{2}-\alpha _{2}-\iota _{2}\phi \end{aligned}$$
(37)
$$\begin{aligned}&\iota _{1}\varrho -{\bar{\alpha }}_{3}>0,\quad \iota _{2}\varrho -{\bar{\alpha }}_{4}>0 \end{aligned}$$
(38)

Hence, there exist positive constants \(\beta _{1}\) and \(\beta _{2}\) such that

$$\begin{aligned} {\dot{V}}(t)\le -\beta V_{1}(t), \end{aligned}$$
(39)

where \(\beta =\mathrm {min}\{\rho , \beta _{1},\beta _{2}\}\). Further, one gets

$$\begin{aligned} V(t)\le V(0)\mathrm {exp}\left( -\beta t\right) . \end{aligned}$$
(40)

Hence, one has

$$\begin{aligned} \Vert {\tilde{z}}\Vert ^{2}&\le \frac{V(0)}{\lambda _{\mathrm {min}}(P_{1})}\mathrm {exp}\left( -\beta t\right) , \nonumber \\ \Vert {\tilde{s}}\Vert ^{2}&\le \frac{V(0)}{\lambda _{\mathrm {min}}(P_{2})}\mathrm {exp}\left( -\beta t\right) . \end{aligned}$$
(41)

From the definitions of \({\tilde{z}}(t)\) and \({\tilde{s}}(t)\), one further obtains

$$\begin{aligned} z_{im}^{2}&\le \frac{V(0)K_{m}^{2(\iota +m-1)}}{\lambda _{\mathrm {min}}(P_{1})} \mathrm {exp}\left( -\beta t\right) , \end{aligned}$$
(42)
$$\begin{aligned} s_{im}^{2}&\le \frac{V(0)K_{m}^{2(\iota +m-1)}}{\lambda _{\mathrm {min}}(P_{2})} \mathrm {exp}\left( -\beta t\right) . \end{aligned}$$
(43)

Combining with the fact that \(K(0)\le K(t)\le K_{m}\) with \(K_{m}=\max \{K(0), \frac{\varrho }{\phi }\}\), which yields

$$\begin{aligned} x\lim _{t\rightarrow \infty }|x_{im}-x_{0m}|&\le \lim _{t\rightarrow \infty }|z_{im}+s_{im}|\nonumber \\&\le \lim _{t\rightarrow \infty }|z_{im}|+\lim _{t\rightarrow \infty }|s_{im}|\rightarrow 0, \end{aligned}$$
(44)

which completes the proof of theorem 1. \(\square \)

Remark 3

The leader-following consensus issue of the nonlinear multiagent system with time delay is well-resolved if the coefficients \(\phi \) and \(\varrho \) of the dynamic gain K(t) are determined. The coefficients \(\phi \) and \(\varrho \) play the key role of the consensus problem, which can be summarized as follows: whether or not the conditions (37) and (38) are satisfied is depend on selections of the \(\phi \) and \(\varrho \), which further determines the stability analysis of systems (1). Besides, by selecting positive constants \(\phi \) and \(\varrho \), one can derive that the time-varying function K(t) is a nondecreasing one and satisfies \(K(0)\le K(t)\le K_{m}\). On the other hand, since the time-delay \(\tau (t)\) is nonnegative and bounded, thus, one can further conclude that \(K(t)\ge K(t-\tau (t))\).

Remark 4

Regarding aforementioned stability analysis and controller design procedures, the distributed consensus controller of ith agent only required its own relative output and the output information of its neighbors is designed, in which there are some control parameters shall be specified. The corresponding design procedures are summarized as follows:

  1. 1.

    By solving the LMIs presented in lemma 1, the positive matrices \(P_{1}\) and \(P_{2}\) can be obtained.

  2. 2.

    Based on the assumption (3), the parameters \(c_{1}\) and \(c_{2}\) can be specified.

  3. 3.

    Choosing appropriate parameters \(\lambda _{i}(i=1,2,3)\), the coefficients \(\alpha _{1}\), \(\alpha _{2}\), \({\bar{\alpha }}_{3}\), \({\bar{\alpha }}_{4}\) can be directly computed.

  4. 4.

    Based on (37) and (38), specify \(\phi \) and \(\varrho \).

Remark 5

In [14], the output feedback consensus control problem was investigated by establishing the dynamic gain observer for each agent. Besides, the distributed leader-following consensus protocol was proposed by using the relative outputs and the estimation of the state variables of its neighbors. Different from this pioneering works, the practical case that the nonlinear multiagent systems subjected to the time delay is considered. Thus, the works in [14] can be regard as a special case of this work with \(\tau (t)=0\). Compared with the works in [24, 25], the dynamic gain compensator was established constituted the relative outputs of all followers, which is replaced by the state observer just consisted of its own output in our works. Therefore, the number of the communication variable can be reduced at certain degree.

It is worthy that the Lipschitz growth rates are known constants in assumption 2, which will limit the applications of the theoretical results. Hence, in this part, the condition of the Lipschitz growth rates will be relaxed and the output feedback control theoretical based on the general case will be followed.

Assumption 4

Consider the function \(h_{m}(t,{\underline{x}}_{i,m},{\underline{x}}_{i,m}(t-\tau (t)))\). Suppose that there exist nonnegative constants \(\epsilon _{i}\) and \(\upsilon _{i}\), \(i=1,2\) satisfying \(2\upsilon _{2}<\upsilon _{1}\) such that the following inequality holds for each \(m=1,2,\ldots ,n\)

$$\begin{aligned}&|h_{m}(t,{\underline{x}}_{i,m},{\underline{x}}_{i,m}(t-\tau (t)))\nonumber \\&\quad -h_{m}(t,{\underline{x}}_{0,m}(t),{\underline{x}}_{0,m}(t-\tau (t)))|\nonumber \\&\quad \le \sum _{k=1}^{m}\epsilon _{1}e^{\upsilon _{1} t}|x_{ik}-x_{0k}|\nonumber \\&\qquad +\sum _{k=1}^{m}\epsilon _{2}e^{\upsilon _{2} t}|x_{ik\tau }-x_{0k\tau }|~~\forall t, \end{aligned}$$
(45)

where \(x_{ik\tau }=x_{ik}(t-\tau (t))\).

As stated in [14], the growth nonlinearities with respect to unmeasured state components play the key role in the output feedback control problem. Hence, the growth condition is necessary in addressing nonlinearities depending on unmeasured states. Compared the known constants Lipschitz growth rates, the distributed consensus controller design for the unknown time-varying Lipschitz growth rates seems to be difficult mainly resulted from the evident challenging summarized as follows: the upper bound of the derivative of the Lyapunov function is dependent of the unknown time-varying Lipschitz growth rates, hence, how to design the dynamic gain such that the effect induced by the time-varying Lipschitz growth rates contains certain challenging.

In what follows, the distributed leader-following consensus protocol for the case that Lipschitz growth rates of the nonlinear functions are unknown time-varying functions will be proposed in the manner of following theorem.

Theorem 2

If the assumptions (1), (3) and (4) are satisfied, then the output of each follower can ultimately asymptotically track that of the leader by designing the observer (6)-based distributed linear-like controller (13) with

$$\begin{aligned} {\dot{K}}(t)=\mathrm {max}\left\{ -\phi K^{2}+\varrho _{1} e^{\upsilon _{1} t}K, 0\right\} , \end{aligned}$$
(46)

where \(\phi \), \(\varrho _{1}\) are positive constants specified subsequently such that \(K(t)\ge 1\).

Proof

Combining with assumption 4, one obtains

$$\begin{aligned} |f_{i,m}|&=K^{1-m-\iota }\left| h_{m}(t,{\underline{x}}_{i,m},{\underline{x}}_{i,m\tau })\right. \nonumber \\&\quad \left. -h_{m}(t,{\underline{x}}_{0,m},{\underline{x}}_{0,m\tau })\right| \nonumber \\&\le K^{1-m-\iota }\left[ \sum _{k=1}^{m}\epsilon _{1}e^{\upsilon _{1} t}|x_{ik}-x_{0k}|\right. \nonumber \\&\quad \left. +\sum _{k=1}^{m}\epsilon _{2}e^{\upsilon _{2} t}|x_{ik\tau }-x_{0k\tau }|\right] \nonumber \\&\le K^{1-m-\iota }\left[ \sum _{k=1}^{m}\epsilon _{1}e^{\upsilon _{1} t}|s_{ik}+z_{ik}|\right. \nonumber \\&\quad \left. +\sum _{k=1}^{m}\epsilon _{2}e^{\upsilon _{2} t}|s_{ik\tau }+z_{ik\tau }|\right] \nonumber \\&\le K^{1-m-\iota }\left[ \sum _{k=1}^{m}K^{m-1+\iota }\epsilon _{1}e^{\upsilon _{1} t} \left| {\tilde{s}}_{ik}+{\tilde{z}}_{ik}\right| \right. \nonumber \\&\quad \left. +\sum _{k=1}^{m}K_{\tau }^{m-1+\iota } \epsilon _{2}e^{\upsilon _{2} t}\left| {\tilde{s}}_{ik\tau }+{\tilde{z}}_{ik\tau }\right| \right] \nonumber \\&\le \sum _{k=1}^{m}\epsilon _{1}e^{\upsilon _{1} t}\left( |{\tilde{s}}_{ik}| +|{\tilde{z}}_{ik}|\right) \nonumber \\&\quad +\sum _{k=1}^{j}\epsilon _{2}e^{\upsilon _{2} t} \left( |{\tilde{s}}_{ik\tau }|+|{\tilde{z}}_{ik\tau }|\right) , \end{aligned}$$
(47)

which yields

$$\begin{aligned} 2{\tilde{s}}^{\mathrm {T}}P_{2}f&\le 2\Vert {\tilde{s}} \Vert \Vert P_{2}\Vert (\omega _{1}e^{\upsilon _{1} t}(\Vert {\tilde{s}}\Vert +\Vert {\tilde{z}}\Vert )\nonumber \\&\quad +\omega _{2}e^{\upsilon _{2} t}(\Vert {\tilde{s}}_{\tau }\Vert +\Vert {\tilde{z}}_{\tau }\Vert ), \end{aligned}$$
(48)

where \(\omega _{1}=\sqrt{\frac{n(n+1)}{2}}\epsilon _{1}\), \(\omega _{2}=\sqrt{\frac{n(n+1)}{2}}\epsilon _{2}\).

Following the similar procedures in (35), eq. (48) can be reorganized as

$$\begin{aligned} 2{\tilde{s}}^{\mathrm {T}}P_{2}f&\le \zeta _{1}e^{\upsilon _{1} t}V_{1}(t)+(\zeta _{2} +\zeta _{3}e^{\left( 2\upsilon _{2}-\upsilon _{1}\right) t})e^{\upsilon _{1} t}V_{2}(t)\nonumber \\&\quad +\lambda _{2}\Vert P_{2}\Vert \Vert {\tilde{z}}_{\tau }\Vert ^{2}+\lambda _{3}\Vert P_{2}\Vert \Vert {\tilde{s}}_{\tau }\Vert ^{2} \end{aligned}$$
(49)

where \(\zeta _{1}=\frac{\lambda _{1}\Vert P_{2}\Vert \omega _{1}}{\lambda _{\min (P_{1})}}\), \(\zeta _{2}=\frac{2\Vert P_{2}\Vert \omega _{1}}{\lambda _{\min (P_{2})}}+\frac{\Vert P_{2}\Vert \omega _{1}}{\lambda _{1}\lambda _{\min (P_{2})}}\), \(\zeta _{3}=\frac{\Vert P_{2}\Vert \omega _{2}^2}{\lambda _{2}\lambda _{\min (P_{2})}}+\frac{\Vert P_{2}\Vert \omega _{2}^2}{\lambda _{3}\lambda _{\min (P_{2})}}\).

By utilizing the Lyapunov function (21) and following the similar procedures in theorem 1, one has

$$\begin{aligned} {\dot{V}}(t)&\le -\rho V_{3}(t)-\left( \left( \eta _{1}-\alpha _{1}-\iota _{1}\phi \right) K\right. \nonumber \\&\quad \left. +\left( \left( \iota _{1}\varrho _{1}-\zeta _{1}\right) e^{\upsilon _{1} t} -\zeta _{4}\right) \right) V_{1}(t)\nonumber \\&\quad -\left( \left( \eta _{2}-\alpha _{2}-\iota _{2}\phi \right) K\right. \nonumber \\&\quad \left. +\left( (\iota _{2}\varrho _{1}-(\zeta _{2}+\zeta _{3}e^{\left( 2\upsilon _{2}-\upsilon _{1}\right) t}))e^{\upsilon _{1} t}-\zeta _{5}\right) \right) V_{2}(t). \end{aligned}$$
(50)

where \(\zeta _{4}=\frac{\lambda _{2}e^{\rho \tau ^{*}}\Vert P_{1}\Vert }{(1-{\bar{\tau }})\lambda _{\mathrm {min}}(P_{1})}\), \(\zeta _{5}=\frac{\lambda _{3}e^{\rho \tau ^{*}}\Vert P_{2}\Vert }{(1-{\bar{\tau }})\lambda _{\mathrm {min}}(P_{2})}\).

Choose parameter \(\phi \) such that

$$\begin{aligned}&\eta _{1}-\alpha _{1}-\iota _{1}\phi>0,~\eta _{2}-\alpha _{2}-\iota _{2}\phi >0 \end{aligned}$$
(51)
$$\begin{aligned}&\iota _{1}\varrho _{1}-\zeta _{1}>0,~\iota _{2}\varrho _{1}-\zeta _{2}-\zeta _{3}>0 \end{aligned}$$
(52)

. In addition, one knows that there must be instant \(t_{1}^{*}\) and \(t_{2}^{*}\) satisfying \(e^{\upsilon _{1} t}>\frac{\zeta _{4}}{\iota _{1}\varrho _{1}-\zeta _{1}}\) and \(e^{\upsilon _{1} t}>\frac{\zeta _{5}}{\iota _{2}\varrho _{1}-\zeta _{2}-\zeta _{3}}\) for \(t\in [t^{*},\infty )\) with \(t^{*}=\max \{t_{1}^{*},t_{2}^{*}\}\).

Hence, let \({\bar{\mu }}=\max \{\eta _{1}-\alpha _{1}-\iota _{1}\phi ,\eta _{2}-\alpha _{2}-\iota _{2}\phi \}\), for \(t\in [t^{*},\infty )\), there exist a positive constant \(\mu =\min \{{\bar{\mu }} K(0),\rho \}\) such that

$$\begin{aligned} {\dot{V}}(t)\le -\mu V(t). \end{aligned}$$
(53)

Further, one gets

$$\begin{aligned} {\dot{V}}(t)\le V(t^{*})\exp (-\mu (t-t^{*})),~~t\in [t^{*},\infty ), \end{aligned}$$
(54)

which implies that

$$\begin{aligned} \Vert {\tilde{z}}\Vert ^{2}&\le \frac{V(t^{*})}{\lambda _{\mathrm {min}}(P_{1})}\mathrm {exp}\left( -\mu (t-t^{*})\right) ,\nonumber \\ \Vert {\tilde{s}}\Vert ^{2}&\le \frac{V(t^{*})}{\lambda _{\mathrm {min}}(P_{2})}\mathrm {exp}\left( -\mu (t-t^{*})\right) . \end{aligned}$$
(55)

Similar as the previous procedures, one has

$$\begin{aligned} z_{im}^{2}&\le \gamma _{1}K^{2(\iota +m-1)}\mathrm {exp}(-\mu t), \end{aligned}$$
(56)
$$\begin{aligned} s_{im}^{2}&\le \gamma _{2}K^{2(\iota +m-1)}\mathrm {exp}(-\mu t), \end{aligned}$$
(57)

where \(\gamma _{1}=\frac{V(t^{*})e^{\mu t^{*}}}{\lambda _{\mathrm {min}}(P_{1})}\), \(\gamma _{2}=\frac{V(t^{*})e^{\mu t^{*}}}{\lambda _{\mathrm {min}}(P_{2})}\).

According to (46), one notes that \(K(t)\le \max \{K(0), \frac{\varrho _{1}e^{\upsilon _{1} t}}{\phi }\}\), which yields

$$\begin{aligned} z_{im}^{2}&\le \gamma _{1}\max \{K_{0}^{\delta _{m}},\xi _{m} e^{\delta _{m}\upsilon _{1}t}\}\mathrm {exp}(-\mu t), \end{aligned}$$
(58)
$$\begin{aligned} s_{im}^{2}&\le \gamma _{2}\max \{K_{0}^{\delta _{m}},\xi _{m} e^{\delta _{m}\upsilon _{1}t}\}\mathrm {exp}(-\mu t), \end{aligned}$$
(59)

where \(\delta _{m}=2(\iota +m-1)\), \(\xi _{m}=(\frac{\varrho _{1}}{\phi })^{\delta _{m}}\), \(K_{0}^{\delta _{m}}=(K_{0})^{\delta _{m}}\).

By choosing

$$\begin{aligned} \rho >\delta _{n}\upsilon _{1}+\kappa ,~~K(0)\ge \max \left\{ 1,\frac{\delta _{n}\upsilon _{1}+\kappa }{{\bar{\mu }}}\right\} \end{aligned}$$
(60)

with \(\kappa \) being any positive scalar, one can ensure that \(\lim _{t\rightarrow \infty }z_{im}^{2}\rightarrow 0\) and \(\lim _{t\rightarrow \infty }s_{im}^{2}\rightarrow 0\). The proof is completed for theorem 2. \(\square \)

4 Simulation example

In this part, the simulation examples are presented to verify the effectiveness of the proposed protocols.

Example 1

Consider the following chemical reactor with delayed recycle streams, whose dynamic models can be described as follows:

$$\begin{aligned} {\dot{x}}_{i1}&=-\frac{1}{\alpha _{i1}}x_{i1}-\beta _{i1}x_{i1}\nonumber \\&\quad +\frac{1-\theta _{i2}}{\varpi _{i1}}x_{i2}+F_{1}(\cdot )\nonumber \\ {\dot{x}}_{i2}&=-\frac{1}{\alpha _{i2}}x_{i2}-\beta _{i2}x_{i2} +\frac{\theta _{i1}}{\varpi _{i2}}x_{i1}(t-\tau (t))\nonumber \\&\quad +\frac{h_{i2}}{\varpi _{i2}}u_{i}+F_{2}(\cdot )\nonumber \\ y_{i}&=x_{i1}(t) \end{aligned}$$
(61)

where \(x_{i1}\), \(x_{i2}\) represent the compositions; \(\alpha _{i1}\), \(\alpha _{i2}\) denote the reactor residence times; \(\beta _{i1}\), \(\beta _{i2}\) stand for the reaction variables; \(\theta _{i2}\) refers to as the recycle flow rate; \(\omega _{i2}\) denotes the feed rate; \(\varpi _{i1}\), \(\varpi _{i1}\) denotes the reactor volumes; \(F_{i1}\) and \(F_{i2}\) stand for the intrinsic nonlinear features of the following chemical reactor; \(\tau (t)\) is the unknown time-varying delay. Motivated by the work in [24, 25], the corresponding simulation parameters are defined as: \(\alpha _{i1}=\alpha _{i2}=10\); \(\beta _{i1}=0.02\); \(\beta _{i2}=0.05\), \(\theta _{i1}=0.2\), \(\theta _{i2}=0.2\), \(\varpi _{i1}=\varpi _{i2}=0.8\); \(h_{i2}=0.8\); \(F_{1}(\cdot )=0.03x_{i1}\), \(F_{2}=-0.25x_{i2}(t-\tau (t))\), \(\tau (t)=0.6+0.2\mathrm {sin}(t)\). Substituting these parameters into (61) leads to

$$\begin{aligned} {\dot{x}}_{i1}&=x_{i2}+\delta _{1}(x_{i1}(t))\nonumber \\ {\dot{x}}_{i2}&=u_{i}+\delta _{2}({\underline{x}}_{i2}(t),{\underline{x}}_{i2}(t-\tau (t))) \end{aligned}$$
(62)

where \(\delta _{1}(x_{i1}(t))=-0.09x_{i1}\), \(\delta _{2}({\underline{x}}_{i2}(t),{\underline{x}}_{i2}(t-\tau (t)))=-0.15x_{i2}-0.25x_{i1}(t-\tau (t))-0.25x_{i2}(t-\tau (t))\).

Further, one has

$$\begin{aligned} |\delta _{1}|&\le 0.09 |x_{i1}|\\ |\delta _{2}|&\le 0.15 \sum _{j=1}^{2}|x_{ij}(t)|+0.25\sum _{j=1}^{2}|x_{ij}(t-\tau (t))| \end{aligned}$$

Obviously, the assumption (2) about the nonlinear function is satisfied. From (6), the distributed dynamic observer for system (62) is formulated as

$$\begin{aligned} \dot{{\hat{x}}}_{i,1}&={\hat{x}}_{i,2}+l_{1}K(x_{i,1}-{\hat{x}}_{i,1})\nonumber \\ \dot{{\hat{x}}}_{i,2}&=u_{i}+l_{2}K^{2}(x_{i,1}-{\hat{x}}_{i,1}) \end{aligned}$$
(63)
Fig. 2
figure 2

Communication topology of multiagent systems (61)

The communication topology graph is shown in Fig. 2, where the leader is indexed by 0 and followers are indexed from 1 to 4. The weighted adjacent matrix of graph \({\mathcal {G}}\) and connection weight matrix are given as

$$\begin{aligned} A=\left[ \begin{matrix} 0&{} 1&{} 0&{} 0 \\ 1 &{}0&{} 1&{} 0 \\ 0&{} 1&{} 0&{} 0 \\ 0&{} 0&{} 0&{} 0 \end{matrix}\right] ,B=\mathrm {diag}\{1,0,0,1\}. \end{aligned}$$

Let \(l_{1}=0.6\), \(l_{2}=0.8\), \(q_{1}=q_{2}=6\), \(\eta _{1}=0.3\), \(\rho =0.1\), \(\eta _{2}=0.2\), \(\iota _{1}=0.1\), \(\iota _{2}=0.1\). By solving the conditions in Lemma 1, the positive definite matrix \(P_{1}\) and \(P_{2}\) can be obtained. Hence, one has \(\lambda _{\min }(P_{1})=0.0768\), \(\lambda _{\min }(P_{2})= 0.1654\), \(\Vert P_{1}\Vert =0.9742\), \(\Vert P_{2}\Vert =0.4098\). By directly computation, one has \(c_{1}=0.2598\), \(c_{2}=0.4330\), \(\tau ^{*}=0.8\), \({\bar{\tau }}=0.2\). Based on conditions (37) and (38), the coefficients of the dynamical gain K(t) can be specified as \(\phi = 7.1849\) and \(\varrho = 67.2705\). The simulation results are shown in Figs. 3, 4, 5, 6, 7, 8, 9, 10, which further verify the effectiveness of the theoretical results. Figures 3 and 4 show the signal response curves of the system (61) with initial condition \(x_{0,1}(t)=1.6\), \(x_{0,2}(t)=0.1\), \(x_{1,1}(t)=0.1\), \(x_{1,2}(t)=0.4\), \(x_{2,1}(t)=0.7\), \(x_{2,2}(t)=0.3\), \(x_{3,1}(t)=0.9\), \(x_{3,2}(t)=0.6\), \(x_{4,1}(t)=1.3\), \(x_{4,2}(t)=0.9\). The control input response curves and the dynamic gain response curve are shown in Figs. 5,  6 with the initial condition \(u_{i}(t)=0(i=0,1,\ldots ,4)\) and \(K(t)=5\), respectively. The state variables of the dynamic gain observer are shown in Figs. 910 with the initial condition \({\hat{x}}_{0,1}(t)=0.1\), \({\hat{x}}_{0,2}(t)=0.1\), \({\hat{x}}_{1,1}(t)=0.5\), \({\hat{x}}_{1,2}(t)=0.4\), \({\hat{x}}_{2,1}(t)=0.3\), \({\hat{x}}_{2,2}(t)=0.3\), \({\hat{x}}_{3,1}(t)=0.1\), \({\hat{x}}_{3,2}(t)=0.6\), \({\hat{x}}_{4,1}(t)=0.7\), \({\hat{x}}_{4,2}(t)=0.9\). Based on these, one can conclude that the validity of theorem 1 is well-illustrated by the simulation example 1.

Fig. 3
figure 3

Response curves of the output \(y_{i}\) of system (61), \(i=0,1,2,3,4\)

Fig. 4
figure 4

Response curves of the state variables \(x_{i2}\) of system (61), \(i=0,1,2,3,4\)

Fig. 5
figure 5

Response curves of the control input \(u_{i}\) of system (61) \(i=1,2,3,4\)

Fig. 6
figure 6

Response curve of the dynamic gain parameter K(t) of system (61)

Fig. 7
figure 7

Response curves of the output of the observer \({\hat{x}}_{i1}\) of system (61)

Fig. 8
figure 8

Response curves of the state variables of observer \({\hat{x}}_{i2}\) of system (61)

Example 2

To show the effectiveness and the validity of theorem 2, the following multiagent systems are considered as:

$$\begin{aligned} {\dot{x}}_{i,m}&=x_{i,m+1}+h_{m}(t,{\underline{x}}_{i,m}(t), {\underline{x}}_{i,m}(t-\tau (t))),\nonumber \\ {\dot{x}}_{i,n}&=u_{i}(t)+h_{n}(t,{\underline{x}}_{i,n}(t), {\underline{x}}_{i,n}(t-\tau (t))),\\ y_{i}(t)&=x_{i,1}(t)\nonumber , \end{aligned}$$
(64)

where \(x_{i}=\left[ x_{i,1},x_{i,2}\right] ^{\mathrm {T}}\in {\mathbb {R}}^{2}\), \(y_{i}\in {\mathbb {R}}\) and \(u_{i}\in {\mathbb {R}}\) represent the output measurement and the control signal of agent i, respectively. \(h_{1}(t,x_{i,1})=0.2e^{0.2t}x_{i,1}+0.25e^{0.05t}x_{i,1}(t-\tau (t))\), \(h_{2}(t,x_{i,1},x_{i,2})=0.3e^{0.2t}x_{i,2}+0.25e^{0.05t}x_{i,1}(t-\tau (t))-0.25e^{0.05t}x_{i,2}(t-\tau (t))\). The communication graph is shown in Fig. 9, where the leader is indexed by 0 and followers are indexed from 1 to 4. The weighted adjacent matrix of graph \({\mathcal {G}}\) and connection weight matrix are given as

$$\begin{aligned} A=\left[ \begin{matrix} 0&{} 1&{} 0&{} 0 \\ 1 &{}0&{} 1&{} 0 \\ 0&{} 1&{} 0&{} 1 \\ 0&{} 0&{} 1&{} 0 \end{matrix}\right] ,B=\mathrm {diag}\{1,0,0,1\}. \end{aligned}$$

From the definition of nonlinear functions, one knows that the nonlinear terms satisfy assumption (4) with \(\epsilon _{1}=0.2\), \(\epsilon _{2}=0.3\), \(\upsilon _{1}=2\), \(\upsilon _{2}=0.5\), and other simulation parameters are given in example 1. The coefficients \(\phi \) and \(\varrho _{1}\) of the dynamical gain k(t) can be specified as \(\phi =6.0656\) and \(\varrho _{1}=26.0715\). The simulation results are shown in Figs. 10, 10, 12, which further verify the effectiveness of the theoretical results. Figure 10 shows the response curves of the closed-loop systems (64) with initial condition \(x_{0}(t)=[0,0]^{\mathrm {T}}\), \(x_{i}(t)=[-i,2i]^{\mathrm {T}}\) \((i=1,2,3,4)\). The control input response curves and the dynamic gain response curve are shown in Fig. 11 with the initial condition \(u_{i}(t)=0(i=0,1,\ldots ,4)\) and \(K(t)=9\), respectively. The state variables of the dynamic gain observer are shown in Fig. 12 with the initial condition \({\hat{x}}_{i}(t)=[0,0]^{\mathrm {T}}\) \((i=0,1,2,\ldots ,5)\). Hence, one can conclude that the validity and the effectiveness of theorem 2 are well-illustrated by the simulation example 2.

Fig. 9
figure 9

Communication topology of multiagent systems (64)

Fig. 10
figure 10

Response trajectories of the closed-loop systems(64)

Fig. 11
figure 11

Response curves of the control input \(u_{i}\) and dynamical gain K(t) of the closed-loop systems(64)

Fig. 12
figure 12

Response trajectories of the dynamical observer of the closed-loop systems(64)

5 Conclusion

In this paper, the output feedback consensus issue has been addressed for a class of nonlinear multiagent systems with time delay. In order to compensate the effect induce by the immeasurable state variables, the dynamic gain observer for each agent was formulated. With the help of the coordinate transformation, the consensus problems were transformed into the stabilization problem, which overcomes the explosion of complexity problem of the back-stepping method. By virtual of the Lyapunov-like approach, the distributed consensus protocols were established both for the case that the Lipschitz growth rates were known constants and unknown time-varying functions. The simulation examples have been performed to verify the effectiveness of the consensus agreements presented in this paper. Other interesting research directions would be the further extension of the current outcomes to the output feedback leader-following consensus problems for multiagent systems under weighted directed graph (see [12, 13])