.png){kind=icon}
Return
Discrete-time dynamic average consensus
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2009.10.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the input-to-output stability properties of static average consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set of reference inputs is that the maximum relative deviation between the nth-order differences of any two reference inputs be bounded for some integer n >= 1. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Consensus algorithms
Multi-agent systems
Cooperative control
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more