具有时延和不确定拓扑的二阶多智能体系统的平均一致性

首先,通过模型变换的方法将原系统分解为多个简单的子系统;然后,利用Lyapunov-Krasovskii的方法,以线性矩阵不等式的形式给出了带有多时变时滞的二阶多智能体系统达到平均一致性的充分条件,且只要求其通讯拓扑结构是联合连通的.最后,用仿真实验验证了本理论的正确性和有效性.     

多智能体系统实现鲁棒一致的时延相关稳定判据

考虑存在多个时变时延、有限能量扰动以及时变拓扑结构不确定等网络约束条件,给出了多智能体系统实现鲁棒一致性的时延相关稳定判据.首先,利用状态分解将原问题转化为讨论不一致向量系统的鲁棒稳定性;然后,考虑到多个时变时延和动态拓扑,采用构造Lyapunov-Krasovskii泛函的方式分析系统鲁棒稳定性,并利用自由权矩阵方法获得关于非线性矩阵不等式(NLMI)的可行解判据;最后,借鉴求解锥补问题的思想,对NLMI判据进行非线性最小化处理,以得到保守性低、易于求解的LMI稳定判据.数值实例和仿真结果均验证了所提出判据的有效性.     

具有随机通信时延的二阶多智能体系统的一致性控制

研究了具有随机通信时延的二阶多智能体系统的一致性控制问题.分别讨论了具有固定拓扑结构和变化拓扑结构两种情形下二阶多智能体系统在具有随机通信时延情况下的一致性问题.通过构造Lyapunov函数的方法得到多智能体系统的时延依赖稳定判据,并以线性矩阵不等式(LMI)的形式给出了系统稳定的条件.最后,仿真和实验结果验证了研究所得结论的正确性和有效性.     

一类多时延异质多智能体系统的一致性

针对一类具有多变时延的一阶与二阶异构多智能体系统,研究了一致性问题。首先在异质系统中设计了一致性控制算法,通过将一阶、二阶系统重排和模型变换,使原系统分解成多个简单子系统;其次,利用李雅普洛夫稳定理论,分别在固定有向拓扑结构和切换有向拓扑结构下,以线性矩阵不等式的形式给出了系统达到平均一致的充分条件;再次,通过求解一组可行的线性矩阵不等式,得到了多时延的一个容许上界;然后讨论了时延导数和控制增益对时延容许上界的影响,得出了时延上界与时延导数和控制增益分别成正相关及反相关,时延导数未知时的时延上界相对较小的结论;最后的仿真结果表明了理论结果的有效性。     

具有通信时延的二阶多智能体系统有限时间一致性跟踪控制

针对具有通信时延的二阶多智能体系统的有限时间一致性控制问题,分别研究了具有固定拓扑和切换拓扑网络结构情形下的二阶多智能体系统的有限时间一致性。为使多智能体系统能在有限时间内可以达到一致,引入一致性控制增益矩阵并设计了相应的基于相对位置和相对速度的时延状态误差有限时间一致性控制算法,利用系统模型转换,泛函微分方程稳定性理论和有限时间Lyapunov稳定性定理得到了使系统在有限时间内达到一致跟踪的最大时延上界值。最后,仿真实验结果验证了所得理论的正确性和有效性。     

一类多时变时延异质多智能体系统的组一致性

研究了一类由一阶和二阶智能体组成的异质多智能体系统的组一致性问题．首先,在多时变时延异质系统中设计了实现静态组一致的控制算法;其次,运用稳定性理论和线性矩阵不等式,分别给出了无时延、同时具有通信与输入时延的异质多智能体系统实现组一致性的充分条件;再次,通过求解一组可行的线性矩阵不等式,得到了输入时延的容许上界,并得出了通信时延与异质多智能体系统的组一致性无关的结论;最后,仿真结果验证了理论结果的有效性．     

具有通信时延和输入时延的1阶多自主体系统的一致性问题

研究了同时具有时变通信时延和定常输入时延的1阶多自主体系统的一致性问题.假设多自主体系统的连接拓扑中各节点的输出度相等,采用变量代换将原多自主体系统的一致性问题转化为降阶系统的渐近稳定性问题.根据李亚普诺夫渐近稳定性定理以及线性矩阵不等式法,在通信时延导数信息已知和未知的情况下,分别得到了多自主体系统在静态和连通拓扑结构下渐近一致的充分条件,且该条件与通信时延和输入时延都相关.仿真结果验证了结论的有效性.     

具有多时变时滞的多智能体系统在切换拓扑下的平均一致性

研究带有多时变时滞的二阶多智能体系统在切换拓扑下的平均一致性问题. 利用模型变换的方法和 Lyapunov-Krasovskii 理论, 以线性矩阵不等式(LMIs) 的形式给出了多智能体系统达到平均一致性的充分条件, 其通 讯拓扑图为联合连通的. 仿真结果验证了理论分析的正确性.

     

含时延约束的多智能体系统二分一致性

针对多智能体系统中信息交互存在通信时延这一约束,在无向符号图拓扑结构下分别研究了含固定时延和时变时延的一阶多智能体系统二分一致性问题。通过设计相应的控制协议,使得该系统收敛到两个模值相同但符号不同的状态。在稳定性分析中,利用广义Nyquist准则的方法,得到含固定时延多智能体系统实现二分一致性的充分条件;对含时变时延系统构造包含三重积分项的Lyapunov函数,利用积分不等式和线性矩阵不等式理论,并结合自由矩阵的方法得到含时变时延多智能体系统实现二分一致性的充分条件。最后,数值仿真验证了所得结论的有效性和正确性。     

基于事件触发的二阶多智能体系统平均一致性

针对二阶多智能体系统在固定无向拓扑下的平均一致性问题,为减少不必要的资源浪费,给出一种基于事件触发控制的一致性算法．首先,针对每个智能体设计基于状态误差形式的触发函数,只有当状态误差达到特定值时智能体才触发事件,在两个相邻事件触发时刻之间保持控制输入不变．然后,利用模型转换思想将系统的一致性问题转化为稳定性问题,并利用矩阵理论和李亚普诺夫理论给出系统达到平均一致的充分条件．最后,通过仿真实验验证该理论方案的有效性.     

多时滞奇异系统鲁棒稳定性分析

讨论了多时滞奇异系统的鲁棒稳定性问题．通过构造一种新的Lyapunov—Krasovskii泛函（LKF）,结合离散化LKF理论,给出了多时滞奇异系统正则、脉冲自由和渐近稳定的充分条件,并将该结论推广到含有范数有界不确定性的多时滞奇异系统．数值算例验证了该方法的有效性和可行性．     

Impulsive consensus seeking in directed networks of multi-agent systems with communication time delays

In this article, we consider average consensus problem in directed delayed networked multi-agent systems having impulsive effects with fixed topology and stochastic switching topology. A simple impulsive consensus protocol for such networks is proposed, and some generic criteria for solving the average consensus problem are analytically derived. It is shown that a directed delayed networked multi-agent system can achieve average consensus globally exponentially with suitable impulsive gain and impulsive interval. Subsequently, two typical illustrative examples, along with computer simulation results, are provided to visualise the effectiveness and feasibility of our theoretical results.     

Average consensus seeking of high-order continuous-time multi-agent systems with multiple time-varying communication delays

The average consensus problem of high-order multi-agent systems with multiple time-varying communication delays is investigated in this paper. By using the idea of state decomposition, the condition for guaranteeing average consensus is converted into verifying the stability of zero equilibrium of disagreement system. Considering multiple time-varying communication delays, Lyapunov-Krasovskii approach in time-domain is employed to analyze the stability of zero equilibrium. With the help of Free-weighting Matrices (FWM) approach, the tolerant upper bounds on communication delays can be obtained through solving feasible linear matrix inequalities (LMIs). Delay-dependent stability criteria for both strongly-connected fixed and switching topologies are provided in the main results. Further, the conclusion is extended to the case of jointly-connected switching topologies. Numerical examples and simulation results are given to demonstrate the effectiveness and the benefit on reducing conservativeness of the proposed method.     

Leader-following consensus of high-order multi-agent linear systems with bounded transmission channels

The leader-following consensus of high-order multi-agent linear systems with bounded transmission channels is considered. Agents modelled as LTI dynamics exchange information according to a network which can be described as a graph with agents as its vertices and information transmission channels as its edges. The transmission channels are bounded. The objective is leader-following in the sense that the state of all agents should converge to that of the leader vehicle. Detailed analysis of the leader-following consensus under bounded transmission channels is investigated for both fixed and switching network topologies.     

离散时间多智能体系统一致性的平均驻留时间条件

研究高阶离散时间线性多智能体系统在有向切换信息拓扑下的状态一致性问题。首先通过提出的线性变换将该一致性问题转换为相应离散时间线性切换系统的渐近稳定性问题。然后借助于切换系统稳定性的平均驻留时间方法,分别得到如下两种情形下该一致性问题可解的充分条件：1)信息拓扑集合中的一部分拓扑是可一致的;2)信息拓扑集合中所有信息拓扑是可一致的。最后通过数值仿真验证了所得理论结果的正确性。     

Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.