.png){kind=icon}
返回
Consensus of Multi-Agent Systems Under Binary-Valued Measurements and Recursive Projection Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2019.2942569.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies consensus problems of multi-agent systems with binary-valued communications. Different from most existing works, the agents considered in this paper can only get binary-valued observations of its neighbors' states with random noises. A consensus algorithm is proposed: first, each agent estimates its neighbors' states by the recursive projection algorithm; then, each agent designs the control timely based on the estimates. It is proved that the estimates of the states can converge to the true states with a faster convergence rate than that in the parameter estimation. Moreover, the states of the agents can achieve mean-square consensus, and the corresponding consensus speed can achieve O(1/t) under certain conditions. Finally, simulations are given to demonstrate the theoretical results.
Keyword:
Convergence
Consensus algorithm
Projection algorithms
Noise measurement
Estimation
Multi-agent systems
Approximation algorithms
Binary-valued communications
convergence
convergence rate
consensus control
estimate
multi-agent systems
recursive projection algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Average Consensus of Multi-Agent Systems Under Directed Topologies and Binary-Valued Communications.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容