具有通信时延的离散时间二阶多个体网络的一致性问题

针对具有通信时延的离散时间二阶多个体系统的一致性问题,采用了具有静态领导者的一致性算法.根据广义Nyquist判据和Gerschgorin圆盘定理,得到了系统渐近收敛到领导者状态的充分条件.在个体与领导者构成的连接拓扑满足一定连通性的前提下,该充分条件是分散形式的,与控制参数、邻居个体之间的连接权值相关,而与通信时延大小无关.仿真结果证明了结论的正确性.     

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

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

具有时延的多个体系统的一致性问题综述

考察了具有时延的多个体系统的一致性问题．根据不同的分析方法,介绍了关于具有通信时延的多个体系统一致性问题的结果,并对各种分析方法的特点进行了比较．此外,对具有输入时延的多个体系统的现有一致性结果也作了介绍．最后评述了该研究领域存在的问题以及今后的研究方向．

     

时延异构多自主体系统的群一致性分析

针对由一阶自主体和二阶自主体构成的异构多自主体系统的静态群一致性问题,分别提出了在固定连接拓扑和切换连接拓扑结构下的静态群一致性算法。通过构造Lyapunov-Krasovskii函数,得到了系统在具有相同时变通信时延的群一致性算法作用下渐近收敛群一致的充分条件,并以线性矩阵不等式表示。最后,仿真结果表明,所提算法在满足一定条件下能使时延异构多自主体系统渐近收敛群一致。     

时延多智能体系统领导跟随一致性研究

为符合实际情形,针对不确定与随机发生非线性的多智能体系统,研究了有时延且网络拓扑切换时系统的领导跟随一致性。传统协议通常保守的假设邻接个体间通信时延与个体和领导者间通信时延大小相同,新协议中上述时延可以大小不同。相比于传统方法,新颖的将复杂网络同步问题研究领域对时延的处理方法引入到多智能体系统一致性问题的研究中,利用一类推广的Halanay不等式,给出系统实现领导跟随一致性需满足的两个与时延无关的充分条件,即时延在相关参数满足定理条件的前提下不影响系统最终实现一致性。相比其他方法得到的含有时延的判定条件,本研究结果保守性更低,实例仿真验证了新协议的可行性。     

通信时延下多智能体系统的安全一致性控制

研究了离散时间多智能体系统存在通信时延条件下的安全一致性问题.本文的目标是设计一种一致性控制算法能够使得网络中各正常智能体抵御敌对智能体的攻击并实现最终状态一致.该算法仅利用个体的自身状态和相邻个体的时延信息作为控制输入,并根据控制器参数、拓扑属性和通信时延,获得了所提算法实现收敛的充要条件.最后,通过仿真实例对理论结果进行了验证.     

一类离散时延多智能体系统的安全一致性研究

文章针对存在恶意智能体的一类离散多智能体系统,研究了其在时延影响下的安全一致性问题:以距离期望值一个标准差为约束条件,设计了一类容忍性强的安全一致性算法;仅利用包含自身信息在内的邻居时延信息序列,通过算法选取有效个最优信息作为控制输入,使系统在一定条件下实现安全一致.仿真实验结果表明,采用该算法,不仅增强了系统对恶意智...     

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

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

含自时延和通信时延的Euler-Lagrange系统自适应一致性算法

针对动力学方程中含未知参数的多Euler-Lagrange系统的一致性控制问题,设计了一种分布式自适应协调控制器.该控制器容许多Euler-Lagrange系统的通信拓扑为一般的有向图,并允许通信时延和自时延的同时存在.利用Barblata定理、Lyapunov稳定性定理和LMI方法等对控制器的稳定性进行了证明,并设计了数值仿真实验,仿真结果证明了控制算法的有效性.     

具有随机时延的的多智能体系统的一致性

本文研究了具有随机时不变通信时延的多智能体系统的一致性问题。假设系统拓扑是固定有向的强连通图,考虑多智能体系统中存在随机通信时延的情况,即各智能体之间的通信时延是以一定概率存在的,采用具有动态参考状态的一致性控制算法,通过变量代换,将多智能体的一致性问题转化为误差系统的渐进稳定性问题,然后再应用Lyapunov稳定性理论与随机分析方法推导出误差系统在该算法作用下趋于稳定的充分条件,并以线性矩阵不等式（LMIs）表示,即原多智能体系统在此充分条件下各智能体的状态能够达到一致。最后应用一个实例验证了所提出结论的有效性。     

Robust consensus of multi-agent systems with diverse input delays and asymmetric interconnection perturbations

The consensus problem of second-order multi-agent systems with diverse input delays is investigated. Based on the frequency-domain analysis, decentralized consensus conditions are obtained for the multi-agent system with symmetric coupling weights. Then, the robustness of the symmetric system with asymmetric perturbation is studied. A bound of the largest singular value of the perturbation matrix is obtained as the robust consensus condition. Simulation examples illustrate the design procedure of consensus protocols and validate the correctness of the results.     

Stationary consensus of heterogeneous multi-agent systems with bounded communication delays

Consensus seeking is investigated for the discrete-time heterogeneous multi-agent systems composed of first-order agents and second-order agents, and two stationary consensus algorithms are constructed for the first-order agents and the second-order agents, respectively. Based on the properties of nonnegative matrices, sufficient consensus criteria are obtained for the agents with bounded communication delays under fixed topology and switching topologies, respectively. With some prerequisites on the coupling weights and the sampling interval, the asymptotic consensus achievement of the dynamic agents is independent of the communication delay, but strictly depends on the connectedness of the interconnection topology. Simulation results illustrate the correctness of the results.     

Solving a modified consensus problem of linear multi-agent systems

A distributed protocol is proposed for a modified consensus problem of a network of agents that have the same continuous-time linear dynamics. Each agent estimates its own state using its output information and then sends the estimated state to its neighbor agents for the purpose of reaching a consensus. The modified consensus problem requires the group decision value to be a linear function of initial states and initial estimated states of all agents in the network, and the transformation matrix associated with this linear function not to be a zero matrix. It is proved that under the proposed control protocol, the modified consensus problem can be solved if and only if the system matrices of the agent’s dynamics are stabilizable and detectable, the input matrix is not a zero matrix, and the communication topology graph has a spanning tree. The proposed protocol can also be extended to multi-agent systems where agents are described by discrete-time linear dynamics. The corresponding necessary and sufficient conditions are provided as well.     

Global consensus for discrete-time multi-agent systems with input saturation constraints

In this paper, we consider the global consensus problem for discrete-time multi-agent systems with input saturation constraints under fixed undirected topologies. We first give necessary conditions for achieving global consensus via a distributed protocol based on relative state measurements of the agent itself and its neighboring agents. We then focus on two special cases, where the agent model is either neutrally stable or a double integrator. For the neutrally stable case, any linear protocol of a particular form, which solves the consensus problem for the case without input saturation constraints, also solves the global consensus problem for the case with input saturation constraints. For the double integrator case, we show that a subset of linear protocols, which solve the consensus problem for the case without saturation constraints, also solve the global consensus problem for the case with input saturation constraints. The results are illustrated by numerical simulations.     

Distributed robust consensus control of multi-agent systems with heterogeneous matching uncertainties

This paper considers the distributed consensus problem of linear multi-agent systems subject to different matching uncertainties for both the cases without and with a leader of bounded unknown control input. Due to the existence of nonidentical uncertainties, the multi-agent systems discussed in this paper are essentially heterogeneous. For the case where the communication graph is undirected and connected, based on the local state information of neighboring agents, a fully distributed continuous adaptive consensus protocol is designed, under which the consensus error is uniformly ultimately bounded and exponentially converges to a small adjustable bounded set. For the case where there exists a leader whose control input is unknown and bounded, a distributed adaptive consensus protocol is proposed to ensure the boundedness of the consensus error. A sufficient condition for the existence of the proposed protocols is that each agent is stabilizable.     

Consensus protocols for discrete-time multi-agent systems with time-varying delays

This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm proposed by Jadbabaie et al., specifically, the presented protocols allow for the case that agents can only use delayed information of themselves, whereas the popular one is invalid. It is proved that if the union of the interaction topologies across the time interval with some given length always has a spanning tree, then in the presence of bounded time-varying delays, those protocols solve consensus problems.     

离散时间系统的多智能体的一致性

动态多智能体系统的一致性是复杂动力学系统中很有现实意义的问题.假设智能体连接网络拓扑是无向、固定和连通的,而且个体之间信息传递存在通信时廷,分析了一个动态移动多智能体离散时间系统.应用广义Nyquist判据研究具有通信时延的多智能体离散时间系统,得到了保证系统达到一致的充分条件.最后应用计算机仿真验证了该结论的有效性.     

Containment control for second-order multi-agent systems with time-varying delays

This paper considers the containment control problem for second-order multi-agent systems with time-varying delays. Both the containment control problem with multiple stationary leaders and the problem with multiple dynamic leaders are investigated. Sufficient conditions on the communication digraph, the feedback gains, and the allowed upper bound of the delays to ensure containment control are given. In the case that the leaders are stationary, the Lyapunov–Razumikhin function method is used. In the case that the leaders are dynamic, the Lyapunov–Krasovskii functional method and the linear matrix inequality (LMI) method are jointly used. A novel discretized Lyapunov functional method is introduced to utilize the upper bound of the derivative of the delays no matter how large it is, which leads to a better result on the allowed upper bound of the delays to ensure containment control. Finally, numerical simulations are provided to illustrate the effectiveness of the obtained theoretical results.     

Distributed consensus for multi-agent systems with delays and noises in transmission channels

This paper studies the distributed consensus problem for linear discrete-time multi-agent systems with delays and noises in transmission channels. Due to the presence of noises and delays, existing techniques such as the lifting technique and the stochastic Lyapunov theory are no longer applicable to the analysis of consensus. In this paper, a novel technique is introduced to overcome the difficulties induced by the delays and noises. A consensus protocol with decaying gains satisfying persistence condition is adopted. Necessary and sufficient conditions for strong consensus and mean square consensus are respectively given for non-leader–follower and leader–follower cases under a fixed topology. Under dynamically switching topologies and randomly switching topologies, sufficient conditions for strong consensus and mean square consensus are also obtained. Numerical examples are given to demonstrate the effectiveness of the proposed protocols.