牵制控制下的多智能体系统群一致性

本文研究了一类多智能体系统在牵制控制下的群一致性问题,提出了融合群内信息交互、群间信息交互和牵制控制器的一致性协议.对固定拓扑下的二群组智能体系统和切换拓扑下的多群组智能体系统,利用稳定性理论和图论分别给出了适用于任意拓扑结构的充要条件,使得智能体系统在所提协议和牵制控制器的联合作用下实现预期的群一致.针对拓扑图中含有生成树这一特例,分析了被施加牵制控制的智能体在结构中的具体位置.此外,对切换拓扑下进行非线性交互的多群组智能体系统,利用Lyapunov方法推导出一充分条件,得出只要对多智能体系统的一部分主体进行牵制控制,则所有智能体即可在所提协议和牵制控制器的作用下渐近收敛于各自的期望一致平衡点.最后,仿真例子验证了所提方法的有效性.     

符号网络下一类非线性二分一致性系统的跟踪控制

研究具有对抗交互的一类非线性多智能体系统的二分一致性跟踪控制问题,借助有向符号图刻画智能体之间的通信关系,并假定符号图是结构平衡的.进一步,借助符号图网络对二分一致性跟踪问题进行公式化描述.基于最近邻原则,结合拉普拉斯矩阵、牵制矩阵、符号函数、耦合增益参数等,设计分布式控制律.利用Barbalat引理和李亚谱诺夫函数证明整个闭环系统的渐近稳定性,在保持闭环系统稳定的条件下推导出耦合增益的下界.最后通过仿真验证所提出方法的有效性.     

带有观测器的广义多智能体系统二分一致性

本文研究了带有观测器的广义多智能体系统的二分一致性问题.根据符号图的特性,提出了一种基于广义观测器的分布式二分一致性控制协议.以广义系统稳定性理论和代数图论为主要研究工具,分析并得到了广义多智能体系统实现二分一致性的充分条件.利用广义观测器的相对和绝对信息设计了两种新的二分一致性控制协议.数值仿真验证了理论结果的准确性和有效性.     

二阶多智能体系统在自适应间歇牵制控制下的部分分量一致性

部分分量一致指的是多智能体系统中所有状态变量的一些分量渐近趋于恒同这样一种现象,它是一种比恒同一致弱的群体动力学行为.基于二阶多智能体系统的动力学模型,设计一种自适应间歇牵制控制协议,通过置换矩阵方法将原偏差系统中待研究的状态分量转换为新偏差系统中前面部分的状态分量,并运用矩阵理论和部分变元稳定性理论,导出部分分量一致性准则,从而确保在指数稳定意义下该多智能体系统的部分分量一致性得以实现.最后,通过数值模拟验证理论分析结果.     

通信受限的多智能体系统二分实用一致性

针对存在量化数据、通信时滞等通信约束以及带有竞争关系的多智能体系统, 研究其二分实用一致性问题, 提出了一种基于量化器的分布式控制协议. 该协议基于结构平衡拓扑假设, 通过规范变换将具有竞争关系系统转变为具有非负连接权重系统, 使二分实用一致性问题转变为一般实用一致性问题. 利用微分包含理论、菲利波夫解的框架、代数图论以及Lyapunov稳定性理论, 证明了在本文所提控制策略下, 具有竞争关系的多智能体系统能实现二分实用一致, 即智能体状态收敛至模相同但符号不同的可控区间, 并给出了误差收敛上界值. 仿真试验进一步验证了理论结果的有效性.     

符号图下含扰动的多智能体系统预定时间二分一致性

研究符号图下具有扰动的多智能体系统二分一致性控制问题.考虑了线性系统、非线性不确定系统以及切换拓扑的情况,分别提出相应的预定时间控制器,各控制器可使系统在预定时间内实现二分一致性.通过Lyapunov稳定性理论、代数图论和矩阵分析等验证算法的准确性;仿真对比实验验证了所提算法的可行性和有效性;相较于有限时间控制算法,所提算法的收敛时间不依赖于初始状态,可以通过选择单一时间参数设定系统收敛时间上界;相较于固定时间控制算法,所提算法预设收敛时间与控制算法参数无关,设定简单,具有更低的保守性.     

基于事件触发的离散多智能体二分一致性

针对一阶离散多智能体系统,研究了事件触发控制下的二分一致性问题.首先考虑智能体间通信拓扑结构为无向连通结构平衡图的情形,针对各智能体设计事件触发控制,包括仅依赖于自身及邻居智能体采样状态的控制输入,以及仅依赖自身状态的事件触发条件,实现了对通信资源的节约利用.基于图论、离散系统稳定性理论,证明系统能够实现二分一致性.同时,合理设置控制输入及事件触发条件中参数,保证系统不存在Zeno现象.之后,进一步分析设计了包含有向生成树的结构平衡图下,多智能体系统的事件触发控制.最后利用仿真实例验证了理论结果的有效性.     

网络攻击下双层结构多智能体系统一致性

研究了遭受网络攻击的双层结构多智能体系统的一致性问题.针对包含领导层和跟随者层的双层网络结构的多智能体系统,考虑了如下情况:领导层相邻智能体之间为友好合作关系,跟随者层相邻智能体之间既包含友好合作也包含对抗竞争关系,同时领导层与跟随者层中部分对应智能体之间存在牵制关系.分析了受网络攻击的领导层多智能体系统、跟随者层多智...     

多智能体系统基于自适应控制下的二分-分量一致性

二分-分量一致性是指网络系统中部分具有相似特性智能体的某些分量随时间推移趋于相同的值,而剩余智能体的某些分量则随时间趋于相反的值,是一种弱于恒同一致和二分一致的动力学行为.为此,对符号网络上非线性多智能体系统的二分-分量一致性问题展开研究.首先,针对多智能体系统中各智能体之间存在的合作关系或竞争关系,设计有效的自适应牵制控制器;随后,基于Lyapunov稳定性理论和矩阵理论,导出该非线性系统二分-分量一致性得以实现的充分条件;最后,通过数值模拟验证理论结果.     

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

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

Leader-following consensus of multi-agent systems under fixed and switching topologies

The leader-following consensus problem of higher order multi-agent systems is considered. In the system, the dynamics of each agent and the leader is a linear system. The control of each agent using local information is designed and detailed analysis of the leader-following consensus is presented for both fixed and switching interaction topologies, which describe the information exchange between the multi-agent systems. The design technique is based on algebraic graph theory, Riccati inequality and Lyapunov inequality. Simulations indicate the capabilities of the algorithms.     

Nonlinear finite-time bipartite consensus protocol for multi-agent systems associated with signed graphs

In this paper, finite-time multi-agent consensus problems are considered under networks associated with signed graphs whose edge weights can be not only positive but also negative. A nonlinear consensus protocol is proposed to guarantee the states of all agents to converge in a finite time. If the signed graph is structurally balanced, then the final consensus states of all agents are the same in modulus but not in sign. Otherwise, if the signed graph is structurally unbalanced, then the states of all agents converge to zero. Moreover, the final consensus states of agents can be provided uniformly regarding a signed-average quantity that depends on both the initial states of agents and the topology structure of the whole multi-agent network. Numerical simulations illustrate that the protocol is effective in achieving the finite-time consensus of agents under signed graphs and can particularly solve the finite-time average consensus problem of agents when their associated graph has all positive edge weights.     

Leader-following scaled consensus of second-order multi-agent systems under directed topologies

ABSTRACT

This paper investigates the leader-following scaled consensus problem of second-order multi-agent systems under directed topologies. Three novel leader-following scaled consensus protocols are designed. First, a novel scaled consensus protocol is proposed. It can guarantee the velocity of each agent in one sub-group exactly follow that of a leader, and the follower agents achieve scaled consensus. Second, another proposed protocol enables the agents' positions and velocities of one sub-group accurately track those of a leader, and the follower agents achieve scaled consensus. Third, consider the case where the leader's states available to one or multiple followers and the leader travels with a varying velocity, a novel scaled consensus tracking protocol is proposed. Sufficient and necessary conditions are obtained to guarantee scaled consensus tracking for the three cases,respectively. Finally, simulation examples are made to verify the effectiveness of the theoretical results.     

二阶非线性多智能体系统领导跟随一致性研究

为减少通信时延对系统一致性的影响,针对有领导者的二阶非线性多智能体系统的领导跟随一致性进行了研究,新颖的提出近似随机脉冲时延的概念并应用于新协议。相比于传统协议,新协议在脉冲时刻通信时延较小时,各智能体基于时延态对自身当前时刻状态进行预测,并以自身未来预测状态取代时延态发送给各邻接智能体同时补偿自身反馈通道时延,从而使系统更快实现一致性。基于Lyapunov稳定性理论,利用一类再推广的Halanay不等式的性质给出两个保证系统实现一致性的充分条件。最后,实例仿真证明了新协议的优越性。     

线性多智能体系统在固定和切换拓扑下的领航跟随控制

研究线性多智能体系统的领航跟随一致性问题. 假设每个多智能体系统只能得到其邻域的输出测量信息, 在此条件下, 讨论多智能体在有向固定网络拓扑和无向切换网络拓扑两种情况下的一致性问题. 针对这两种情况, 提出含有一种分布式观测器的一致性控制算法. 应用Lyapunov 稳定性理论证明了若单个多智能体系统是可镇定和可检测的, 且网络连接拓扑只需满足简单的结构, 则系统能够达到领航跟随一致性. 仿真结果验证了理论分析的正确性.     

Leader-following consensus of single-integrator multi-agent systems under noisy and delayed communication

This paper proposes a leader-following consensus control for continuous-time single-integrator multi-agent systems with multiplicative measurement noises and time-delays under directed fixed topologies. Each agent in the team receives imprecise information states corrupted by noises from its neighbours and from the leader; these noises are depending on the agents’ relative states information. Moreover, the information states received are also delayed by constant or time-varying delays. An analysis framework based on graph theory and stochastic tools is followed to derive conditions under which the tracking consensus of a constant reference is achieved in mean square. The effectiveness of the proposed algorithms is proved through some simulation examples.     

事件触发机制下的多智能体领导跟随一致性

研究了一类具有动态领导者的一阶多智能体系统的一致性问题。基于事件触发机制给出两种一致性协议,即集中式触发控制协议和分散式触发控制协议。利用李雅普诺夫稳定性理论和模型转化方法分别给出多智能体系统在两种协议作用下达到领导跟随一致的充分条件。同时,理论计算表明,系统在两种控制协议下均不存在Zeno行为。实例仿真结果验证了理论方案的有效性。     

Leader-following consensus for uncertain second-order nonlinear multi-agent systems

This paper studies the leader-following consensus problem for a class of second-order nonlinear multi-agent systems subject to linearly parameterized uncertainty and disturbance. The problem is solved by integrating the adaptive control technique and the adaptive distributed observer method. The design procedure is illustrated by an example with a group of Van der Pol oscillators as the followers and a harmonic system as the leader.     

Leader-following consensus of linear discrete-time multi-agent systems subject to jointly connected switching networks

In this paper, we further study the leader-following consensus problem for a class of linear discrete-time multi-agent systems subject to jointly connected switching digraphs. We first establish a stability result for a class of linear switched systems under a more relaxed assumption than those in the literature. Then, we apply this stability result to obtain the solution to our problem, which contains previous results as special cases. Finally, we apply our result to an example that cannot be handled by any existing result.