Abstract
In this paper, we consider fast convergent average consensus based on community detection algorithm. Generally, we know that a small network can have a faster convergence speed than a big one at the same condition. So we divide a multiagent network into several small networks. Firstly, let every small network reach own consensus, and then entire network reach the average consensus. Based on this idea, we present FCWAC Algorithm. For the FCWAC Algorithm, we obtain the results on the average consensus of first-, second-, and high-order continuous-time multiagent systems. Finally, simulation examples illustrate our theoretical results.
Highlights
In the last twenty years the distributed consensus problem of multiagent systems has attracted extensive interest of many scholars, owing to many its important practical applications, such as satellite configuration, unmanned aerial vehicle formation, and so on
For the first time, Vicsek et al [3] presented an analysis of the alignment problem based on a model about flocking, which was a milestone in development of the consensus theory of multiagent systems
Wu et al [20] discussed the leader-following consensus problem of high-order multiagent systems via a novel distributed event-triggered communication protocol based on state estimates of neighboring agents, which can greatly reduce the communication load of multiagent networks
Summary
In the last twenty years the distributed consensus problem of multiagent systems has attracted extensive interest of many scholars, owing to many its important practical applications, such as satellite configuration, unmanned aerial vehicle formation, and so on. Lin et al [18] considered a distributed consensus algorithm for the second-order multiagent systems with nonconvex velocity and control input constraints, which is introduced based on the union of the communication graphs has directed spanning trees among each time interval of cer-. Wu et al [20] discussed the leader-following consensus problem of high-order multiagent systems via a novel distributed event-triggered communication protocol based on state estimates of neighboring agents, which can greatly reduce the communication load of multiagent networks. For the first time Oreshkin et al [10] presented a theoretical demonstration, which, by adding a local predictor in distributed average consensus protocol, can effectively improve the convergence speed of multiagent systems. 3, we present FCWAC Algorithm based on the community detection algorithm [23] and consider average consensus of first-order multiagent systems according to the FCWAC Algorithm. Zero is a simple eigenvalue of L if and only if the graph G has a directed spanning tree
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
