Consensus problems for linear time-invariant multi-agent systems with saturation constraints
Consensus problems for linear time-invariant multi-agent systems with saturation constraints
复制标题
具有饱和约束的线性时不变多智能体系统的共识问题
DOI：
10.1049/iet-cta.2009.0299
复制
发表时间：
2011-04-01
影响因子：
2.6
通讯作者：
Wei, W.
中科院分区：
文献类型：
--
作者：
Li, Y.;Xiang, J.;Wei, W.
研究了一类网络化多智能体系统，其中每个智能体具有一个相同的简单积分器的动态特性，并且连接的拓扑结构是固定的。证明了当存在饱和约束时，文献中广泛使用的这类多智能体系统的一般一致性协议仍然有效。作为一种扩展，提出了一种“bang-bang”型的共识协议，以实现有限时间的共识，这放松了以前的无向连接假设。
A class of networked multi-agent systems is studied in this study where each agent has an identical dynamics of a simple integrator and the topology of the connections is fixed. It is proved that, when there are saturation constraints, a general consensus protocol widely used in the literatures for this class of multi-agent systems remains valid. As an extension, a 'bang-bang' type of consensus protocol is proposed to achieve the finite-time consensus, which relaxes the previous undirected connection assumption.