Research Article | Open Access
Zhiyong Ye, Yungen Chen, Hua Zhang, "Leader-Following Consensus of Multiagent Systems with Time-Varying Delays via Impulsive Control", Mathematical Problems in Engineering, vol. 2014, Article ID 240503, 10 pages, 2014. https://doi.org/10.1155/2014/240503
Leader-Following Consensus of Multiagent Systems with Time-Varying Delays via Impulsive Control
The leader-following consensus problem for delayed multiagent systems is investigated over stochastic switching topologies via impulsive control method. A distributed consensus protocol is proposed based on sample data information. The convergence analysis for such algorithm over undirected and directed networks is provided, and some sufficient conditions to guarantee the consensus are also established. It is shown that delayed networks can achieve consensus even information is exchanged among followers just at some discrete moments. At last, some numerical examples are given to illustrate the effectiveness of the proposed protocols.
Recently, there has been an increasing attention in the consensus problems of multiagent systems because of their wide applications in many fields such as flocking [1, 2], mobile sensor networks , cooperative control , and formation control . Both discrete-time consensus model [1, 6–8] and continuous-time consensus model [9–14] are studied. For example, Vicsek et al. first proposed a discrete-time model for multiagent systems . Then, Jadbabaie et al.  and Savkin  successfully gave explanations of Vicsek’s model, respectively. Based on algebraic graph theory, Olfati-Saber and Murray showed that the average-consensus problems can be solved if the directed network topology is strongly connected and balanced . Further, Ren and Beard extended  and proved that consensus can be achieved if and only if the network topology has a spanning tree .
As we know, in the real world, especially in neural processing and signal transmission, time delay has to be taken into consideration . Because time delay may cause unexpected dynamical behaviors such as oscillation and instability . In , Olfati-Saber and Murray considered consensus with fixed communication delay and derived the bound of delay as well as a necessary and sufficient condition to guarantee the consensus. In [12, 13], Lee and Spong and Lu et al. considered consensus problem with nonuniform time-delays, respectively, and proved that the first-order multiagent system can realize consensus asymptotically for any fixed and finite time delays. In , Liu et al. defined a new concept of consensus in order to investigate consensus of multiagent systems with unbounded time-varying delays.
It should be noticed that in practical life, some biological and physical systems are characterized by abrupt changes of states at some time instants . These phenomena are usually regarded as impulsive effects of communication links among agents . Impulsive effects exist due to unreliable communication links . Inspired by the impulsive phenomena, some effective impulsive methods are applied into different models [17, 19–24]. In , impulsive effect is studied for fuzzy delayed systems through the Takagi-Sugeno model and some criteria for stability are derived by virtue of the Razumikhin technique. Li et al. investigated synchronization of coupled delayed neural networks via impulsive control . Recently, Zhang and Jiang addressed synchronization problem for nonlinear discrete chaotic systems with impulsive effects . Zhou et al. studied impulsive synchronization of coupled harmonic oscillators over fixed and switching topology, respectively . Wu et al. proposed an average consensus protocol to study a delayed multiagent system with control inputs missing . Guan et al. investigated impulsive consensus seeking in directed network topology . It should be noticed that impulsive control has some advantages compared with continuous control. For example, it is flexible, energy-saving, and cost-saving. What is more, it has been proved that the impulsive control approach is effective and robust .
To the best of our knowledge, the leader-following consensus problem is becoming more and more popular recently [25–32]. The leader’s motion is independent, whereas the followers’ motion is influenced by the leader and its neighbors. Therefore, in order to stabilize a multiagent system, we can control the leader (some leaders) instead of all the agents in a system. This helps to save energy and reduce control cost . Moreover, it is shown that the leader-following configuration can also enhance the communication and orientation of the flock . In , Hong et al. gave a scheme to track a leader by studying a consensus problem over undirected networks with switching topology. Hu and Hong derived some conditions to guarantee leader-following consensus for delayed multiagent system over fixed and switching topologies, respectively . Song et al. proposed a pinning control protocol for nonlinear multiagent systems with double integrator and addressed what kind of agents and how many agents should be pinned . Recently, quasi-consensus of second-order multiagent systems with a leader was studied by Wang and Cao . A finite-time consensus protocol for multiagent networks was discussed by Yang et al. from a new perspective . -matrix strategies are designed by Song et al. to pin a second-order nonlinear multiagent system .
Motivated by the aforementioned works, we study leader-following consensus of delayed multiagent systems via impulsive control and propose a protocol based on sampled data information. Compared with pure discrete-time or pure continuous-time model, this problem is more complicated. The analysis becomes difficult if the time delay is time-varying and the topology is switching. We analyse this problem by virtue of algebraic graph theory, the Lyapunov control approach, and generalized Halanay inequality. The contribution of this paper is threefold. First, we propose a more practical protocol by considering communication delay, impulsive effect, and leader-following configuration. Second, without assuming that the interaction graph is strongly connected (connected) or balanced, or has a directed spanning tree, we study this problem over general network topologies. Third, we generalize the works of [9, 10] and show advantages such as time-saving and cost-saving via simulation compared with the works of [9, 10, 22, 23].
The paper is organized as follows. Section 2 presents some preliminaries. The leader-following consensus protocol via impulsive control is analyzed in Section 3. Some simulation results are provided in Section 4. Finally, conclusions are given in Section 5.
2.1. Notations and Definition
Throughout this paper, some mathematical notations and definitions are used here. Let and represent real numbers and positive natural numbers, respectively. and stand for real vector space and real matrix space, respectively. Let be identity (zero) matrix and . Let and stand for the transpose and the symmetric part of . denotes the maximum eigenvalues of matrix with the spectra norm . The symbol denotes the Kronecker product.
Let the function form the linear space with the norm . The function has the following property: is continuous everywhere except a finite number of points , where and exist and . Let , , and we denote , . For a function , , is called Dini derivative. Matrix dimensions are assumed to be compatible for algebraic operations.
2.2. Graph Theory
We use a graph to describe the information exchange among agents in a multiagent system. Let be a weighted directed network of order , with the set of nodes , the set of directed edges , and a weighted adjacency matrix with nonnegative adjacency elements . The element of is defined as if ; otherwise, for all , which means that if node can receive information from node , then , and we suppose that for all . If ; that is, is a symmetric matrix, we call the corresponding graph of as undirected graph. Note that the undirected graphs are special cases of directed graph.
A path from node to in directed (undirected) graph is a sequence of edges with distinct nodes . If there is a path between any pair of distinct nodes of a graph, we call this graph strongly connected. In a directed graph, we say the graph has a directed spanning tree if there exists at least one node called root which has a directed path to all the other nodes . Moreover, if a graph has such root labeled 0, we say that the node 0 is globally reachable in . This condition is much weaker than strong connectedness . The neighbor set of node is defined by . The Laplacian matrix of weighted graph is defined by , where and , . In this paper, we suppose that all the interconnection graphs have a globally reachable node 0.
2.3. Model Description
For example, Olfati-Saber and Murray studied this protocol over undirected networks with constant time delay and fixed topology and suggested that the network topology and the designed protocol are very important to the performance and the communication cost . In this paper, we consider a group of agents, including one leader and identical followers (or agents if no confusion arises) and propose the following impulsive leader-following consensus protocol: where is a switching signal that determines the network topology at . We define two graphs: a graph that is formed only by followers and a graph that is formed by a leader and followers. Let denote the set of all possible interconnection graphs with a common node set . Then the communication topology is a subset of . Denote the set with a common node set . Obviously is a part of (). The time sequence satisfies , . Let be the value of the th agent, which may represent physical quantities such as position, temperature, and voltage . is the Dirac impulsive function, which indicates that the states of (2) have jumps at . We suppose that is a continuously differentiable function satisfying , , , where and are the weighting factors and , . is the element of adjacency matrix , where is the adjacency matrix of communication topology at time . if agent is connected to the leader at time interval ; otherwise, .
The dynamics of the leader are described as follows: where is the value of the leader. Obviously, the motion of the leader is independent of followers.
Without loss of generality, we suppose that , and thus using the properties of Dirac impulsive function, the system (2) can be rewritten as where , represents the Laplacian matrix of graph , and is defined by
Let ; thus, we can rewrite system (4) as
Remark 1. Recently, many works studied consensus problem, and most of the network topologies are assumed to be connected (strong connected) or have a spanning tree [9, 10, 22, 23]. In this paper, we focus on the leader-following consensus of delayed multiagent systems with impulsive effects over a general network topology. For example, for a group of migratory birds, neither all the birds can receive information from the leader, nor can the birds communicate information all the time . We suppose that only a few birds can obtain the leader’s information. Each bird only communicates with its neighbors at a series of discrete time with time delay and updates its states in a manner of impulse jumps. So system (4) can be regarded as hybrid system.
3. Convergence Analysis
In this section, we will give convergence analysis of this problem over undirected and directed networks, respectively. From the system (2), we know that information is exchanged among followers only at some discrete moments. So in the time interval , we suppose that the frequency of information exchange among followers is , and the states of the system (2) have jumps at .
3.1. Undirected Networks over Switching Topology
Theorem 2. Suppose that every communication topology in has a globally reachable node 0. If there exists a constant , such that for all , the following condition is satisfied: where And represents the minimal positive eigenvalue of . , , , and and are the natural constant and the maximum of the time delays, respectively. and () represent the th eigenvalues of and , respectively. Then the system (2) achieves consensus globally exponentially.
Proof. Since the Laplacian matrix of undirected networks is positive semidefinite , there exists a real orthogonal matrix , so that , where , and () represents the th eigenvalues of . Let , then
where and () represent the th eigenvalues of and , respectively.
Construct a Lyapunov function , if , ; then Let , , . From (10), we have Then, we have So we can obtain Then, we can get
Since is positive semidefined, let the minimal positive eigenvalue of be ; then the eigenvalues of can be ordered as .
So for , from (10), we can obtain
For , let , and let be the maximum of the time delays; then from (15) and using the inequality , , we can obtain that where .
Combine with (16) and (17); from the above proof, we can obtain where , are defined in Theorem 2; then according to Lemma 1 in , the system (2) achieves consensus globally exponentially. That completes the proof of Theorem 2.
3.2. Directed Networks over Switching Topology
Theorem 3. Suppose that node 0 is globally reachable in every communication topology of . If there exists a constant , such that for all , the following condition is satisfied: where , is a constant and , , , and and represent the minimal positive eigenvalue of and , respectively. Then the system (2) achieves consensus globally exponentially.
Proof. Suppose that in the time interval , the frequency of information exchange is ; then
Thus, we have
Now we rewrite the system (6) as
Define the Lyapunov function as , if , ,
Since and are positive semidefined, denote the minimal positive eigenvalues of and as and , respectively. Then, , .
If , it then follows from (23) and using the inequality that we can obtain Then from the above proof, we can obtain where , are defined in Theorem 3; then according to Lemma 1 in , consensus of the system (2) is achieved globally exponentially. That completes the proof of Theorem 3.
Remark 4. The result of Theorem 2 (Theorem 3) indicates that the topology structure is an important factor in achieving consensus. The communication delay and the interval of information exchanging also affect the consensus of the system (2). Therefore, for a delayed dynamical network to achieve consensus, we need to adjust the topology structure, the time delay, and the interval of information exchanging so that the condition of Theorem 2 (Theorem 3) is satisfied. In the next section, we will explain this point through numerical simulations.
Remark 5. In this paper, only sufficient condition is derived; that is, the system (2) can achieve consensus although the condition (7) or condition (19) may fail. Theorem 2 is only used for undirected network topology, where both undirected and directed network topology can be dealt with by Theorem 3, yet we will show that Theorem 2 is more suitable than Theorem 3 to handle the undirected graphs in the next section.
Remark 6. In , Olfati-Saber and Murray defined the communication or sensing cost of the topology . In this paper, we give a similar definition of the average communication cost of switching topology in a multiagent system as follows : where is an element of weighted adjacency matrix of a network topology at and denotes the total number of all interconnection graphs. Here we only give some discussions about cost through simulations and take the directed network with switching topology, for example, in the next section. We will show some advantages such as time-saving and energy-saving of our proposed algorithm.
Remark 7. Wu et al.  and Guan et al.  investigated impulsive consensus problems without a leader for multiagent systems. As we know, in some cases, the coupled network is required to reach some prescribed consensus value, for example, . Unlike [22, 23], we can drive the system to achieve the required consensus value by controlling a leader. Moreover, our model shows a faster convergence and lesser cost than the models of Wu and Guan via simulation in the next section.
In this section, we provide simulations to illustrate the effectiveness and advantages of the proposed algorithms. Obviously, from Figure 1, we can see that graphs Figures 1(a)–1(d) formed by followers do not have a spanning tree. But for all network communication topologies studied by our model, node 0 is globally reachable. We suppose that the leader’s position described by (3) is .
4.1. Undirected Networks over Switching Topology
In this simulation, the interaction topology switches randomly every 0.1 s among as shown in Figure 1. We suppose that , with the maximum time delay . And we stochastically choose initial values in . Choosing the parameters , , , to satisfy condition (7) of Theorem 2, Figure 2(a) indicates that the system (2) achieves consensus globally exponentially. By Theorem 3, use the same parameters , , but there does not exist to satisfy condition (19). Then we need to make the maximum time-delay smaller, for example, , to satisfy condition (19). So we say that Theorem 2 is more suitable for undirected networks, as discussed in Remark 5. Figure 2(b) implies that the condition of Theorem 2 is a sufficient condition but not necessary (the parameters , dissatisfy the condition (7)).
4.2. Directed Networks over Switching Topology
In this simulation, the interaction topology switches randomly every 0.1 s among as shown in Figure 1. We suppose that , , with the maximum time delay . And we stochastically choose initial values in . It is easy to see that the condition (19) of Theorem 3 is satisfied if , , , . Figure 3(a) shows that the system (2) achieves consensus globally exponentially. Figure 3(b) illustrates that we only derive a sufficient condition, as discussed in Remark 5 (the parameters , dissatisfied (19) of Theorem 3).
4.3. Performance and Cost of Our Model via Simulation
In this section, we address advantages of our model via simulation as discussed in Remarks 6 and 7. Suppose that the system achieves consensus at exactly three seconds according to (27); then system (2) have the communication cost , where the system (1) studied by [9, 10] requires more cost () to achieve consensus as shown in Figure 3(c). Then we say our proposed protocol is energy-saving and cost-saving as discussed in Remark 6. Figure 3(d) suggests that the system (1) needs more time ( s) to achieve consensus if the parameters chosen are the same (, ) as those in Figure 3(a). So we say our proposed protocol is time-saving as discussed in Remark 6. Compared with [22, 23], we introduce a leader in a delayed multiagent system, and we can drive the system to any desired consensus value by controlling a leader. Figures 3(e) and 3(f) show that the model studied by works of [22, 23] needs more time ( s when parameters chosen are the same as Figure 3(a)) and more cost ( according to (27)) than system (2).
In this paper, we study leader-following consensus problem of delayed multiagent systems with impulsive effects over a general network topology and propose a protocol based on sample data information. Some sufficient conditions are obtained to guarantee that the followers converge to the leader globally exponentially. We show that under this impulsive protocol, the delayed networks can achieve consensus even the followers exchange information with each other only at some discrete moments. Some simulations are given to verify the effectiveness of the theoretical results. The time-saving and energy-saving of the protocol are also shown via simulations.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper. This paper is new. Neither the entire paper nor any part of its content has been published or has been accepted elsewhere. It is not being submitted to any other journal. All authors have seen the manuscript and approved to submit to your journal.
The authors are grateful to the Associate Editor and the anonymous reviewers for their valuable comments and suggestions that helped improve the presentation of the paper. This work was partially supported by the National Science Foundation of China (Grant no. 61364003) and the Science and Technology Foundation of Guizhou Province (no. 20122316).
- C. W. Reynolds, “Flocks, herds, and schools: a distributed behavior model,” Computer Graphics, vol. 21, no. 4, pp. 25–34, 1987.
- R. Olfati-Saber, “Flocking for multi-agent dynamic systems: algorithms and theory,” IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401–420, 2006.
- D. P. Spanos and R. M. Murray, “Distributed sensor fusion using dynamic consensus,” in Proceedings of the 16th IFAC World Congress, Venue, Czech Republic, 2005, We-E04-TP/3.
- P. K. C. Wang and F. Y. Hadaegh, “Coordination and control of multiple microspacecraft moving in formation,” Journal of the Astronautical Sciences, vol. 44, no. 3, pp. 315–355, 1996.
- T. Balch and R. C. Arkin, “Behavior-based formation control for multirobot teams,” IEEE Transactions on Robotics and Automation, vol. 14, no. 6, pp. 926–939, 1998.
- T. Vicsek, A. Czirk, E. Ben-Jacob, I. Cohen, and O. Shochet, “Novel type of phase transition in a system of self-driven particles,” Physical Review Letters, vol. 75, no. 6, pp. 1226–1229, 1995.
- A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” IEEE Transactions on Automatic Control, vol. 48, no. 6, pp. 988–1001, 2003.
- A. V. Savkin, “Coordinated collective motion of groups of autonomous mobile robots: analysis of Vicsek's model,” IEEE Transactions on Automatic Control, vol. 49, no. 6, pp. 981–983, 2004.
- R. Olfati-Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1520–1533, 2004.
- W. Ren and R. W. Beard, “Consensus seeking in multiagent systems under dynamically changing interaction topologies,” IEEE Transactions on Automatic Control, vol. 50, no. 5, pp. 655–661, 2005.
- C.-Y. Kao and A. Rantzer, “Stability analysis of systems with uncertain time-varying delays,” Automatica, vol. 43, no. 6, pp. 959–970, 2007.
- D. J. Lee and M. W. Spong, “Agreement with non-uniform information delays,” in Proceedings of the American Control Conference, pp. 756–761, Minneapolis, Minn, USA, June 2006.
- J. Q. Lu, D. W. C. Ho, and J. Kurths, “Consensus over directed static networks with arbitrary finite communication delays,” Physical Review E, vol. 80, no. 6, Article ID 066121, 2009.
- X. Liu, W. Lu, and T. Chen, “Consensus of multi-agent systems with unbounded time-varying delays,” IEEE Transactions on Automatic Control, vol. 55, no. 10, pp. 2396–2401, 2010.
- K. Li, “Impulsive effect on global exponential stability of BAM fuzzy cellular neural networks with time-varying delays,” International Journal of Systems Science, vol. 41, no. 2, pp. 131–142, 2010.
- T. Yang and L. O. Chua, “Impulsive stabilization for control and synchronization of chaotic systems: theory and application to secure communication,” IEEE Transactions on Circuits and Systems I, vol. 44, no. 10, pp. 976–988, 1997.
- J. Zhou, H. Zhang, L. Xiang, and Q. Wu, “Synchronization of coupled harmonic oscillators with local instantaneous interaction,” Automatica, vol. 48, no. 8, pp. 1715–1721, 2012.
- O. C. Imer, S. Yüksel, and T. Başar, “Optimal control of LTI systems over unreliable communication links,” Automatica, vol. 42, no. 9, pp. 1429–1439, 2006.
- D. W. C. Ho and J. Sun, “Stability of takagi-sugeno fuzzy delay systems with impulse,” IEEE Transactions on Fuzzy Systems, vol. 15, no. 5, pp. 784–790, 2007.
- P. Li, J. Cao, and Z. Wang, “Robust impulsive synchronization of coupled delayed neural networks with uncertainties,” Physica A, vol. 373, pp. 261–272, 2007.
- L. Zhang and H. Jiang, “Impulsive generalized synchronization for a class of nonlinear discrete chaotic systems,” Communications in Nonlinear Science and Numerical Simulation, vol. 16, no. 4, pp. 2027–2032, 2011.
- Q. Wu, J. Zhou, H. Zhang, and X. Lan, “Distributed -consensus in directed delayed networks of multi-agent systems,” International Journal of Systems Science, vol. 44, no. 5, pp. 916–925, 2013.
- Z.-H. Guan, Y. Wu, and G. Feng, “Consensus analysis based on impulsive systems in multiagent networks,” IEEE Transactions on Circuits and Systems I, vol. 59, no. 1, pp. 170–178, 2012.
- H. Zhang and J. Zhou, “Distributed impulsive consensus for second-order multi-agent systems with input delays,” IET Control Theory & Applications, vol. 7, no. 16, pp. 1978–1983, 2013.
- D. Hummel, “Formation flight as an energy-saving mechanism,” Israel Journal of Zoology, vol. 41, no. 3, pp. 261–278, 1995.
- M. Andersson and J. Wallander, “Kin selection and reciprocity in flight formation?” Behavioral Ecology, vol. 15, no. 1, pp. 158–162, 2004.
- Y. Hong, J. Hu, and L. Gao, “Tracking control for multi-agent consensus with an active leader and variable topology,” Automatica, vol. 42, no. 7, pp. 1177–1182, 2006.
- J. Hu and Y. Hong, “Leader-following coordination of multi-agent systems with coupling time delays,” Physica A, vol. 374, no. 2, pp. 853–863, 2007.
- Q. Song, J. Cao, and W. Yu, “Second-order leader-following consensus of nonlinear multi-agent systems via pinning control,” Systems and Control Letters, vol. 59, no. 9, pp. 553–562, 2010.
- Z. Wang and J. Cao, “Quasi-consensus of second-order leader-following multi-agent systems,” IET Control Theory and Applications, vol. 6, no. 4, pp. 545–551, 2012.
- S. Yang, J. Cao, and J. Lu, “A new protocol for finite-time consensus of detail-balanced multiagent networks,” Chaos, vol. 22, no. 4, Article ID 043134, 2012.
- Q. Song, F. Liu, J. Cao, and W. Yu, “M-matrix strategies for pinning-controlled leader- following consensus in multiagent systems with nonlinear dynamics,” IEEE Transactions on Cybernetics, vol. 43, no. 6, pp. 1688–1697, 2013.
- Q. Wu, J. Zhou, X. Lan, and S. Cheng, “Impulsive control and synchronization for a class of chaotic delayed systems,” in Proceedings of the 29th Chinese Control Conference (CCC '10), pp. 514–519, Beijing, China, July 2010.
- W. Yu, G. Chen, M. Cao, and J. Kurths, “Second-Order consensus for multiagent systems with directed topologies and nonlinear dynamics,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 40, no. 3, pp. 881–891, 2010.
- Q. Zhang, S. Chen, and C. Yu, “Impulsive consensus problem of second-order multi-agent systems with switching topologies,” Communications in Nonlinear Science and Numerical Simulation, vol. 17, no. 1, pp. 9–16, 2012.
- W. Ren and Y. Cao, Distributed Coordination of Multi-Agent Networks: Emergent Problems, Models, and Issues, Springer, London, UK, 2011.
Copyright © 2014 Zhiyong Ye et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.