带强连通分支的多智能体系统可控包含控制

研究有强连通子图拓扑结构的有向多智能体系统领导者选择及可控包含控制问题.根据网络拓扑结构,智能体被分为两类:单元智能体和一般智能体.首先设计强连通子图中个体组成的单元智能体的一致性协议实现各个单元的一致;后由单元智能体和一般智能体构成新的拓扑结构,结合复杂网络可控性理论与二分图最大匹配算法确定满足网络可控的最少领导者集合,并为所有智能个体设计相应的控制协议,驱使跟随者渐近收敛到多个领导者组成的动态凸包中,从而实现网络的可控包含控制.仿真结果验证了理论分析的正确性.     

切换网络下时变线性多智能体系统的指数同步

研究切换网络下时变连续线性多智能体系统的同步问题. 在智能体动态满足一致完全可控性条件下, 设计出同步协议. 通过将多智能体系统同步问题表示为矩阵无穷乘积形式并论证矩阵无穷乘积指数收敛到0, 给出了多智能体系统指数同步结论. 最后以仿真实例验证本文结论.     

二阶多智能体系统的线性广义一致性

首次针对二阶多智能体系统提出广义一致性的概念;然后探讨有向网络拓扑结构下的二阶多智能体系统的线性广义一致性问题.通过设计有效的控制协议,使用代数图论和稳定性理论,推导获得二阶的多智能体系统以及带有通信延迟的二阶系统实现线性广义一致性的充分且必要条件.结果表明,在有向网络中,耦合增益参数和拉普拉斯矩阵的特征值对达到广义一致起着关键作用;最后,数值仿真验证了结果的正确性.     

具有多图拓扑结构的同类智能体LQR控制

本文考虑具有一般线性时不变动态特性的多智能体系统优化控制问题. 将智能体之间的通讯拓扑结构建模成具有自环的无向多图, 每个子系统就是一个节点, 每个节点的控制行为只与本身及邻居节点有关. 由于反馈矩阵具有块对角结构约束, 本文研究的LQR控制问题本质上是一类结构优化问题. 最小化系统LQR性能指标等价于最小化单个智能体性能指标和. 基于线性矩阵不等式得到系统的次优性能指标, 指出LQR性能域是凸集. 由此多智能体系统的LQR控制转化为若干个子系统的LQR控制, 可以通过求解系数是Laplacian矩阵最小最大特征值的两个矩阵不等式得到反馈增益. 数值例子验证了方法的有效性.     

分布时滞系统的反馈镇定

求解特征矩阵是镇定时滞系统的关键问题,本文给出了系统的特征根的代数重复度与几 何重复度均为一般值情况下特征矩阵的求法,即把它归结为求解一组线性代数方程的问题,并 得到了该方程组有解及对应于同一特征值的解向量组线性独立的充分条件.此外,还提出了 一种算法,用以处理系统对应于不同特征值的左特征向量线性相关情况下系统的镇定问题.     

群集系统的软控制

考虑欧氏空间中群集动态系统的"软控制"问题,即在不改变群集系统中个体间现有规则的条件下,通过增加一个或多个可控智能体干扰群集个体的行为,使群集中心转移到期望的位置.给出了可控智能体的控制规则,并利用粒子群(PSO)算法讨论了群集系统软控制的最优收敛问题.实例研究表明了"软控制"在群集系统中的可行性.     

含时变时延的多智能体的包容控制器设计

针对一类含时变通讯时延的多智能体系统,基于时滞依赖法提出了其在有向网络拓扑下的一类包容控制器设计的方法,该设计能有效地驱使多智能体系统中所有跟随者的状态渐近一致地收敛到领导者运动过程中形成的几何凸包．结合李亚普诺夫稳定性理论和线性矩阵不等式（LMI）方法,推导了多智能体系统包容控制率存在的充分条件,并将包容控制器的设计最终转化成求解线性矩阵不等式可行解的问题．结果表明,该方法对多智能体系统中的时变通讯时延具有良好的补偿效果．最后通过仿真算例验证了此方法的有效性和可行性．     

多智能体系统一致性问题的控制器与拓扑协同优化设计

本文考虑多智能体系统一致性问题的控制与拓扑协同优化设计.首先在给定的二次性能指标下,对多智能体系统的分布式一致性控制协议寻优,得到依赖于网络拓扑图拉普拉斯矩阵的最优控制器.其次,为进一步最大限度地减少拓扑之间的连边,又不降低多智能体系统的收敛速度,通过权衡系统的通信能量和控制能量,寻求网络拓扑的优化设计,给出了拓扑优化算法和多智能体系统特征值的优化方法.最后,仿真研究验证了在控制器优化的基础上进一步寻求拓扑优化,可大大提升系统的一致性性能.     

一类异构多智能体系统有向图下的广义平均一致性分析

本文对有向图下离散时间一阶二阶混合的异构多智能体系统广义平均一致性问题进行研究.首先给出了该异构系统广义平均一致性的基本概念.在此基础上,针对平均一致性研究中对交互拓扑为平衡网络的局限,提出了一种基于辅助变量的线性一致性协议,对每一个智能体增加一个辅助变量,用于记录个体的状态更新.采用图论、非负矩阵理论、特征值扰动等方法进行分析证明,表明该协议使得异构多智能体系统在任意强连通有向图下达到广义平均一致性.并对收敛值的性质进行了分析.最后,通过仿真对该结论进行了验证.     

基于观测器的线性时变时滞多智能体系统一致性

针对系统状态不可测和具有通信时延的线性多智能体系统,提出一种基于观测器的一致性控制算法.设计观测器用于解决智能体状态不可测的问题,在观测器的基础上,提出一种控制协议来实现带时变时延的线性多智能体系统一致性.利用模型转换的方式将原系统转换为新的模型系统,在此基础上,构造Lyapunov-Krasovskii函数并分析系统稳定性,通过求解线性矩阵不等式获取控制器系数矩阵.最后通过Matlab数值仿真验证所提出方法的有效性.     

Controllability improvement for multi-agent systems: leader selection and weight adjustment

For an uncontrollable system, adding leaders and adjusting edge weights are two methods to improve controllability. In this paper, the controllability of multi-agent systems under directed topologies is studied, especially on the leader selection problem and the weight adjustment problem. For a multi-agent system, necessary and sufficient algebraic conditions for controllability with fewest leaders are proposed. To improve controllability by adjusting edge weights, the system is supposed to be structurally controllable, which holds if and only if the communication topology contains a spanning tree. It is also proved that the number of the fewest edges needed to be assigned on new weights equals the rank deficiency of controllability matrix. In addition, a leader selection algorithm and a weight adjustment algorithm are presented. Simulation examples are provided to illustrate the theoretical results.     

Interconnection topologies for multi-agent coordination under leader–follower framework

In this paper, the formation control problem of the network of multiple agents is studied in terms of controllability, where the network is of the leader–follower structure with some agents taking leaders role and others being followers interconnected via the neighbor-based rule. It is shown that the controllability of a multi-agent system can be uniquely determined by the topology structure of interconnection graph, for which the investigation comes down to that for a multi-agent system with the interconnection graph being connected. Based on these observations, two kinds of uncontrollable interconnection topologies are characterized, and a necessary and sufficient eigenvector-based condition is presented. Our studies also touch upon the selection of leaders.     

Controllability of multi-agent systems with time-delay in state and switching topology

In this article, the controllability issue is addressed for an interconnected system of multiple agents. The network associated with the system is of the leader–follower structure with some agents taking leader role and others being followers interconnected via the neighbour-based rule. Sufficient conditions are derived for the controllability of multi-agent systems with time-delay in state, as well as a graph-based uncontrollability topology structure is revealed. Both single and double integrator dynamics are considered. For switching topology, two algebraic necessary and sufficient conditions are derived for the controllability of multi-agent systems. Several examples are also presented to illustrate how to control the system to shape into the desired configurations.     

多智能体网络系统的能控性代数条件

能控性是多智能体系统研究的核心问题,主要包括结构可控性和精准可控性。对多智能体系统的模型和能控性代数条件进行了总结。在相对协议和绝对协议条件下,运用图论和矩阵论的知识系统分析了多智能体系统能控性的代数条件。按照同质多智能体到异质多智能体的顺序,对现有的多智能体系统模型和代数条件进行了梳理,并在已有结论的基础上对多智能体系统能控性的代数条件进行了改善,进一步提出了新的代数条件。多智能体能控性代数条件的改进大大简化了能控性的计算量。     

Controllability of heterogeneous multi-agent systems under directed and weighted topology

This paper considers the controllability problem for both continuous- and discrete-time linear heterogeneous multi-agent systems with directed and weighted communication topology. First, two kinds of neighbour-based control protocols based on the distributed protocol of first-order and second-order multi-agent systems are proposed, under which it is shown that a heterogeneous multi-agent system is controllable if the underlying communication topology is controllable. Then, under special leader selection, the result shows that the controllability of a heterogeneous multi-agent system is solely decided by its communication topology graph. Furthermore, some necessary and/or sufficient conditions are derived for controllability of communication topology from algebraic and graphical perspectives. Finally, simulation examples are presented to demonstrate the effectiveness of the theoretical results.     

Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems

This paper studies some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems. First, basic theoretical analysis is carried out for the case where for each agent the second-order dynamics are governed by the position and velocity terms and the asymptotic velocity is constant. A necessary and sufficient condition is given to ensure second-order consensus and it is found that both the real and imaginary parts of the eigenvalues of the Laplacian matrix of the corresponding network play key roles in reaching consensus. Based on this result, a second-order consensus algorithm is derived for the multi-agent system facing communication delays. A necessary and sufficient condition is provided, which shows that consensus can be achieved in a multi-agent system whose network topology contains a directed spanning tree if and only if the time delay is less than a critical value. Finally, simulation examples are given to verify the theoretical analysis.     

Controllability of discrete-time multi-agent systems with directed topology and input delay

This paper investigates the controllability of first-order and second-order discrete-time multi-agent systems with directed topology and input delay. The problem is studied in the leader–follower framework where a number of agents are selected to be leaders and serve as control inputs to all other agents. Sufficient and necessary conditions are derived for the controllability of first-order discrete-time multi-agent systems. With sampling period and feedback gain satisfying certain conditions, it is proved under three different protocols that the controllability of second-order discrete-time multi-agent systems is equivalent to that of a pair of submatrices of Laplacian matrix. In addition, the controllability of both first-order and second-order discrete-time multi-agent systems with input delay is shown, through some transformations, to be equivalent to that of the transformed non-delayed systems. Finally, some simulation examples are given to illustrate the theoretical results.     

Controllability of a Leader–Follower Dynamic Network With Switching Topology

This note studies the controllability of a leader-follower network of dynamic agents linked via neighbor rules. The leader is a particular agent acting as an external input to steer the other member agents. Based on switched control system theory, we derive a simple controllability condition for the network with switching topology, which indicates that the controllability of the whole network does not need to rely on that of the network for every specific topology. This merit provides convenience and flexibility in design and application of multiagent networks. For the fixed topology case, we show that the network is uncontrollable whenever the leader has an unbiased action on every member, regardless of the connectivity of the members themselves. This gives new insight into the relation between the controllability and the connectivity of the leader-follower network. We also give a formula for formation control of the network.     

有向符号网络的边能控性研究

符号网络是一类具有正负符号特征的网络.在多智能体系统中,符号网络能够描述智能体之间的合作与对抗交互关系,因此受到学者的广泛关注.本文主要研究有向符号网络的边能控性.首先,对具有符号网络的多智能体系统边动力学进行建模,得到边能控性模型.其次,从网络拓扑结构角度对边能控子空间进行定量刻画,利用有向符号网络的距离和等价划分得到能控子空间的上下界估计.进一步,讨论了符号网络边能控性与顶点能控性的关系.所得结果表明:当顶点符号图为结构非平衡时,符号网络的边能控性与顶点能控性等价.最后,通过仿真结果验证所得理论的有效性.     

异质多智能体系统二分一致性的充要条件

针对由一阶智能体和二阶智能体组成的异质多智能体系统的二分一致性问题,对连续和离散系统情形分别设计了二分一致性协议。基于结构平衡的拓扑,通过规范变换实现了从具有敌对关系的系统到具有非负连接权重系统的转化,将二分一致性问题转变为一般一致性问题。进一步,运用代数图论和矩阵理论分析闭环控制系统的动态特性,得到了异质多智能体系统渐近实现二分一致性的充要条件。最后通过数值模拟验证了所得结果的有效性。