Adaptive iterative learning control for coordination of second‐order multi‐agent systems

In this paper, an efficient framework is proposed to the consensus and formation control of distributed multi‐agent systems with second‐order dynamics and unknown time‐varying parameters, by means of an adaptive iterative learning control approach. Under the assumption that the acceleration of the leader is unknown to any follower agents, a new adaptive auxiliary control and the distributed adaptive iterative learning protocols are designed. Then, all follower agents track the leader uniformly on [0,T] for consensus problem and keep the desired distance from the leader and achieve velocity consensus uniformly on [0,T] for the formation problem, respectively. The distributed multi‐agent coordinations performance is analyzed based on the Lyapunov stability theory. Finally, simulation examples are given to illustrate the effectiveness of the proposed protocols in this paper.Copyright © 2013 John Wiley & Sons, Ltd.     

异构集群系统分布式自适应输出时变编队跟踪控制

提出了一种能够解决高阶异构集群系统输出时变编队跟踪问题的控制方法. 集群系统中的智能体分为领导者和跟随者, 领导者和跟随者的动力学模型可以完全不同. 跟随者的输出在跟踪领导者输出的同时保持时变编队实现协同运动. 考虑了领导者存在已知或未知控制输入、领导者和跟随者均存在未知扰动、有向通信拓扑存在切换等多种因素并存的情况, 结合观测器理论、自适应控制理论和滑模控制理论设计了完全分布式的输出时变编队跟踪控制协议, 摆脱了对领导者控制输入上界值、与通信拓扑相关的拉普拉斯矩阵的特征值以及时变编队函数等全局信息的依赖. 利用Lyapunov理论证明了在有向拓扑切换条件下异构集群系统的闭环稳定性. 最后通过数值仿真对理论结果的有效性进行了验证.     

Stochastic consensus of single‐integrator multi‐agent systems under relative state‐dependent measurement noises and time delays

This paper proposes a consensus algorithm for continuous‐time single‐integrator multi‐agent systems with relative state‐dependent measurement noises and time delays in directed fixed and switching topologies. Each agent's control input relies on its own information state and its neighbors' information states, which are delayed and corrupted by measurement noises whose intensities are considered a function of the agents' relative states. The time delays are considered time‐varying and uniform. For directed fixed topologies, condition to ensure mean square linear χ‐consensus (average consensus, respectively) are derived for digraphs having spanning tree (balanced digraphs having spanning tree, respectively). For directed switching topologies, conditions on both time delays and dwell time have been given to extend the mean square linear χ‐consensus (average consensus, respectively) of fixed topologies to switching topologies. Copyright © 2016 John Wiley & Sons, Ltd.     

端口受控哈密顿多智能体系统的输出一致性协议设计

研究了端口受控哈密顿（PCH）多智能体系统分别在固定和切换拓扑下的输出一致性问题. 首先根据哈密顿系统特有的优势,运用能量整形思路设计了一个全局稳定的群组输出一致性协议,该协议通过构造虚拟邻居的方式将有向图转化成无向图. 其次通过利用推广的LaSalle's不变原理将切换拓扑的问题转化成切换系统来研究. 例子证明,本文很好的解决端口受控哈密顿（PCH）多智能体系统的输出一致性问题.     

端口受控哈密顿多智能体系统的输出一致性协议设计（英文）

This paper investigates the output consensus problem of port-controlled Hamiltonian(PCH) multi-agent systems with both fixed and switching topologies. Firstly, a distributed group output consensus protocol is designed via the energy shaping method to reach globally stability and group output consensus. Secondly, a new distributed control protocol is proposed by using the structural properties of the PCH systems. The advantage of this protocol is that it can transform the directed graph to the undirected graph by constructing a kind of virtual neighbors. Thirdly, a control protocol is designed with the extended LaSalle s invariance principle developed for switched systems under the jointly connected topology condition to make all the agents reach output consensus when the topology is switching. Finally, some illustrative examples with simulations are provided to demonstrate the effectiveness of the protocols designed in this paper.     

Time‐varying output formation control for linear multi‐agent systems with switching topologies

Time‐varying output formation control problems for linear multi‐agent systems with switching topologies are studied, where two types of switching topologies are considered: (1) the topology is undirected and jointly connected, and 2) each topology is directed and has a spanning tree. An output formation protocol under switching topologies is constructed using the outputs of neighboring agents via dynamic output feedback. Two algorithms are proposed to design the dynamic protocols under both jointly connected topologies and switching directed topologies. Time‐varying output formation feasibility conditions are given to describe the compatible relationship among the desired time‐varying output formation, the dynamics of each agent, and the switching topologies. The stability of the closed‐loop multi‐agent systems under the proposed two algorithms is investigated based on the common Lyapunov functional theory and the piecewise Lyapunov functional theory, respectively. In the case where the topologies are jointly connected, time‐varying output formation can be achieved for multi‐agent systems using the designed protocol if the given time‐varying output formation satisfies the feasible constraint. For the case where the switching topologies are directed and have a spanning tree, the time‐varying output formation can be realized if the output formation feasibility constraint is satisfied and the dwell time is larger than a positive threshold. Moreover, approaches to determine the output formation references are provided to describe the macroscopic movement of the time‐varying output formation. Finally, numerical simulation results are presented to demonstrate the effectiveness of the theoretical results. Copyright © 2016 John Wiley & Sons, Ltd.     

Flocking Algorithms in Networks with Directed Switching Velocity Interaction Topologies

This paper studies flocking algorithms for multi‐agent systems with directed switching velocity interaction topologies. It is assumed that the position information of each agent is available for agents within its neighborhood region of radius r, however, they communicate the velocity information between each other through unidirectional links modeled by a particular class of directed topologies. A new energy function is defined to analyze the global stability and a sufficient condition is derived for asymptotic flocking in the face of switching topologies. The proposed control strategy guarantees the achievement of desired formations, while avoiding collisions among agents. It also ensures velocity agreement under suitable conditions in a variety of real networks with greatly reduced velocity data exchange. Moreover, a leader‐follower framework is formulated for the described class of interaction topologies and it is shown that a more relaxed condition is required to achieve the desired performance. Finally, several simulations are performed to illustrate and confirm the theoretical results obtained.     

Distributed consensus filter on directed switching graphs

We consider distributed estimation on a directed graph with switching topologies. Motivated by a recent PI consensus filter, we modify the protocol and remove the requirement of bidirectional exchange of neighboring gains for fixed topologies. We then extend the protocol to switching topologies and propose a new hybrid consensus filter design. Convergence results under both balanced directed, and general directed graphs are given for switching graphs. Consensus error bounds are analytically derived in the case of time‐varying inputs. Satisfactory simulation results are shown. Copyright © 2014 John Wiley & Sons, Ltd.     

Observer‐based consensus control of nonlinear multiagent systems under semi‐Markovian switching topologies and cyber attacks

This article investigates the leader‐following consensus of nonlinear multiagent systems under semi‐Markovian switching topologies and cyber attacks. Unlike the related works, the communication channels considered herein are subjected to successful but recoverable attacks, and when the channels work well, the network topology is time‐varying and described by a semi‐Markovian switching topology. Due to the effect of attacks, the communication network is intermittently paralyzed. For the cases that the transition rates of semi‐Markovian switching topologies are completely known and partially unknown, observer‐based control protocols and sufficient conditions are proposed, respectively, to ensure the consensus of the systems in the mean square sense. Finally, simulation examples are given to illustrate the validity of the theoretical results.     

Discrete‐Time Consensus Filters for Average Tracking of Time‐Varying Inputs on Directed Switching Graphs

In this paper, we consider discrete‐time distributed estimation on a directed graph with switching topologies. Motivated by a recent PI consensus filter, we modify the protocol and remove the limitation of undirected graph and gain conditions with requirement for global topological information. The protocol is then extended to switching topologies. Convergence analysis is conducted for constant inputs under both balanced directed and general directed graphs with topological switching. Then, the result is extended to all cases for time‐varying inputs with an analytical derivation of the error bound. Satisfactory simulation results are shown to validate theoretical claims.     

Robust containment of uncertain linear multi‐agent systems under adaptive protocols

In this paper, robust containment problem is investigated for a class of multi‐leader multi‐agent linear systems in the presence of time‐varying uncertainties. To achieve containment, a new kind of adaptive containment protocols are proposed for the multi‐agent systems. Specifically, the designed protocols consist of a continuous linear term and a discontinuous term. The linear term of the designed protocol is employed to achieve containment while the discontinuous term is utilized to eliminate the effect of uncertain dynamics on the achievement of containment. By using tools from non‐smooth analysis and algebraic graph theory, some efficient criteria for achieving robust containment in the closed‐loop multi‐agent systems are obtained and analyzed. One favorable property of the designed protocol is that containment in the closed‐loop multi‐agent systems can be achieved in a fully distributed fashion over any given connected and detail‐balanced communication graph without using any global information about the communication graph. The effectiveness of the analytical results is finally verified by performing numerical simulations. Copyright © 2016 John Wiley & Sons, Ltd.     

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 formation control of multiagent systems on the Lie group SE(3)

This paper addresses the robust formation control problem of multiple rigid bodies whose kinematics and dynamics evolve on the Lie group SE(3). First, it is assumed that all followers have access to the state information of a virtual leader. Then, a novel adaptive super‐twisting sliding mode control with an intrinsic proportional‐integral‐derivative sliding surface is proposed for the formation control problem of multiagent system using a virtual structure (VS) approach. The advantages of this control scheme are twofold: elimination of the chattering phenomenon without affecting the control performance and no requirement of prior knowledge about the upper bound of uncertainty/disturbance due to adaptive‐tuning law. Since the VS method is suffering from the disadvantages of centralized control, in the second step, considering a network as an undirected connected graph, we assume that only a few agents have access to the state information of the leader. Afterward, using the gradient of modified error function, a distributed adaptive velocity‐free consensus‐based formation control law is proposed where reduced‐order observers are introduced to remove the requirements of velocity measurements. Furthermore, to relax the requirement that all agents have access to the states of the leader, a distributed finite‐time super‐twisting sliding mode estimator is proposed to obtain an accurate estimation of the leader's states in a finite time for each agent. In both steps, the proposed control schemes are directly developed on the Lie group SE(3) to avoid singularity and ambiguities associated with the attitude representations. Numerical simulation results illustrated the effectiveness of the proposed control schemes.     

2阶多智能体网络在切换拓扑下的群一致性

针对2阶多智能体网络的群一致性问题,提出了基于牵引控制方法的群一致性协议.考虑到网络模型具有切换拓扑结构,在模型中引入相应的虚拟领导者.对于网络中的每一个智能体,其一致性协议依赖于智能体邻居的状态及速度信息,并受到虚拟领导者的牵引控制;进一步地,来自虚拟领导者的牵引控制可以随时间发生变换.利用代数图论、线性矩阵不等式和李亚普诺夫稳定性理论,对网络进行群一致性分析,给出了切换拓扑下2阶多智能体网络达到群一致性的充分条件.最后,数值仿真验证了理论结果的有效性.     

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

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

无速度输入多智能体系统的一致性

本文研究了有无引导者的多智能体系统在非线性协议下的一致性问题.当智能体速度信息无法获知时,分别针对有无引导者的多智能体系统设计了包含辅助系统和智能体相对位移信息的非线性分布式协议.借助图论、Lyapunov稳定性理论、Barbalat引理等方法,推导出有无引导者的多智能体系统在连通无向通讯网络中实现一致的充分条件,其次,设计了一种新的能使引导–追随者多智能体系统在有向通讯网络中实现期望一致的协议.最后,数值仿真验证了结果的正确性.     

具有时滞的混合阶多智能体系统的组一致性

针对由离散时间一阶和二阶智能体组成的混合阶多智能体系统,研究其在固定和切换拓扑结构下受通信时滞影响时的组一致性问题。分别为两类智能体提出组一致性协议,引入模型变换,将闭环系统转化为等价系统。在一定假设条件下,以代数图论、矩阵理论为主要研究工具,分别在固定和切换拓扑结构下给出了混合阶多智能体系统实现渐近组一致性的条件。采用数值仿真对所得结果的有效性进行了验证。     

Nonlinear formation control strategies for agents without relative measurements under heterogeneous networks

This paper proposes cooperative control protocols for a group of unmanned vehicles to make a stable formation around a maneuvering target. The control protocols are proposed on the basis of heterogeneous communication networks, which represents more challenging and generalized situations. Two different scenarios are considered. Separate control protocols are developed for each case. In both scenarios, agents do not have relative position, velocity, and acceleration measurements as feedback. In the first scenario, each agent uses its own position and velocity measurement in a consensus algorithm. In the second scenario, each agent needs only its own position information for the consensus algorithm. For both protocols, agents compute virtual estimates of a target's position and velocity and exchange these among the neighbors. Three different communication networks are used for exchanging two virtual estimates calculated by each agent and a time derivative of one virtual estimate. Each interagent communication network is represented by a fixed, undirected, and connected graph. Furthermore, it is considered that at least one agent receives the position, velocity, and acceleration information of the maneuvering target. It is not necessary that the agent receiving the target's position and the agent receiving the velocity and/or the acceleration information of the target be the same. However, the target does not receive any information about any agent. Stability of the formation is analyzed by using Barbalat's lemma. It is also shown that, despite the large difference in received information, the acceleration of the agents remains bounded for all time. The performance of the proposed formation control protocols is illustrated through numerical simulations.     

Distributed Adaptive Dynamic Surface Control for Synchronization of Uncertain Nonlinear Multi-agent Systems

In this paper a distributed adaptive dynamic surface controller is proposed for multi-agent systems under fixed directed graph topologies. The agents have uncertain nonlinear dynamics and are influenced by bounded unknown disturbances. The controller should synchronize the states of all agents with the corresponding states of the nonautonomous leader. It is proved that, with the proposed controller, the synchronization error remains bounded; and the bounds can be arbitrarily decreased by increasing the controller gains. The control rules are designed such that each agent only requires the state information of its neighbors, rendering a distributed control. The effectiveness of the proposed method is demonstrated through two simulation examples.     

Distributed consensus of delayed multi‐agent systems with nonlinear dynamics via intermittent control

In this paper, a distributed consensus of delayed multi‐agent systems with a leader is investigated, and a nonlinear protocol is proposed based on intermittent control. A notable feature of this protocol is to address second‐order consensus problems for delayed nonlinear multi‐agent systems, where agents can only communicate with each other over some disconnected time intervals. Some sufficient conditions to guarantee the consensus over fixed and switching topologies are derived. It is shown that second‐order consensus for delayed multi‐agent system with intermittent control can be achieved if the time delay is less than a critical value and the communication time duration is larger than a threshold value. In addition, some numerical examples are given to illustrate the effectiveness and feasibility of the theoretical results.