W. Ren, R. Beard
tlooto Summary
It is shown that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.
Abstract
This note 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. This note shows that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.
Citation format
REN, W.; BEARD, R. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2005, 50: 655–661.