 Research
 Open Access
 Published:
A novel finitetime average consensus protocol based on eventtriggered nonlinear control strategy for multiagent systems
Journal of Inequalities and Applications volumeÂ 2017, ArticleÂ number:Â 258 (2017)
Abstract
We present a novel finitetime average consensus protocol based on eventtriggered control strategy for multiagent systems. The system stability is proved. The lower bound of the interevent time is obtained to guarantee that there is no Zeno behavior. Moreover, the upper bound of the convergence time is obtained. The relationship between the convergence time and protocol parameter with initial state is analyzed. Lastly, simulations are conducted to verify the effectiveness of the results.
1 Introduction
In recent years, many applications required a lot of vehicles or robots to work cooperatively and accomplish a complicated task. Given this, many researchers have devoted themselves to the studies of coordination control of multiagent systems [1, 2]. The primary researches in this field include the problems of consensus [3], flocking [4], formation control [5, 6], collective behavior of swarms [7, 8], etc. Of these, the issue of consensus is the basis of studying other problems. Multiagent consensus refers to the design of a proper consensus protocol based on the local information of each agent such that all agents can reach an agreement with regard to certain quantities of interest [4].
In practical multiagent systems, each agent is usually equipped with a small embedded microprocessor and has limited energy, which usually has only limited computing power and working time. These disadvantages drive researchers to develop eventtriggered control schemes, and some important achievements have been made recently [9â€“11]. For example, in [12] the authors introduced the deterministic eventtriggered strategy to develop consensus control algorithms, and the lower bound of the interevent time was obtained to guarantee that there is no Zeno behavior. In [13] the problems of eventtriggered integrated fault detection, isolation, and control for discretetime linear systems were considered. It was shown that the amount of data that is sent through the sensortofilter and filtertoactuator channels are dramatically decreased by using an eventtriggered technique applied to both the sensor and filter nodes. In [14], the authors proposed a new multiagent consensus eventbased control approach. The measurement broadcasts were scheduled in an eventbased fashion, and the continuous monitoring of each neighborâ€™s state is no longer demanded. In [15] the authors proposed a combinational measurement strategy to event design and developed a new eventtriggered control algorithm. In this strategy, each agent is only triggered at his own event time, which lowers the frequency of controller updates and reduces the amount of communication. In [16] the authors proposed a selftriggered consensus algorithm for multiagent systems. The algorithm is simpler in formulation and computation. Thus, more energy can be saved using the proposed algorithm in practical multiagent systems.
Moreover, the convergence time is a significant performance indicator for a consensus protocol in the study of the consensus problem. In most works the protocols only achieve state consensus in infinite time interval, that is, the consensus is only achieved asymptotically. However, the stability or performance of multiagent systems in a finite time interval needs to be considered in several cases. The finitetime stability focuses on the behavior of system responses over a finite time interval [17, 18]. Therefore, studying the finitetime stability of multiagent systems is valuable to some degree. The multiagent finitetime stability analysis has also elicited the attention of many researchers [19â€“22].
Recently, there are few results reported in the literature to address finitetime eventtriggered control consensus protocols for multiagent systems. To the best of our knowledge, in [23] the authors presented two novel nonlinear consensus protocols based on eventdriven strategy to investigate the finitetime consensus problem of leaderless and leaderfollowing multiagent systems. However, many parameters exist in the proposed protocols, making the protocols complex and restricted, and the relationship between the convergence time and parameters is unclear. Inspired by these, a new consensus protocol based on the eventtriggered control strategy is proposed in this paper.
The main contributions of this paper can be summarized as follows: (1)Â a new finitetime consensus protocol based on the eventtriggered control strategy for multiagent systems is presented, and the system stability is proved. The protocol is simpler in formulation and computation. (2)Â The lower bound of the interevent time is gotten to guarantee there is no Zeno behavior. (3)Â The upper bound of convergence time is obtained. The relationship between the convergence time and protocol parameter, the initial state, is analyzed.
The rest of this paper is organized as follows. In SectionÂ 2, we introduce some essential background and present the problem statement. The main results and the proof are provided in SectionÂ 3. The simulation results are shown in SectionÂ 4, and the conclusions and the future works are provided in SectionÂ 5.
Notations
\(\mathbf{1}= [1,1,\ldots,1]^{\mathrm{T}}\) with compatible dimensions, \(\mathcal{I}_{n} = \{ 1,2,\ldots,n\}\). \(x\) is the absolute value of a real number x, \(\\cdot\\) denotes the 2norm in \(R^{n}\), \(\operatorname{span}\{ \mathbf{1}\} = \{\boldsymbol{\varepsilon} \in R^{n}:\boldsymbol{\varepsilon} = r\mathbf{1},r \in R\}\), and E is the Euler number (approximately 2.71828).
2 Background and problem statement
2.1 Preliminaries
In this subsection, we introduce some basic definitions and results of algebraic graph theory. Comprehensive conclusions on algebraic graph theory are found in [24]. Moreover, we present two essential lemmas.
For an undirected graph \(\mathcal{G} = ( \mathcal {V},\mathcal{E},\mathcal{A} )\) with n vertices, \(\mathcal{V} = \{ v_{1},v_{2},\ldots,v_{n}\}\) is the vertex set, and \(\mathcal{E}\) is the edge set, the adjacency matrix \(\mathcal{A} = [a_{ij}]\) is the \(n \times n\) matrix defined by \(a _{ij}=1\) for \((i,j) \in\mathcal{E}\) and \(a _{ij}=0\) otherwise. The neighbors of a vertex \(v _{i}\) are denoted by \(\mathcal {N}_{i} = \{ v_{j} \in\mathcal{V}:(v_{i},v_{j}) \in \mathcal{E}\}\), and then the vertices \(v _{i}\) and \(v _{j}\) are called adjacent. A path from \(v _{i}\) to \(v _{j}\) is a sequence of distinct vertices starting with \(v _{i}\) and ending with \(v _{j}\) such that consecutive vertices are adjacent. A graph is regarded as connected if there is a path between any two distinct vertices. The Laplacian of a graph \(L= [l _{ij}] \in R^{n \times n}\) is defined by \(l_{ij} = \sum_{k = 1,k \ne i}^{n} a_{ik}\) for \(i=j\) and \(l _{ij}= a _{ij}\) otherwise. L has always a zero eigenvalue, and 1 is the associated eigenvector. We denote the eigenvalues of L by \(0= \lambda _{1}(L)\leq\lambda_{2}(L)\leq\cdots\leq\lambda _{n}(L)\). For an undirected and connected graph, \(\lambda_{2}(L) = \min_{\boldsymbol{\varepsilon} \ne0,1^{T}\boldsymbol{\varepsilon} = 0}\frac{\boldsymbol{\varepsilon}^{\mathrm{T}}L\boldsymbol{\varepsilon}}{ \boldsymbol{\varepsilon}^{\mathrm{T}}\boldsymbol{\varepsilon}} > 0\). Therefore, if \(\mathbf{1}^{\mathrm{T}} \boldsymbol{\varepsilon} = 0\), then \(\boldsymbol{\varepsilon} ^{\mathrm{T}} L \boldsymbol{\varepsilon} \geq \lambda_{2}(L) \boldsymbol{\varepsilon} ^{\mathrm{T}} \boldsymbol{\varepsilon} \).
Lemma 1
([25])
Suppose that a function \(V(t): [0, \infty) \rightarrow[0, \infty)\) is differentiable and satisfies the condition
where \(K >0\) and \(0 < \alpha <1\). Then \(V(t)\) reaches zero at \(t ^{*}\), and \(V(t) =0\) for all \(t \geq t ^{*}\), where
Lemma 2
([26])
If \(\xi_{1},\xi_{2}, \ldots,\xi_{n} \ge 0\) and \(0< p \leq1\), then
2.2 Problem formulation
The multiagent system investigated in this study consists of n agents, and the state of agent i is denoted by \(x _{i}\), \(i \in\mathcal{I}_{n}\). Denote the vector \(\mathbf{x} =[x _{1}, x _{2}, \ldots, x _{n}]^{\mathrm{T}}\). The dimension of \(x _{i}\) can be arbitrary as long as it is the same for all agents. For simplicity, we only analyze the onedimensional case. The results are still valid for multidimensional cases through the introduction of the Kronecker product and inequality (3). We suppose that each agent satisfies the dynamics
where \(u _{i}\) is the protocol, which is designed based on the state information received by the corresponding agent from its neighbors.
With the given protocol \(u _{i}\), for any initial state, if there is a stable equilibrium \(x ^{*}\) and a time \(t ^{*}\) satisfying \(x_{i}= x ^{*}\) for all \(i \in\mathcal{I}_{n}\) with \(t \geq t ^{*}\), then the finitetime consensus problem is solved [25]. In addition, the average consensus problem is solved if the final consensus state is the average value of the initial state, namely, \(x_{i}(t) = \sum_{i = 1}^{n} x_{i} (0) / n\) for all \(i \in\mathcal{I}_{n}\) with \(t \to\infty\).
2.3 Eventtriggered control consensus protocol
In the event design, we suppose that each agent can measure its own state \(x _{i}(t)\) and obtain its neighborsâ€™ states stably. For each vertex \(v_{i}\) and \(t \geq 0\), introduce a measurement error \(e _{i}(t)\) and denote the vector \(\mathbf{e} (t)=[e _{1}(t), e _{2}(t),\ldots,e _{n}(t)]\). The time instants at which the events are triggered are defined by the condition \(f(e(t _{i}))=0\). Suppose the triggering time sequence of vertex \(v _{i}\) is \(t^{i} = 0,\tau_{1}, \ldots,\tau_{s}^{i}, \ldots\)â€‰.
Between events are triggered, the value of the input u is held constant and can be formalized as
It is well known that the control algorithm is a piecewise constant function, and the value of the input is equal to the last control update.
The protocol based on eventtriggered control utilized to solve the finitetime average consensus problem is
where \(0< \alpha<1\), and the \(\operatorname{sign}(\cdot)\) is the sign function defined as
3 Main results
3.1 Stability analysis
In this subsection, we study protocol (6). Now, we are in a position to present our main results.
Theorem 1
Suppose that the communication topology of a multiagent system is undirected and connected and that the triggered function is given by
where \(D = [d_{ij}] \in R^{n \times n}\), \(d_{ij} = (a_{ij})^{2 / ( 1 + \alpha )}\), and \(0< \mu<1\).
Then, protocol (6) solves the finitetime average consensus problem for any initial state. Moreover, the settling time T satisfies
Proof
Given that the topology is undirected and connected, \(a _{ij} = a _{ji}\) for all \(i,j \in\mathcal{I}_{n}\). We obtain
Let
Therefore, Îº is time invariant.
Consequently,
Define the measurement error as follows:
Then we get
Let \(\boldsymbol{\delta} (t) = [\delta_{1}(t),\delta_{2}(t), \ldots,\delta_{n}(t)]^{\mathrm{T}}\) and \(x_{i}(t) = \kappa+ \delta_{i}(t)\). Thus,
Here we have taken the Lyapunov function
By differentiating \(V(t)\) we obtain
Equation (17) results from \(\delta_{j}  \delta_{i} = x_{j}  x_{i}\). For \(0 < \alpha< 1\), we have \(0.5 < (1+ \alpha)/2 < 1\). Denote
Suppose that \(V(t) \neq 0\); then \(\boldsymbol{\delta} (t) \neq 0\). By LemmaÂ 2 we have
Then we get
Then
Combining the above formulas results in
According to the triggered function of TheoremÂ 1, we get
Then we get
Therefore, according to LemmaÂ 1, the differential in equation (26) makes \(V(t)\) reach zero in finite time. Moreover, the settling time T satisfies
If \(V(t)=0\), then \(\boldsymbol{\delta} (t)=0\), which implies that \(u _{i} = 0\), \(i \in\mathcal{I}_{n}\). Thus, \({x}(t) \in \operatorname{span}(\mathbf{1})\). Therefore, the system stability is guaranteed, and the novel protocol can solve the finitetime average consensus problem.â€ƒâ–¡
Remark 1
For each agent, an event is triggered as long as the triggered function satisfies \(f_{i} ( t,e_{i}(t),\delta_{i}(t) ) = 0\).
Remark 2
The role of the parameter Î¼ in the triggered function (8) is adjusting the rate of decrease for the Lyapunov function. From equation (8) we know that when the parameter Î¼ is large, the allowable error is large. This means that when Î¼ is large, the trigger frequency is low. From equation (27) we know that when Î¼ is large, the convergence time is long.
Remark 3
Note that if we set \(\mu=0\), then the protocol becomes the typical finitetime consensus protocol studied in [19]. However, the finitetime consensus protocol in [19] does not adapt eventtriggered control strategy, so that the energy consumption of the system is large.
3.2 Existence of a lower bound for interevent times
In the eventtriggered control conditions, the agent cannot exhibit Zeno behavior. Namely, for any initial, the interevent times \(\{ \tau _{i + 1}  \tau_{i} \}\) defined by equation (8) are lower bounded by a strictly positive time Ï„. This is proven in the following theorem.
Theorem 2
Consider the multiagent system (4) with consensus protocol (6). Suppose that the communication topology of the multiagent system is undirected and connected. The trigger function is given by equation (8). Then the agent cannot exhibit Zeno behavior. Moreover, for any initial state, the interevent times \(\{ \tau_{i + 1}  \tau_{i} \}\) are lower bounded by \(\tau_{\mathrm{min}}\) given by
where \(\theta= ( \frac{ ( 4\lambda_{2} ( D ) )^{ ( 1 + \alpha ) / 2}}{2^{ ( 1  \alpha ) / 2}} )^{1 / \alpha} \).
Proof
Similarly to the main result in [27], define
By differentiating \(f _{i}(t)\) we obtain
Then
Then we can get that the interevent times are bounded by the time as follows:
From equation (25) we know
Combining the above formulas results in
and the proof is complete.â€ƒâ–¡
Remark 4
From equation (34) it is easy to see that the minimum interevent time increases with Î¼.
Remark 5
Note that if we set \(\alpha=1\) in protocol (6), then the finitetime nonlinear eventtriggered control strategy becomes the typical eventtriggered linear consensus protocol studied in [9]. However, the eventtriggered linear consensus protocol can only make agents achieve consensus asymptotically, whereas the proposed consensus protocol in this paper can solve the consensus problem in finite time.
3.3 Performance analysis
In this subsection, the relationship between convergence time and other factors, including initial state and parameter Î± is studied.
Firstly, we study the relationship between convergence time and initial states. In the consensus problem, rather than the size of the initial states, the disagreement between states is more concerned. By definition, \(V(0)\) measures the disagreement of the initial states with final state. From equation (27) we easily see that the convergence time increases as \(V(0)\) increases.
Then we study the relationship between convergence time and parameter Î±. Supposing that \(T _{u}\) is the upper bound of the communication time by equation (27) we obtain
Then
Letting \(dT _{u}( \alpha)/d \alpha=0\), we get \(\alpha= 1  2 / \ln ( 4V(0)\lambda_{2}(D) )\). Therefore, given that \(0< \alpha<1\), if \(V(0)\lambda_{2}(D) < E^{2} / 4\), then the convergence time increases as increases; if \(V(0)\lambda_{2}(D) > E^{2} / 4\), then the convergence time decreases initially and then increases as Î± becomes large, and when \(\alpha= 1  2 / \ln ( 4V(0)\lambda_{2}(D) )\), the convergence time gets the minimum value. Generally, the value of \(V(0)\lambda_{2}(D)\) is always large, and to reduce the convergence time, we can set \(\alpha= 1  2 / \ln ( 4V(0)\lambda_{2}(D) )\).
Remark 6
Convergence time is defined as the amount of time the system consumes to reach a consensus. The precise convergence time of the studied nonlinear protocol is difficult to obtain. The above conclusions were obtained based on the upper bound of convergence time in equation (27).
4 Simulations
In this section, the simulations are conducted to verify the efficiency of the conclusions. Consider the multiagent system with \(n=4\) agents. The communication topology is shown in FigureÂ 1, and the communication weight is assumed to be 1. Through calculation we can obtain \(\lambda_{2}(L) = 2\) and \(\Vert L \Vert = 4\). We suppose that the initial state is \([2, 0, 2, 6]^{\mathrm{T}}\).
The trajectories of agents under protocol (6) when \(\alpha=0.3\) and \(\mu =0.2\) are shown in FigureÂ 2. We can see that the final consensus state is \(\sum_{i = 1}^{n} x_{i} (0) / 4 = 1.5\). Thus, protocol (6) can solve the finitetime average consensus problem. FigureÂ 3 shows the evolution of the error norm of agent 1 under protocol (6). The red solid line represents the evolution of \(\Vert e(t) \Vert \). It stays below the specified statedependent threshold \(\Vert e(t) \Vert _{\max} = ( \frac {\mu ( 4\lambda_{2} ( D ) )^{ ( 1 + \alpha ) / 2}}{2^{ ( 1  \alpha ) / 2}} )^{1 / \alpha} \Vert \delta (t) \Vert \), which is represented by the blue dotted line in the figure. FigureÂ 4 shows the evolution of the control input of agents under protocol (6). We can see that the control input is a piecewise constant value. Moreover, when the system error norm is small, the control input is small, and when the control input tends to zero, the system reaches equilibrium states.
When \(\mu=0.2\), the trajectories of agents under \(\alpha=0.6\) and \(\alpha=0.9\) are shown in FiguresÂ 5 and 6, respectively. Comparison with FigureÂ 2 and FiguresÂ 5 and 6 shows that if \(V(0)\lambda_{2}(D) > E^{2} / 4\) when \(\alpha= 1  2 / \ln ( 4V(0)\lambda_{2}(D) )\) (approximately 0.6 in this paper), the convergence time is shorter than that when \(\alpha=0.3\) and \(\alpha=0.9\).
Moreover, the relationship between the convergence time and parameter Î±, \(V(0)\) is simulated. The result is shown in FigureÂ 7. The relationship between the convergence time and Î± when \(V(0) = 17.5\) (the corresponding \(V(0)\) for \(x(0)\) in this paper) is shown in FigureÂ 8. The two figures show that if \(V(0)\lambda_{2}(D) > E^{2} / 4\), then the convergence time decreases initially, then increases as Î± becomes large, and when \(\alpha= 1  2 / \ln ( 4V(0)\lambda_{2}(D) )\), the convergence time gets the minimum value.
5 Conclusions
We presented a novel finitetime average consensus protocol based on eventtriggered control strategy for multiagent systems, which guarantees the system stability. The upper bound of convergence time was obtained. The relationship between convergence time and protocol parameter with initial state was analyzed. The following conclusions were obtained from simulations.

(1)
The proposed protocol can solve the finitetime average consensus problem.

(2)
The lower bound of the interevent time was obtained to guarantee that there is no Zeno behavior.

(3)
The larger the difference in the initial state, the longer the convergence time. Moreover, if \(V(0)\lambda_{2}(D) > E^{2} / 4\), then the convergence time decreases initially, then increases as Î± becomes large, and when \(\alpha= 1  2 / \ln ( 4V(0)\lambda_{2}(D) )\), the convergence time gets the minimum value.
In this paper, the authors only considered firstorder multiagent systems. Our future works will focus on extending the conclusions to secondorder or higherorder multiagent systems with switching topologies, measurement noise, time delays, and so on.
References
OlfatiSaber, R, Fax, JA, Murray, RM: Consensus and cooperation in networked multiagent systems. Proc. IEEE 95(1), 215233 (2007)
Davoodi, M, Meskin, N, Khorasani, K: Simultaneous fault detection and consensus control design for a network of multiagent systems. Automatica 66(5), 185194 (2016)
Li, H, Karray, F, Basir, O, Song, I: A framework for coordinated control of multiagent systems and its applications. IEEE Trans. Syst. Man Cybern., Part A, Syst. Hum. 38(3), 534548 (2008)
OlfatiSaber, R: Flocking for multiagent dynamic systems: algorithms and theory. IEEE Trans. Autom. Control 51(3), 401420 (2006)
Dong, W, Farrell, JA: Decentralized cooperative control of multiple nonholonomic dynamic systems with uncertainty. Automatica 45(3), 706710 (2009)
Fax, JA, Murray, RM: Information flow and cooperative control of vehicle formations. IEEE Trans. Autom. Control 49(9), 14651476 (2004)
Freeman, RA, Yang, P, Lynch, KM: Distributed estimation and control of swarm formation statistics. In: American Control Conference, pp.Â 749755 (2006)
OlfatiSaber, R: Swarms on sphere: a programmable swarm with synchronous behaviors like oscillator networks. In: 45th IEEE Conference on Decision and Control, pp.Â 50605066 (2006)
Dimarogonas, DV, Johansson, KH: Eventtriggered cooperative control. In: European Control Conference, pp.Â 30153020 (2009)
Heemels, WPMH, Johansson, KH, Tabuada, P: An introduction to eventtriggered and selftriggered control. In: IEEE 51st Annual Conference on Decision and Control, pp.Â 32703285 (2012)
Davoodi, M, Meskin, N, Khorasani, K: Eventtriggered multiobjective control and fault diagnosis: a unified framework. IEEE Trans. Ind. Inform. 13(1), 298311 (2017)
Dimarogonas, DV, Frazzoli, E, Johansson, KH: Distributed eventtriggered control for multiagent systems. IEEE Trans. Autom. Control 57(5), 12911297 (2012)
Davoodi, MR, Meskin, N, Khorasani, K: Eventtriggered fault detection, isolation and control design of linear systems. In: International Conference on EventBased Control, Communication, and Signal Processing, pp.Â 16 (2015)
Seyboth, GS, Dimarogonas, DV, Johansson, KH: Eventbased broadcasting for multiagent average consensus. Automatica 49(1), 245252 (2013)
Fan, Y, Feng, G, Wang, Y, Song, C: Technical communique: distributed eventtriggered control of multiagent systems with combinational measurements. Automatica 49(2), 671675 (2013)
Fan, Y, Liu, L, Feng, G, Wang, Y: Selftriggered consensus for multiagent systems with Zenofree triggers. IEEE Trans. Autom. Control 60(10), 27792784 (2015)
Wang, R, Xing, J, Wang, P, Yang, Q, Xiang, Z: Finitetime stabilization for discretetime switched stochastic linear systems under asynchronous switching. Trans. Inst. Meas. Control 36(5), 588599 (2014)
Huang, T, Li, C, Duan, S, Starzyk, J: Robust exponential stability of uncertain delayed neural networks with stochastic perturbation and impulse effects. IEEE Trans. Neural Netw. Learn. Syst. 23(6), 866875 (2012)
Wang, L, Xiao, F: Finitetime consensus problems for networks of dynamic agents. IEEE Trans. Autom. Control 55(4), 950955 (2010)
Zuo, Z, Lin, T: A new class of finitetime nonlinear consensus protocols for multiagent systems. Int. J. Control 87(2), 363370 (2014)
Feng, Y, Li, C, Huang, T: Periodically multiple statejumps impulsive control systems with impulse time windows. Neurocomputing 193, 713 (2016)
Wang, X, Li, J, Xing, J, Wang, R, Xie, L, Zhang, X: A novel finitetime average consensus protocol for multiagent systems with switching topology. Trans. Inst. Meas. Control (2016). doi:10.1177/0142331216663617
Zhu, Y, Guan, X, Luo, X, Li, S: Finitetime consensus of multiagent system via nonlinear eventtriggered control strategy. IET Control Theory Appl. 9(17), 25482552 (2015)
Godsil, C, Royle, GF: Algebraic Graph Theory. Springer, Berlin (2013)
Bhat, SP, Bernstein, DS: Finitetime stability of continuous autonomous systems. SIAM J. Control Optim. 38(3), 751766 (2000)
Lick, WJ: Difference Equations from Differential Equations. Springer, Berlin (1989)
Tabuada, P: Eventtriggered realtime scheduling of stabilizing control tasks. IEEE Trans. Autom. Control 52(9), 16801685 (2010)
Acknowledgements
This project was supported by the National Natural Science Foundation of China (Grant No.Â 61603414). We would like to express our appreciation to the anonymous referees and the Associate Editor for their valuable comments and suggestions.
Author information
Authors and Affiliations
Contributions
All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Additional information
Publisherâ€™s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Wang, X., Li, J., Xing, J. et al. A novel finitetime average consensus protocol based on eventtriggered nonlinear control strategy for multiagent systems. J Inequal Appl 2017, 258 (2017). https://doi.org/10.1186/s1366001715336
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1366001715336
Keywords
 multiagent system
 finitetime
 eventtriggered control
 consensus
 protocol