Abstract
This brief considers the network topology optimization problem for event-triggered consensus of multi-agent systems (MASs) to reduce the triggered events and improve the convergence rate. For a MAS with an undirected graph as its communication network, edge swapping operations are applied to optimize its network topology, which keep the number of links incident to each agent unchanged. Based on the theory of graph spectra, a necessary condition is provided to determine an effective edge swapping operation which leads to less event triggered times and faster convergence rate. An iterative algorithm is developed to optimize the network topology for MASs under the first-order event-triggered consensus protocol. Finally, some numerical simulations are given to illustrate the effectiveness of the approach.
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 callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
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.
