Consensus of heterogeneous multiagent systems with arbitrarily bounded communication delay (Q1992873)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Consensus of heterogeneous multiagent systems with arbitrarily bounded communication delay |
scientific article; zbMATH DE number 6972234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Consensus of heterogeneous multiagent systems with arbitrarily bounded communication delay |
scientific article; zbMATH DE number 6972234 |
Statements
Consensus of heterogeneous multiagent systems with arbitrarily bounded communication delay (English)
0 references
5 November 2018
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8775284290313721
0 references
0.8492344617843628
0 references
0.845795214176178
0 references
0.8429775834083557
0 references
