Abstract

This paper considers the problem of information consensus among multiple agents in the presence of limited and unreliable information exchange with dynamically changing interaction topologies. Both discrete and continuous update schemes are proposed for information consensus. The paper shows that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs across some time intervals has a spanning tree frequently enough as the system evolves. Simulation results show the effectiveness of our update schemes.

Keywords

Network topologyComputer scienceInformation exchangeSpanning treeConsensusDistributed computingTree (set theory)Theoretical computer scienceMulti-agent systemTopology (electrical circuits)MathematicsComputer networkArtificial intelligenceDiscrete mathematics

Affiliated Institutions

Related Publications

Publication Info

Year
2004
Type
article
Citations
153
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

153
OpenAlex

Cite This

Wei Ren, Randal W. Beard (2004). Consensus of information under dynamically changing interaction topologies. . https://doi.org/10.23919/acc.2004.1384632

Identifiers

DOI
10.23919/acc.2004.1384632