网络化拉格朗日系统协调跟踪控制: 算法与实验

针对参数不确定条件下的网络化拉格朗日系统,提出了一种基于Lyapunov理论的分布式自适应协调控制器设计方法.区别于现有的网络化拉格朗日系统控制方法,本文的方法适用于更广泛的有向通信拓扑系统,即只要求通信拓扑包含一棵具有动态领导节点的生成树.进一步考虑邻节点系统的速度信息未知的情形,提出一种基于分布式滤波器的自适应协调跟踪控制方法.最后,给出了一个网络化多机械臂实验平台,进行了实验研究,验证了算法的有效性.     

有向拓扑下网络化运动控制系统的容侵同步控制

摘 要: 针对有向通信拓扑下网络化多轴运动控制系统收到网络攻击威胁及未建模不确定性影响,其轨迹同步控制精度迅速下降,提出了一种基于分布式中间观测器的容侵同步控制方法。首先将非线性未建模不确定性分解成控制通道匹配分量和不匹配分量,进而将攻击、领航者的参考输入和非线性匹配部分合并成一个组合未知输入信号,通过设计分布式中间观测器对跟踪误差系统的状态、组合未知输入信号进行估计并设计容侵同步控制协议。利用李雅普诺夫函数证明跟踪误差系统稳定性。网络化多轴运动控制系统的实验结果表明所提方法能够保证系统具有良好的容侵同步控制性能,并且能够通过调节特定参数确保跟踪误差系统对于不匹配非线性不确定性的鲁棒性。     

多智能体一致性预测控制算法及其仿真研究

离散多智能体系统的一致性问题是复杂动态大系统中重要问题,对收敛速度更是研究的重点.设计了一种适用于任意无向连通结构的多智能体一致性预测控制算法μ-MPC,提高智能体的一致性收敛速度并扩展了离散系统采样步长的取值范围,增强了系统的稳定性.在一定理论分析的基础上,通过大量的仿真实例和与经典模型的比较,研究了算法在固定拓扑和切换拓扑系统中的快速性和鲁棒性.特别对于全连通结构系统有一定的参考价值.     

网络环境下固定拓扑的多电机领航跟随控制

基于多智能体一致性理论,从领航跟随控制的角度解决网络环境下多电机的同步控制问题,其中考虑了网络时延对同步控制的影响。每个电机均被视为一个智能体,且每个智能体能且只能得到其邻域的输出测量信息,在此条件下,研究了在有向固定网络拓扑情况下多电机系统的同步控制问题。为了解决网络时延对电机同步控制的影响,提出了一种带有分布式观测器的时延一致性控制协议,应用 Lyapunov稳定性理论证明了若单个电机是能观能控的,只要网络连接满足简单的拓扑结构,则多电机系统能够达到领航跟随一致性。最后通过仿真实验验证了该方法的正确性和有效性。     

离散异质多智能体系统的分组一致性控制

针对一类混合异质多智能体系统的分组一致性控制问题进行了研究。具体分析了由一阶智能体和二阶智能体组成的混合异质系统,研究其在离散情况下的分组一致性。基于两个合理的假设提出了线性控制协议,运用代数图论、稳定性理论和矩阵理论,分析协议作用下闭环系统的系统矩阵及动态特性,取得了系统渐近实现分组一致性的充分条件,该条件与系统拓扑结构、采样周期以及控制参数有关。结论同时适用于有向拓扑与无向拓扑,最后通过仿真实例对所得分析结果进行了验证。     

基于RTX的分布式平台级仿真系统设计与实现

研究平台级仿真训练系统,广泛应用于武器装备试验评估领域中,平台级仿真包含实体数多、交互信息复杂.如果有人或硬件在回路,则需实现实时运行.如果采用分布式结构,还需实现时钟同步.为了解决实体间复杂信息交互、强实时运行和时钟同步控制等问题,提出参照HLA的数据交互机制和时间推进机制设计了平台级仿真系统框架,并采用流行的Win-dows+RTX平台开发了仿真系统软件.经时间测试,设计的仿真系统满足微秒级的定时精度和死线(dead-line)要求.仿真表明,设计方法适用于平台级、多仿真实体交互,为强实时推进的分布式实时仿真系统构建提供了参考.     

基于部分稳定性方法的离散时间多智能体系统的一致性

研究有向信息拓扑下离散时间线性多智能体系统的一致性分析与设计问题.利用提出的线性变换,将一致性问题转换为相应线性系统的部分变元渐近稳定性问题.基于部分变元稳定性理论,得到有向信息拓扑下离散时间线性多智能体系统达到渐近一致的基于矩阵Schur稳定性的充要条件和状态一致函数的解析表达式.同时设计了反馈增益矩阵.最后数值实例验证了所得理论的有效性.     

异构多无人机网络化协同控制系统的可控性

研究具有Leader-Follower结构和分布式通信拓扑的异构多无人机网络化分布式协同控制系统的可控性问题. 基于同构网络的受控一致性思想建立了异构多飞行器网络控制系统的动态模型; 并针对该动态模型的不同形式, 基于代数图论和传统的控制理论, 分别得到了异构多无人机网络化协同控制系统的可控性条件, 尤其是可控性与该网络化系统中通信拓扑之间的关系; 然后分析且提出了改善系统可控性的可行性方法. 最后仿真结果验证了本文相关结论的正确性.     

基于一致性理论的多臂航天器协同控制方法

针对空间中自由漂浮多臂航天器的多臂协同问题,提出一种基于一致性理论的协同控制方法,采用有向通信拓扑与广义雅克比矩阵结合的方式,实现自由漂浮航天器多机械臂间的协同.首先,建立多机械臂间的通信关系有向图,确定“领导-跟随”体系下的主臂与从臂;其次,基于有向通信拓扑,进行主从臂末端运动规划,实现主臂运动向从臂的传递;再次,利用广义雅克比矩阵在动量守恒条件下进行末端运动向关节运动的映射,并基于一致性理论设计关节空间内的多臂协同运动控制器;最后,基于李雅普诺夫稳定性理论证明控制器的稳定性,并分析位置控制误差.仿真结果表明,所提出的控制方法可以实现多臂航天器系统空间操控任务中各机械臂的聚集、跟踪与位置协同.     

基于梯度估计的多智能体系统有限时间分布式优化

现有多智能体系统分布式优化算法大多具有渐近收敛速度,且要求系统的网络拓扑图为无向图或有向平衡图,在实际应用中具有一定的保守性.本文研究了具有强连通拓扑的多智能体系统有限时间分布式优化问题.首先,基于非光滑分析和Lyapunov稳定性理论设计了一个有限时间分布式梯度估计器.然后,基于该梯度估计器提出了一种适用于强连通有向图的有限时间分布式优化算法,实现了多智能体系统中智能体的状态在有限时间内一致收敛到全局最优状态值.与现有的有限时间分布式优化算法相比,新提出的有限时间优化算法适用于具有强连通拓扑的多智能体系统,放宽了系统对网络拓扑结构的要求.此外,本文基于Nussbaum函数方法对上述优化算法进行了拓展解决了含有未知高频增益符号的多智能体系统分布式优化问题.最后,通过仿真实例对提出的分布式优化算法的有效性进行了验证.     

积分事件触发策略下的线性多智能体系统领导跟随一致性

研究有向切换拓扑下线性多智能体系统的事件触发一致跟踪问题.大多数已有的工作研究了固定拓扑下的事件触发控制,然而,当智能体间联系随时间发生改变或通信拓扑随时间发生变化时,该控制策略失效.鉴于此,在考虑切换拓扑的基础上提出一种基于积分型事件触发的控制策略.首先,当拓扑图包含一棵生成树且领导者是根节点时,利用Lyapunov稳定性理论、代数图论和矩阵变换,基于积分型事件触发控制协议,在切换拓扑下多智能体系统达到领导跟随一致性;然后,当存在多个领导者时,基于设计的触发机制在切换拓扑下多智能体系统实现包含控制,上述两种情况下闭环系统均不存在Zeno现象;最后,通过仿真结果验证控制策略的有效性.     

Leader-following control of multiple nonholonomic systems over directed communication graphs

This paper considers the leader-following control problem of multiple nonlinear systems with directed communication topology and a leader. If the state of each system is measurable, distributed state feedback controllers are proposed using neighbours’ state information with the aid of Lyapunov techniques and properties of Laplacian matrix for time-invariant communication graph and time-varying communication graph. It is shown that the state of each system exponentially converges to the state of a leader. If the state of each system is not measurable, distributed observer-based output feedback control laws are proposed. As an application of the proposed results, formation control of wheeled mobile robots is studied. The simulation results show the effectiveness of the proposed results.     

Leader-following consensus of multi-agent systems under directed communication topology via distributed adaptive nonlinear protocol

In this paper, we study the leader-following consensus problem of general linear multi-agent systems under directed communication topology. To avoid using any global information, an adaptive nonlinear protocol is proposed based only on the relative state information. It is proved that, for any directed communication graph that contains a spanning tree with the root node being the leader agent, the proposed control law solves the leader-following consensus problem. A numerical example is provided to illustrate the effectiveness of the theoretical results.     

Consensus of single integrator multi-agent systems with directed topology and communication delays

In this paper, a distributed control scheme has been developed for consensus of single integrator multi-agent systems with directed fixed communication topology for arbitrarily large constant, time-varying or distributed communication delays. It is proved that the closed loop control system can reach consensus with an exponential convergence rate if and only if the topology is quasi-strongly connected. Simulation results are also provided to demonstrate the effectiveness of the proposed controller.     

Integral-based event-triggered control for multi-agent systems with general linear dynamics

ABSTRACT

This paper proposes an integral-based event-triggered control strategy to solve the consensus problem of multi-agent systems with general linear dynamics. We first consider the leader-following consensus problem where the communication topology has a directed spanning tree with the leader as the root. It is proved that under the proposed strategy leader-following consensus is guaranteed and the inter-event intervals are lower bounded by positive constants. Then, the leaderless consensus problem of multi-agent systems is investigated under directed topology. We show that consensus is achieved and no Zeno behaviour occurs. Simulation results verify the effectiveness of the obtained results.     

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.     

Reduced-Order Observer-Based Leader-Following Formation Control for Discrete-Time Linear Multi-Agent Systems

Formation control of discrete-time linear multi-agent systems using directed switching topology is considered in this work via a reduced-order observer, in which a formation control protocol is proposed under the assumption that each directed communication topology has a directed spanning tree. By utilizing the relative outputs of neighboring agents, a reduced-order observer is designed for each following agent. A multi-step control algorithm is established based on the Lyapunov method and the modified discrete-time algebraic Riccati equation. A sufficient condition is given to ensure that the discrete-time linear multi-agent system can achieve the expected leader-following formation. Finally, numerical examples are provided so as to demonstrate the effectiveness of the obtained results.      

Distributed leader-following consensus for second-order multi-agent systems with nonlinear inherent dynamics

In this paper, the leader-following consensus problem for second-order multi-agent systems with nonlinear inherent dynamics is investigated. Two distributed control protocols are proposed under fixed undirected communication topology and fixed directed communication topology. Some sufficient conditions are obtained for the states of followers converging to the state of virtual leader globally exponentially. Rigorous proofs are given by using graph theory, matrix theory and Lyapunov theory. Simulations are also given to verify the effectiveness of the theoretical results.     

Consensus reaching in multi-agent packet-switched networks with non-linear coupling

An important task for multi-agent systems (MAS) is to reach a consensus, e.g. to align their velocity vectors. Recent results propose appropriate consensus protocols to achieve such tasks, but most of them do not consider the effect of communication constraints such as the presence of time-delays in the exchange of information between the agents. In this article, we provide conditions for a non-linear, locally passive MAS of arbitrary size to reach a consensus, when the agents communicate over a packet-switched network that is characterised by a given topology. Both the cases of constant and switching topologies are considered. The nature of the communication channel imposes constraints that are modelled using stochastic delays of arbitrary distribution. We first embed this model in another, distributed but deterministic delay model and provide conditions for the error introduced by this simplification. In our main result, we provide conditions for the locally passive MAS with distributed delays to reach a consensus. In the case of a fixed topology, the underlying directed graph has to contain a spanning tree. In the case of a switching topology, only the union graph of all graphs that persist over time is required to contain a spanning tree. These conditions are independent of the distribution and the size of the packet delays. To show attractivity of the consensus set, we use an invariance principle for systems described by functional differential equations based on an appropriate Lyapunov–Razumikhin function. This methodological approach is the main contribution of this work and can also be applied to other consensus problems with delays. We illustrate our results by numerical simulations showing synchronisation of non-linear Kuramoto oscillators over a digital network.     

Consensus of networked multi-agent systems with communication delays based on the networked predictive control scheme

The consensus problem of discrete-time networked multi-agent systems (NMASs) with a communication delay is investigated in this article, where the dynamics of agents described by discrete-time linear time-invariant systems can be either uniform or non-uniform. For the NMASs with a directed topology and constant delay, a novel protocol based on the networked predictive control scheme is proposed to compensate for communication delay actively. Using algebraic graph theories and matrix theories, necessary and/or sufficient conditions of achieving consensus are obtained, which indicates that, under the proposed protocol, the consensus is independent of the network delay and only dominated by agents' dynamics and communication topology. Meanwhile, the protocol design and consensus analysis are also presented in the case of no network delay. Simulation results are further presented to demonstrate the effectiveness of theoretical results.