非仿射非线性多智能体系统迭代学习一致跟踪

为了解决非仿射非线性多智能体系统在给定时间区间上一致性完全跟踪问题,基于迭代学习控制方法设计一种分布式一致性跟踪控制算法.首先,由引入的虚拟领导者与所有跟随者组成多智能体系统的通信拓扑,其中虚拟领导者的作用是提供期望轨迹.然后,在只有部分跟随者能够获得领导者信息的条件下,利用每个跟随者及其邻居的跟踪误差构造每个跟随者的迭代学习一致性跟踪控制器.同时采用中值定理将非仿射非线性多智能体系统转化仿射形式,并基于压缩映射方法证明所提算法的收敛性,给出算法的收敛条件.理论分析表明,在智能体的非线性函数未知情况下,利用所提算法可以使非仿射非线性多智能体系统在给定时间区间上随迭代次数增加逐次实现一致性完全跟踪.最后,通过仿真算例进一步验证所提算法的有效性.     

数据丢包下事件驱动的非线性多智能体迭代学习控制

针对具有随机链路丢包、通信带宽受限以及模型未知的非线性多智能体一致性问题, 提出一种事件驱动的分布式无模型迭代学习控制策略. 首先建立系统的事件驱动决策机制, 给出基于输出信息的通信触发条件, 当该条件满足时触发事件, 各智能体间进行通信, 不满足条件时则不通信, 从而能够有效减少智能体间的大量通信和能量耗散. 其次, 使用伪偏导数将非线性系统沿迭代轴动态线性化, 借助邻居在前一步事件触发时的输出信息设计随机链路丢包补偿机制, 再结合事件驱动通信机制设计分布式控制协议. 在此基础上, 使用压缩映射原理分析算法收敛性能, 仿真结果表明随着迭代次数的增加, 事件触发间隔变大, 所有的智能体将完成对期望轨迹的跟踪.     

离散时变多智能体系统有限时间一致性迭代学习控制

针对一类离散时变多智能体系统,通过引入虚拟领导者产生期望轨迹的方法,将虚拟领导者和所有智能体组成固定的拓扑结构,在此基础上,提出一种离散时间迭代学习控制算法.该算法对多智能体系统中的每个智能体都设计一个控制器,各控制器都是利用上一次迭代时,该智能体与虚拟领导者之间的跟踪误差和该智能体与相邻智能体之间的跟踪误差,通过拓扑结构中通信权值的组合不断修正上一次的控制律,从而获得理想控制律.同时,基于范数理论严格证明所提出算法的收敛性,并给出算法在$\lambda$-范数意义下的收敛条件.该算法能够使离散时变多智能体的输出随着迭代次数的增加在有限时间区间内完全跟踪期望轨迹.理论分析和仿真结果都表明了所提出算法的有效性.     

输出饱和多智能体系统的迭代学习趋同跟踪控制

针对带有输出饱和的多智能体系统有限时间趋同跟踪控制问题,提出了一种分布式迭代学习控制算法.首先假设多智能体系统具有固定拓扑结构,且仅有部分智能体可获取到期望轨迹信息.基于输出约束条件构造一致性跟踪误差,在此基础上设计了P型迭代学习控制率.然后采用压缩映射方法给出了一个算法收敛的充分条件,并在理论上证明了跟踪误差的收敛性.最后,将理论结果推广至具有随机切换拓扑结构的多智能体系统中.仿真结果验证了所提出算法的有效性.     

基于迭代学习的多智能体系统分布式跟踪控制

文章考虑了具适多智能体系统的分布式跟踪控制问题。通过设计带有初始学习机制的$P$型和$PD^{\alpha}$ 型迭代学习控制策略求解跟踪问题。具适导数具有良好的性质且可以刻画不同步长的实际数据采样情况。初始学习机制放松了初始值条件且提高了算法实现趋同跟踪的性能。在可重复操作环境和有向通信拓扑的假设下,提出了一种分布式迭代学习方案,通过重复同一轨迹的控制尝试和用跟踪误差修正不满意的控制信号来实现有限时间趋同。严格证明了随着迭代次数增加,提出的$P$型和$PD^{\alpha}$ 型迭代学习控制策略使得所有智能体能渐近跟踪上参考轨迹。两个代表性数值仿真验证了算法的有效性。     

寻找多智能体系统一致性的迭代学习方法

本文利用迭代学习的方法研究了带头结点的多智能体系统的一致性问题.文中分别对单积分多智能体系统和一般的线性多智能体系统提出了迭代学习型的一致性算法.该算法对每一个从节点所设计的分布迭代学习序列可以保证从节点能完全跟随上头结点.假设头结点是全局可达的,对于有向拓扑连接图,给出了智能体达到完全一致的充分条件.最后,仿真实例说明了文中所给方法的有效性.     

初始误差修正的多智能体一致性迭代学习控制

研究了重复运行的分布式多智能体系统在有限时间内的一致性问题。针对具有固定拓扑结构的多智能体系统,在期望轨迹对应的初始状态未知,且系统存在干扰的情况下,引入虚拟领导者技术,提出了一种同时对各智能体的输入和初始状态误差进行迭代修正的分布式学习控制算法。收敛性分析表明,该算法能够消除由于各智能体初始状态和期望轨迹对应的初始状态不同而引起的各智能体输出不能完全跟踪期望轨迹的状况,实现系统在有限时间内的完全跟踪;仿真结果也证明了算法的有效性。     

切换拓扑下测量受限多智能体系统一致性迭代学习控制

针对通信拓扑至少含有一个沿迭代轴的联合生成树且同时沿有限时间轴和无限迭代轴切换的情况,文本研究了存在测量受限的连续线性多智能体系统输出一致性迭代学习控制问题.首先,文章采用迭代学习控制方法设计了一种基于跟随者局部信息的分布式输出一致性协议.然后,给出了系统可解输出一致性问题的两个充分性条件,其中之一可使跟随者实时获取迭代学习增益,避免了全局信息对学习增益设计的影响,且保证了算法的分布式实现.接着,利用λ范数理论和圆盘定理严格证明了所设计算法的收敛性.最后,通过实例仿真验证了所得结论的有效性.     

测量数据丢失的一类非线性系统迭代学习控制

迭代学习控制方法应用于网络控制系统时,由于通信网络的约束导致数据包丢失现象经常发生.针对存在输出测量数据丢失的一类非线性系统,研究P型迭代学习控制算法的收敛性问题.将数据丢失描述为一个概率已知的随机伯努利过程,在此基础上给出P型迭代学习控制算法的收敛条件,理论上证明了算法的收敛性,并通过仿真验证理论结果.研究表明,当非线性系统存在输出测量数据丢失时,迭代学习控制算法仍然可以保证跟踪误差的收敛性.     

Stability of iterative learning control with data dropouts via asynchronous dynamical system

In this paper, the stability of iterative learning control with data dropouts is discussed. By the super vector formulation, an iterative learning control (ILC) system with data dropouts can be modeled as an asynchronous dynamical system with rate constraints on events in the iteration domain. The stability condition is provided in the form of linear matrix inequalities (LMIS) depending on the stability of asynchronous dynamical systems. The analysis is supported by simulations.     

Iterative learning approaches to design finite-time consensus protocols for multi-agent systems

In this paper, the finite-time output consensus problem of multi-agent systems is considered by using the iterative learning control (ILC) approach. Two classes of distributed protocols are constructed from the two-dimensional system point of view (with time step and iteration number as independent variables), and are termed as iterative learning protocols. If learning gains are chosen appropriately, then all agents in a directed graph can be enabled to achieve finite-time consensus with the iterative learning protocols. Moreover, all agents in a directed graph can be guaranteed to reach finite-time consensus at any desired terminal output if the iterative learning protocols are improved by introducing the desired terminal output to some (not necessarily all) of the agents. Simulation results are finally presented to illustrate the performance and effectiveness of our iterative learning protocols.     

Distributed finite-time consensus tracking for nonlinear multi-agent systems with a time-varying reference state

This paper investigates the consensus tracking problem for nonlinear multi-agent systems with a time-varying reference state. The consensus reference is taken as a virtual leader, whose output is only its position information that is available to only a subset of a group of followers. The dynamics of each follower consists of two terms: nonlinear inherent dynamics and a simple communication protocol relying only on the position of its neighbours. In this paper, the consensus tracking problem is respectively considered under fixed and switching communication topologies. Some corresponding sufficient conditions are obtained to guarantee the states of followers can converge to the state of the virtual leader in finite time. Rigorous proofs are given by using graph theory, matrix theory, and Lyapunov theory. Simulations are presented to illustrate the theoretical analysis.     

Robust consensus tracking of a class of second-order multi-agent dynamic systems

In this paper, we study the problem of robust consensus tracking for a class of second-order multi-agent dynamic systems with disturbances and unmodeled agent dynamics. Contrary to previous approaches, we design continuous distributed consensus protocols to enable global asymptotic consensus tracking. Our focus is on consensus protocol design and stability analysis which also leads to the derivation of sufficient conditions for consensus tracking. We first consider the case of undirected information exchange with a symmetric and positive definite information-exchange matrix. We develop an identifier for each agent to estimate the unknown disturbances and unmodeled agent dynamics. Based on the identifier, we develop a consensus tracking protocol to enable global asymptotic consensus tracking using local information obtained from neighboring agents. The closed-loop stability is proven using Lyapunov analysis theory and an invariance-like theorem. We then extend the approach to the case of directed information exchange, whose information-exchange matrix is only of full rank so that the approach for undirected graphs cannot be directly applied. We show that global asymptotic consensus tracking can still be enabled under the new derived sufficient conditions by designing a new identifier, which utilizes the estimated information exchanged from neighboring agents, and constructing a new Lyapunov function. Examples and numerical simulations are provided to validate the effectiveness of the proposed robust consensus tracking method.     

Iterative learning control with input sharing for multi-agent consensus tracking

In this paper, a novel iterative learning control (ILC) scheme with input sharing is presented for multi-agent consensus tracking. In many ILC works for multi-agent coordination problem, each agent maintains its own input learning, and the input signal is corrected by local measurements over iteration domain. If the agents are allowed to share their learned inputs among them, the strategy can improve the learning process as more learning resources are available. In this work, we develop a new type of learning controller by considering the input sharing among agents, which includes the traditional ILC strategy as a special case. The convergence condition is rigorously derived and analyzed as well. Furthermore, the proposed controller is extended to multi-agent systems under iteration-varying graph. It turns out that the developed controller is very robust to communication variations. In the numerical study, three illustrative examples are presented to show the effectiveness of the proposed controller. The learning controller with input sharing demonstrates not only faster convergence but also smooth transient performance.