Abstract

In this paper, a novel cluster consensus problem related with the bipartition of the graph of multi-agent systems (MASs) is studied. To track the virtual leaders and reach the expected consensus, a new type of pinning consensus protocol with aperiodic intermittent effects is designed according to the graph structure, and a new kind of aperiodic intermittent communication is defined. Moreover, the protocol is applied to construct networked systems with intermittent communications. Lyapunov functional is applied to get sufficient conditions for solving the multi-tracking problem under a dual subsystem framework. Finally, some numerical simulations are given to illustrate the effectiveness of the theoretical results.

Highlights

  • Consensus problem is a class of distributed coordinative control problem of multi-agent systems (MASs)

  • As one of important interdisciplinary topics in coordination problems, consensus problem has attracted many researchers due to the fact that it has been widely applied in the cooperative control of unmanned aerial vehicles, mobile sensor networks, satellite clusters, etc

  • In [22], the distributed node-to-node consensus problem is addressed, and it is assumed that the network structure of multi-agent systems consist of two layers

Read more

Summary

Introduction

Consensus problem is a class of distributed coordinative control problem of multi-agent systems (MASs). The consensus of multi-agent systems have been studied in various aspects, Such as consensus problems with time delays [14], consensus with second order [13, 21], consensus via pinning strategy [1]. In [13], the paper addresses the group consensus problem of second-order multi-agent systems through leader-following approach and pinning control. In [22], the distributed node-to-node consensus problem is addressed, and it is assumed that the network structure of multi-agent systems consist of two layers. It is interesting to noticed that if the clustered structures are appropriately involved in the bipartite subnetworks, and both the traditional cluster consensus and the final state relations of different clusters might be solved by constructing a suitable multi-tracking model, and some meaningful results can be acquired. If not explicitly stated, are assumed to be compatible for algebraic operations

Preliminaries and problem formulation
Main result
Numerical simulations
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.