.png){kind=icon}
返回
Dynamic Average Consensus Over Strongly Connected Digraphs Based on Integral Surplus
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2025.3584699.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article addresses the design of a dynamic average consensus (DAC) algorithm over strongly connected but may not necessarily balanced digraphs, which seems to be the first time in the literature. Specifically, a new concept of integral surplus is proposed for DAC problems. On this basis, an integral surplus DAC algorithm is developed for agents to track the average of their multiple dynamic input signals with a bounded steady-state error. Such error is tunable by some algorithm parameters and even vanishes for special classes of input signals. Simulation examples are presented to verify the theoretical results.
Keyword:
Heuristic algorithms
Steady-state
Perturbation methods
Eigenvalues and eigenfunctions
Vectors
Urban areas
Training
Signal resolution
Protocols
Integral equations
Dynamic average consensus (DAC)
integral surplus
multiagent system
strongly connected digraph
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies具有时变拓扑的任意强连通有向图的平均一致性
OAAI
OAAI分享收藏Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
PREAI
分享收藏
查看更多内容