网络拓扑
多智能体系统
计算机科学
分布式计算
共识
生成树
信息交流
树(集合论)
理论计算机科学
一致性算法
拓扑(电路)
数学
计算机网络
人工智能
离散数学
算法
组合数学
电信
作者
Wei Ren,Randal W. Beard
出处
期刊:IEEE Transactions on Automatic Control
[Institute of Electrical and Electronics Engineers]
日期:2005-05-01
卷期号:50 (5): 655-661
被引量:6062
标识
DOI:10.1109/tac.2005.846556
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI