On consensus with a general discrete time convex combination based algorithm for multi-agent systems
On consensus with a general discrete time convex combination based algorithm for multi-agent systems
复制标题
基于通用离散时间凸组合的多智能体系统算法的共识
DOI：
10.1109/med.2011.5983182
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
R. Malhamé
中科院分区：
文献类型：
--
作者：
Sadegh Bolouki;R. Malhamé
考虑了一般的基于凸组合的多智能体系统离散时间演化模型。随后导出了每个代理状态存在单个限制的充分条件。此外，研究表明，在更强的条件下，这些个人限制是相等的，即出现共识。解释了这些结果与其他众所周知的共识模型的关系。
A general convex combination based model in discrete time for the evolution of multi-agent systems is considered. Sufficient conditions under which an individual limit for each agent's state exists are subsequently derived. Moreover, it is shown that under stronger conditions, those individual limits are equal, i.e., consensus occurs. The relationship of these results to those of other well known consensus models is explained.