Photo by headwayio from unsplash
This paper focuses on the consensus problem of high-order heterogeneous multiagent systems with arbitrarily bounded communication delays. Through the method of nonnegative matrices, we get a sufficient consensus condition for… Click to show full abstract
This paper focuses on the consensus problem of high-order heterogeneous multiagent systems with arbitrarily bounded communication delays. Through the method of nonnegative matrices, we get a sufficient consensus condition for the systems with dynamically changing topology. The results of this paper show, even when there are arbitrarily bounded communication delays in the systems, all agents can reach a consensus no matter whether there are spanning trees for the corresponding communication graphs at any time.
Journal Title: Mathematical Problems in Engineering
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!