.png){kind=icon}
返回
k-Dimensional Agreement in Multiagent Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2024.3431108.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a network of agents, we study the problem of designing a distributed algorithm that computes k independent weighted means of the network's initial conditions (namely, the agents agree on a k-dimensional space). Akin to average consensus, this problem finds applications in distributed computing and sensing, where agents seek to simultaneously evaluate k independent functions at a common point by running a single coordination algorithm. We show that linear algorithms can agree on quantities that are oblique projections of the vector of initial conditions, and we provide techniques to design protocols that are compatible with a pre-specified communication graph. More broadly, our results show that a single agreement algorithm can solve k consensus problems simultaneously at a fraction of the complexity of classical approaches but, in general, it requires higher network connectivity.
Keyword:
Protocols
Vectors
Sensors
Robot sensing systems
Consensus algorithm
Computational modeling
Multi-agent systems
Consensus algorithms
decentralized control
graph theory
linear time-invariant (LTI) systems
multi-agent systems
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏
分享收藏3‐Hydroxybenzene 1,2,4‐Trisphosphate, a Novel Second Messenger Mimic and unusual Substrate for Type‐I myo‐Inositol 1,4,5‐Trisphosphate 5‐Phosphatase: Synthesis and Physicochemistry.png)
ChemBioChem
ChemBioChemIF0
PREAI
分享收藏
查看更多内容