Complexity

Complexity / 2017 / Article

Research Article | Open Access

Volume 2017 |Article ID 2075603 | https://doi.org/10.1155/2017/2075603

Nanxiang Yu, Lianghao Ji, Fengmin Yu, "Heterogeneous and Competitive Multiagent Networks: Couple-Group Consensus with Communication or Input Time Delays", Complexity, vol. 2017, Article ID 2075603, 10 pages, 2017. https://doi.org/10.1155/2017/2075603

Heterogeneous and Competitive Multiagent Networks: Couple-Group Consensus with Communication or Input Time Delays

Academic Editor: Sigurdur F. Hafstein
Received14 Apr 2017
Revised03 Jul 2017
Accepted22 Nov 2017
Published13 Dec 2017

Abstract

This paper discusses the couple-group consensus problems for a class of heterogeneous multiagent networks including the following two cases: with communication and input time delays, respectively. Different from the related cooperative networks, two novel delayed group consensus protocols are designed based on the competitive relationship between the agents. Furthermore, we absolutely relax the in-degree balance and other restrictive preconditions which existed in the relevant works. Some sufficient algebraic criteria for the achievement of couple-group consensus and the upper bound of the input time delays are technically obtained via the frequency domain method and matrix theory, respectively. The results show that the achievement of the couple-group consensus depends on the second-order agents’ in-degree and the control parameters of the systems, whereas it is independent of the communication time delays. Meanwhile, the upper bound of the input time delay is determined by the control parameters and the in-degree of the first-order agents. Finally, the validity of the proposed results is verified by several simulated examples.

1. Introduction

Consensus is a typical problem of coordinate control of complex multiagent systems (MASs). It means that all the agents will be in agreement with each other as time goes on. Group (cluster) consensus is an extended issue of consensus problem. To MASs, the achievement of group consensus implies that consensus can be reached in each subgroup, respectively. In the last decades, consensus and group consensus problems have attracted the attention of the researchers in many fields due to their extensive applications. Such as in mobile robot systems [1, 2], smart grid [3], pinning control, and optimization of complex systems [49].

Up to now, much progress has been made in the study of consensus and group consensus issues. However, with the increasing demand for application, there are still many problems that need to be faced. Such as most of the related works focus on the homogeneous MASs. In fact, complex systems are often heterogeneous in the field of practical engineering. Namely, the dynamics of the agents are different, at least not identical. Hence, more and more attention should be paid on heterogeneous MASs. Recently, lots of interesting works about heterogeneous MASs have been reported. For example, in [10, 11], the authors discussed the synchronization of the heterogeneous systems and obtained some sufficient and/or necessary criteria which can guarantee the achievement of synchronization. In [12, 13], to the heterogeneous systems with undirected topology, the consensus and the globally bounded consensus problems were studied, respectively. In [1416], the authors discussed the synchronization and consensus issues for heterogeneous systems with the influence of time delays, respectively. Meanwhile, the consensus problems for the discrete-time heterogeneous systems were studied in [17, 18]. In [1921], group consensus problems for different kinds of heterogeneous systems have been investigated, such as the discrete-time complex systems, the systems modeled by second-order, and Euler-Lagrange networks. In [22, 23], the authors studied the group consensus for the cooperative and heterogeneous networks with and without input time delays, respectively. In [24], group synchronization for linear and nonlinear heterogeneous systems was discussed via Lyapunov theory. In [25], second-order heterogeneous MASs in cooperation-competition network with switching topology are investigated. Adaptive and pinning control scheme were proposed as well. In [26], the authors also discussed the reverse group consensus for cooperation-competition network.

Inspired by the relevant research works, this paper will discuss the group consensus issues for the heterogeneous MASs with time delays. The following two cases are included: with communication and input time delays. As known, time delays inevitably exist in the complex systems. Meanwhile, they usually affect and even destroy the stability of complex systems [1416]. Therefore, it is very important and necessary to discuss the group consensus problems with the influence of time delays. Our contributions are mainly listed as below: firstly, two novel delayed group consensus protocols are proposed, which is modeled by the agents’ competitive relationship. The innovation is mainly embodied in the following two aspects: on the one hand, the related works [1024] are based on the cooperative complex systems. On the other hand, there is a special case in the works [15, 2123]; that is, the dynamics of the first-order agents are added with a virtual velocity estimation in order to make theoretical analysis more convenient. As a fact of that, this situation is not quite true. Hence, we relax it in our protocol. Secondly, we also relax the following two preconditions in [15, 2024]: in-degree balance and the geometric multiplicity of zero eigenvalues of the Laplacian matrix associated with the adjacency matrix are at least two. They limit the topology of the system and the information interaction between the agents. As it does not rely on the restrict conditions, the case we discuss is more general. Lastly, by the matrix theory and frequency domain method, we theoretically propose some sufficient algebraic criteria for the achievement of couple-group consensus of the proposed complex systems. In general, our results should be more general.

The remaining parts of the paper are organised as follows. In Section 2, definition, lemma, and problem statements are listed firstly. In Section 3, we mainly discuss the couple-group consensus for the heterogeneous MASs with time delays. Subsequently, several simulated examples are illustrated to verify the correctness of our findings, and the conclusions are drawn finally in Section 5.

Notation. In the paper, let , denote the real and complex numbers sets. , its modulus and the real part are represented by and . denotes -dimensional identity matrix. , denote the th eigenvalue and the determinant of the matrix , respectively.

2. Problems Statement

Consider a heterogeneous MASs containing agents; we conveniently assume the first and remaining agents are second-order and first-order agents, and their dynamics are presented as follows:where , , . are control input, position, and velocity state of the agent , respectively.

In heterogeneous MASs, the neighbors of the agent may include second- and first-order agents, which can be described as and , respectively. Hence, its neighbor set . The adjacency matrix can be partitioned as , where , , represents the adjacency weights from the second-order agents to the first-order agents, and denotes the adjacency weights from the first-order agents to the second-order agents, respectively. The Laplacian matrix can also be rewritten as , where and denote the corresponding second-order and first-order agents’ Laplacian matrix, respectively. , . Therefore, when the topology of the system is a bipartite graph, the matrix associated with the system can be rewritten as

Next, the definition and lemma will be listed to further our analysis.

Definition 1. Couple-group consensus for the heterogeneous MASs (1) is said to be reached asymptotically, if and only if the following two conditions are satisfied for any initial states:

Lemma 2 (see [9]). Consider a complex networks with agents, if its topology is a bipartite digraph and contains a directed spanning tree; it has , when and . In particular, if the topology is an undirected bipartite graph, the nonzero eigenvalues of the matrix are positive real numbers.

3. Main Results

In this section, we will discuss the couple-group consensus for the heterogeneous multiagent systems with communication and input time delays, respectively.

First, we will discuss the case where with communication time delays.

As is known the relationship between the agents in complex systems includes cooperative relationship, competitive relationship, and both of them. In the related works [1024], the cooperative and competitive relationship between the agents and is described as and , respectively. In [25, 26], they also are presented by the coupling weight between these two agents. If , it is shown that the relationship between the agent and is cooperative. If , it means competition. Most of the works focused on the systems constructed by cooperative relationship between the agents and there are few reports about competitive networks. Hence, motivated by the related works and on the foundation of systems (1), a novel group protocol for a class of heterogeneous MASs based on the competition relationship between the agents is proposed as follows:where denotes the communication time delay between the agents and . are the control parameters of the systems.

Theorem 3. If , , and hold, the couple-group consensus for systems (3) with an undirected bipartite topology can be achieved asymptotically.

Proof. Taking the Laplace transforms to (3), it yields thatwhere , represent the Laplace transform of , , respectively.
Define then we havewhereDefine . It is known that the systems’ couple-group consensus will be achieved if the roots of either are at or have negative real parts by the stability theory.
When , . Based on Lemma 2, we know that the roots of are at if the topology of the systems is an undirected bipartite graph.
When , define , where . Then it follows thatSet , based on the general Nyquist criterion, it is known that if and only if the point is not enclosed by the Nyquist curve of , the roots of are located in the open left-half plane. Namely, the roots of have negative real parts. Hence, according to the Gershgorin Disk Theorem, we haveWhen , it yields thatDefine , ; since the point , is not enclosed in , , the following inequation (11) can be obtained:From (11), it follows thatAfter some manipulation, it yields thatAs , hence, we haveAs , the following inequations can be obtained:From (15), the condition can be obtained.
When , it yields thatDefine , ; if the point , is not enclosed in , , we haveIt is easy to know that inequation (17) can be satisfied for .
From what have been discussed above, that completes the proof of Theorem 3.

Corollary 4. For systems (3) with a directed bipartite topology which contains a directed spanning tree, if , , and hold, the couple-group consensus of the systems can be achieved asymptotically.

We omit the proof progress here due to the space limitation.

Remark 5. From the results in Theorem 3 and Corollary 4, we can find that the achievement of the couple-group consensus relies on the control parameters and the second-order agents’ in-degree. Meanwhile, communication time delays cannot affect the achievement of the group consensus.
Next, we will investigate the couple-group consensus problem for the heterogeneous MASs with input time delays.
Based on systems (3), a delayed protocol which based on the competitive relationship between the agents is designed as follows:where denotes the input time delays of the agent . are the control parameters of the systems. Note that we just discuss the special case.

Theorem 6. If and can be held, couple-group consensus for the heterogeneous MASs (18) with an undirected bipartite graph topology can be achieved asymptotically, where , , and , .

Proof. Taking the Laplace transforms to (18), it yields thatwhere , represent the Laplace transform of , , respectively.
As the proof progress is similar with that in Theorem 3, we omit it here due to the space limitation.

Corollary 7. If the conditions and are satisfied, couple-group consensus for the heterogeneous MASs (18) with a bipartite digraph topology which has a directed spanning tree can be achieved asymptotically, where , , and , .

Remark 8. From the proof progress of theorems and corollaries, it is found that we absolutely relax the following two restrictive assumptions which existed in [15, 2024]: in-degree balance and the geometric multiplicity of zero eigenvalues of the systems Laplacian matrix are at least two. It is known that in-degree balance means that there is no actual communication between the clusters. Meanwhile, the later condition also restricts the topology of the systems. As both of them are very restrictive conditions, our results will be more general.

Remark 9. From the results in Theorem 6 and Corollary 7, we know that the achievement of couple-group consensus relies on control parameters of the systems, in-degree of the second-order agents, and the input time delay. Meanwhile, the upper bound of the input time delay is determined by the control parameters and the in-degree of the first-order agents.

Remark 10. It is worth noting that there is a virtual velocity estimation in the dynamics of the first-order agents for the convenience of analysis in [15, 2123]. In fact, this situation is so ideal that it cannot meet the requirement in applications. In our models, we relax it. Therefore, the protocols we proposed are more practical. Meanwhile, the work will become more challenging when some preconditions are removed.

4. Simulation Results

In the section, we will illustrate the correctness of the obtained results by several simulated examples.

Suppose the heterogeneous systems with the undirected bipartite topology shown in Figure 1. For convenience, we also assume agents 1 and 5 are second-order and agents 2, 3, and 4 are first-order. In this situation, clusters and are heterogeneous as well.

Set , , , and , . From Figure 1, we have , , , , and .

Example 1. It is easy to verify that the conditions in Theorem 3 are satisfied. As the communication time delays cannot affect the achievement of the systems, in the example, we suppose the communication time delays between the agents are equal. Meanwhile, in order to describe the effect of the communication time delay on systems’ convergence rate, we mainly consider the following three cases: (1) ; (2) ; (3) . The trajectories of the agents in systems (3) are shown in Figure 2, respectively. The results show that the systems’ couple-group consensus is reached, respectively. Moreover, we can find that the systems’ convergence rate will be improved with the decrease of communication delay.

Example 2. From Theorem 6, we know . Hence, in the simulation, we choose and , respectively. It is known that all the conditions in Theorem 6 can be satisfied. The trajectories of the agents in systems (18) are shown in Figure 3, respectively. The results show that the systems’ couple-group consensus is reached, respectively. Furthermore, with the increase of input time delay, the convergence rate of the systems will decrease accordingly.

Example 3. Consider systems (3) with the topology shown in Figure 4. It is a bipartite digraph and contains a directed spanning tree. In this example, all the parameters are set as those in Example 1. It is easy to verify that the conditions in Corollary 4 are satisfied as well. The trajectories of the agents in systems (3) with different communication time delays are shown in Figure 5, respectively. From the results illustrated in Figure 5, we can find the couple-group consensus can be reached asymptotically, respectively.

Example 4. Based on Example 2, we suppose systems (18) with the topology shown in Figure 4 and set and , respectively. It is known that all the conditions in Corollary 7 can be satisfied. The trajectories of the agents in systems (18) are shown in Figure 6, respectively. The results show that the systems’ couple-group consensus is reached, respectively.

Example 5. In this example, we will discuss the other case where systems (18) with the topology are shown in Figure 7. It is shown that the second-order agents and belong to cluster . Similarly, cluster contains the first-order agents , and . Namely, the whole system is heterogeneous, but its two clusters are homogeneous. Based on Examples 2 and 4, we also set and , respectively. Meanwhile, the other parameters coincide with those in Example 2. It is not difficult to find that the conditions in Corollary 7 are satisfied. The trajectories of the agents in systems (18) are illustrated in Figures 8 and 9, respectively. From the results, they show that the couple-group consensus of the systems can be achieved asymptotically.

Remark 11. We assume each subgroup is heterogeneous in Examples 14. Note that our results also apply to the case where the clusters are homogeneous. At this point, the position and velocity states of the agents will achieve group consensus in the cluster containing second-order agents. The results in Example 5 can be explained here.

5. Conclusions

In this paper, we investigate the couple-group consensus problems for the heterogeneous MASs with communication and input time delays, respectively. Based on the competitive relationship between the agents, two novel delayed group consensus protocols are designed. Specifically, some sufficient algebraic criteria are obtained by the matrix theory and frequency domain method in the case of relaxing the restrictive preconditions existing in the related works. From the results, we find that the achievement of the couple-group consensus depends on the second-order agents in-degree and the control parameters of the systems, whereas it is independent of the communication time delays. Meanwhile, the upper bound of the input time delay is determined by the control parameters of the systems and the in-degree of the first-order agents. With the increase of the in-degree of the first-order agents, the tolerance of the systems to the input time delay will be reduced. It reveals that we should improve the data processing capability of the key agents. Furthermore, through the simulated examples, it is found that the smaller the time delays are including input and communication time delays, the faster the systems will converge. In the future, we will further our work to the cases with multiple time delays, switching topology, and so on.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China under Grants 61472464, 61572091, 61503308, and 61673080, in part by the Natural Science Foundation Project of Chongqing Science and Technology Commission under Grants nos. cstc2014jcyjA40047 and cstc2015jcyjA40043, and in part by the Scientific and Technological Research Program of Chongqing Municipal Education Commission under Grant KJ1400429 and awarded in part by State Scholarship Fund of China Scholarship Council.

References

  1. W. Qiao and R. Sipahi, “Consensus control under communication delay in a three-robot system: design and experiments,” IEEE Transactions on Control Systems Technology, vol. 24, no. 2, pp. 687–694, 2016. View at: Publisher Site | Google Scholar
  2. L. Jin and S. Li, “Distributed Task Allocation of Multiple Robots: A Control Perspective,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, pp. 1–9. View at: Publisher Site | Google Scholar
  3. C. Li, X. Yu, W. Yu, T. Huang, and Z.-W. Liu, “Distributed event-triggered scheme for economic dispatch in smart grids,” IEEE Transactions on Industrial Informatics, vol. 12, no. 5, pp. 1775–1785, 2016. View at: Publisher Site | Google Scholar
  4. G. Wen, Y. Zhao, Z. Duan, W. Yu, and G. Chen, “Containment of higher-order multi-leader multi-agent systems: a dynamic output approach,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 61, no. 4, pp. 1135–1140, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  5. L. Ji, Q. Liu, and X. Liao, “On reaching group consensus for linearly coupled multi-agent networks,” Information Sciences, vol. 287, pp. 1–12, 2014. View at: Publisher Site | Google Scholar | MathSciNet
  6. X. Liao and L. Ji, “On pinning group consensus for dynamical multi-agent networks with general connected topology,” Neurocomputing, vol. 135, no. 5, pp. 262–267, 2014. View at: Publisher Site | Google Scholar
  7. L. Ji, Y. Tang, Q. Liu, and X. Liao, “On adaptive pinning consensus for dynamic multi-agent networks with general connected topology,” in Proceedings of the 2016 International Joint Conference on Neural Networks, IJCNN 2016, pp. 5281–5287, Canada, July 2016. View at: Publisher Site | Google Scholar
  8. L. Ji, Y. Tang, and Q. Liu, “On hybrid adaptive and pinning consensus for multiagent networks,” Mathematical Problems in Engineering, vol. 2016, Article ID 9127356, 11 pages, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  9. Q. Wang and Y. Wang, “Cluster synchronization of a class of multi-agent systems with a bipartite graph topology,” Science China Information Sciences, vol. 57, no. 1, pp. 1–11, 2014. View at: Publisher Site | Google Scholar
  10. J. Lunze, “Synchronization of heterogeneous agents,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 57, no. 11, pp. 2885–2890, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  11. L. Wang, M. Z. Q. Chen, and Q.-G. Wang, “Bounded synchronization of a heterogeneous complex switched network,” Automatica, vol. 56, pp. 19–24, 2015. View at: Publisher Site | Google Scholar
  12. D. Goldin and J. Raisch, “Consensus for agents with double integrator dynamics in heterogeneous networks,” Asian Journal of Control, vol. 16, no. 1, pp. 30–39, 2014. View at: Publisher Site | Google Scholar | MathSciNet
  13. L. Wang, W.-J. Feng, M. Z. Chen, and Q.-G. Wang, “Global bounded consensus in heterogeneous multi-agent systems with directed communication graph,” IET Control Theory & Applications, vol. 9, no. 1, pp. 147–152, 2015. View at: Publisher Site | Google Scholar | MathSciNet
  14. B. Cui, T. Ma, F. L. Lewis, C. Zhao, Y. Song, and C. Feng, “Distributed adaptive consensus control of heterogeneous multi-agent chaotic systems with unknown time delays,” IET Control Theory & Applications, vol. 9, no. 16, pp. 2414–2422, 2015. View at: Publisher Site | Google Scholar | MathSciNet
  15. C.-L. Liu and F. Liu, “Dynamical consensus seeking of heterogeneous multi-agent systems under input delays,” International Journal of Communication Systems, vol. 26, no. 10, pp. 1243–1258, 2013. View at: Publisher Site | Google Scholar
  16. Y.-J. Sun, G.-L. Zhang, and J. Zeng, “Consensus analysis for a class of heterogeneous multiagent systems with time delay based on frequency domain method,” Mathematical Problems in Engineering, vol. 2014, Article ID 248684, 2014. View at: Publisher Site | Google Scholar
  17. J. M. Kim, J. B. Park, and Y. H. Choi, “Leaderless and leader-following consensus for heterogeneous multi-agent systems with random link failures,” IET Control Theory & Applications, vol. 8, no. 1, pp. 51–60, 2014. View at: Publisher Site | Google Scholar | MathSciNet
  18. S. Li, G. Feng, X. Luo, and X. Guan, “Output consensus of heterogeneous linear discrete-time multiagent systems with structural uncertainties,” IEEE Transactions on Cybernetics, vol. 45, no. 12, pp. 2868–2879, 2015. View at: Publisher Site | Google Scholar
  19. H.-X. Hu, W. Yu, Q. Xuan, C.-G. Zhang, and G. Xie, “Group consensus for heterogeneous multi-agent systems with parametric uncertainties,” Neurocomputing, vol. 142, pp. 383–392, 2014. View at: Publisher Site | Google Scholar
  20. Y. Zheng and L. Wang, “A novel group consensus protocol for heterogeneous multi-agent systems,” International Journal of Control, vol. 88, no. 11, pp. 2347–2353, 2015. View at: Publisher Site | Google Scholar | MathSciNet
  21. C. Liu, Q. Zhou, and X. Hu, “Group consensus of heterogeneous multi-agent systems with fixed topologies,” International Journal of Intelligent Computing and Cybernetics, vol. 8, no. 4, pp. 294–311, 2015. View at: Publisher Site | Google Scholar
  22. G. Wen, J. Huang, C. Wang, Z. Chen, and Z. Peng, “Group consensus control for heterogeneous multi-agent systems with fixed and switching topologies,” International Journal of Control, vol. 89, no. 2, pp. 259–269, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  23. G. Wen, Y. Yu, Z. Peng, and H. Wang, “Dynamical group consensus of heterogenous multi-agent systems with input time delays,” Neurocomputing, vol. 175, pp. 278–286, 2015. View at: Publisher Site | Google Scholar
  24. J. Qin, Q. Ma, H. Gao, Y. Shi, and Y. Kang, “On group synchronization for interacting clusters of heterogeneous systems,” IEEE Transactions on Cybernetics, vol. 47, no. 12, 2016. View at: Publisher Site | Google Scholar
  25. H.-X. Hu, Q. Xuan, W. Yu, C.-G. Zhang, and G. Xie, “Second-order consensus for heterogeneous multi-agent systems in the cooperation--competition network: a hybrid adaptive and pinning control approach,” Nonlinear Analysis: Hybrid Systems, vol. 20, pp. 21–36, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  26. H.-X. Hu, W. Yu, G. Wen, Q. Xuan, and J. Cao, “Reverse group consensus of multi-agent systems in the cooperation-competition network,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 63, no. 11, pp. 2036–2047, 2016. View at: Publisher Site | Google Scholar

Copyright © 2017 Nanxiang Yu 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.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views485
Downloads315
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.