期刊文献+

Hierarchical random networks for optimizing communication complexity of consensus-based networks

在线阅读 下载PDF
导出
摘要 The consensus mechanism in multi-agent networks has attracted considerable attention in both control and computer science.However,current advancements in consensusbased control theory lack a general framework to optimize the communication complexity required to reach consensus.This gap highlights the necessity of robust analytical frameworks to advance the field.Our proposed method,termed hierarchical random networks,decomposes the entire network into multiple random sub-swarms and constructs a hierarchical structure among these sub-swarms.First,we establish a simplified condition to ensure the connectivity of hierarchical random networks.Further,we prove that the expected number of network connections in hierarchical random networks can be reduced to its lower bound as the size of sub-swarms approaches the square root of the total number of agents.At the end of the paper,we validate the effectiveness of the proposed network topology through simulation case studies on maneuvering target tracking.The results demonstrate that combining hierarchical random networks with consensus-based filters can achieve maneuvering target tracking while reducing communication complexity.
出处 《Journal of Systems Engineering and Electronics》 2026年第2期636-651,共16页 系统工程与电子技术(英文版)
基金 support by the Aeronautical Science Foundation of China(20220001057001,20240001057002).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部