Flocking of multi‐agent dynamical systems with intermittent nonlinear velocity measurements

In this paper, the problem of flocking control in networks of multiple dynamical agents with intermittent nonlinear velocity measurements is studied. A new flocking algorithm is proposed to guarantee the states of the velocity variables of all the dynamical agents to converge to consensus while ensuring collision avoidance of the whole group, where each agent is assumed to obtain some nonlinear measurements of the relative velocity between itself and its neighbors only on a sequence of non‐overlapping time intervals. The results are then extended to the scenario of flocking with a nonlinearly dynamical virtual leader, where only a small fraction of agents are informed and each informed agent can obtain intermittent nonlinear measurements of the relative velocity between itself and the virtual leader. Theoretical analysis shows that the achieved flocking in systems with or without a virtual leader is robust against the time spans of the agent speed‐sensors. Finally, some numerical simulations are provided to illustrate the effectiveness of the new design. Copyright © 2011 John Wiley & Sons, Ltd.     

二阶多智能体系统量化蜂拥控制

针对在多智能体系统的通信网络中需要对交换信息进行量化的客观情况,研究基于量化信息的二阶多智能体系统蜂拥控制问题。首先,假设多智能体系统采用一致量化器对速度和位置信息进行量化,并且有一个虚拟领导者沿着固定方向匀速运动;然后,设计基于量化信息的多智能体蜂拥控制输入,并利用非平滑系统的Lyapunov稳定性判据和不变集原理证明系统的稳定性;最后,利用Matlab对多智能体系统在二维平面上的蜂拥运动进行仿真实验,仿真结果验证了理论分析的正确性。     

Flocking of multi‐agent nonholonomic systems with unknown leader dynamics and relative measurements

In this paper, we consider the distributed flocking control problem of multi‐agent nonholonomic systems with a virtual leader whose dynamics is unknown; state information is time varying and not available to all agents under both fixed and switching topologies. On the basis of the relative velocity and orientation information of neighboring agents, two distributed discontinuous control protocols are designed for fixed and switching topologies, respectively. By using tools from algebraic graph theory and nonsmooth analysis, the proposed distributed discontinuous control protocols guarantee that the velocities and orientations of the agents exponentially converge to the velocity and orientation of the virtual leader, respectively, while ensuring collision avoidance of the whole group, if the interaction graph among agents is undirected and the virtual leader with bounded time‐varying velocity has directed paths to other agents. Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2017 John Wiley & Sons, Ltd.     

Robust integral of sign of error-based distributed flocking control of double-integrator multi-agent systems with a varying virtual leader

This article investigates the flocking control problem of double-integrator multi-agent systems with a virtual leader subject to unknown external disturbances. A robust integral of sign of error (RISE) based control method is leveraged to design a distributed flocking controller with advantages of zero initial input value and continuous control input. By means of a new second-order differential virtual potential field function, and the navigational feedback from a virtual leader, the proposed flocking controller assures agents of velocity consensus with the virtual leader and a quasi -lattice formation within a circular neighborhood centered on the virtual leader. Moreover, this algorithm guarantees collision avoidance and connectivity preservation of a proximity-induced communication topology. Numerical simulations of the algorithm are provided to illustrate the effectiveness of the proposed flocking algorithm.     

Flocking of multi-agents with time delay

This article consider the flocking of multi-agents with time delay. Both leader free and virtual leader available are considered. For leader free, a set of control laws is proposed, and it is proved that the agent velocities become the same asymptotically, and avoidance of collisions between the agents is ensured. For virtual leader available, a set of control laws that relies on the state information and the external signal is proposed. With the control laws all agents can follow the virtual leader.     

Adaptive Flocking Control with a Minority of Informed Agents

In this paper, we address the flocking problem of multiple dynamic mobile agents with a virtual leader in a dynamic proximity network. To avoid fragmentation, we propose a novel flocking algorithm that consists of both an adaptive controller for followers and a feedback controller for the virtual leader. Based on our algorithm, all agents in the group can form a network, maintain connectivity, and track the virtual leader, even when only a minority of agents have access to the information of the virtual leader. Finally, several convincing simulation results are provided that demonstrate 2‐D flocking of a group of agents using the proposed algorithm.     

A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements

Most existing flocking algorithms rely on information about both relative position and relative velocity among neighbouring agents. In this article, we investigate the flocking problem with only position measurements. We propose a provably-stable flocking algorithm, in which an output vector is produced by distributed filters based on position information alone but not velocity information. Under the assumption that the initial interactive network is connected, the flocking algorithm not only can steer a group of agents to a stable flocking motion, but also can preserve the connectivity of the interactive network during the dynamical evolution. Moreover, we investigate the flocking algorithm with a virtual leader and show that all agents can asymptotically attain a desired velocity even if only one agent in the team has access to the information of the virtual leader. We finally show some numerical simulations to illustrate the theoretical results.     

Flocking coordination using active leader and local information

In this paper coordination of a group of agents by a coordinator agent, called the leader‐agent (LA), is discussed. Agents have identical finite sensing radii and access only the local information. Inter‐agent interactions bring them together as a multi‐agent network system. In a recently proposed flocking algorithm using a virtual leader, it is proved that if a fraction of agents are informed then the center of mass of the multi‐agent system tracks the virtual leader. The minimum number of the fraction is always greater than one. In this paper the only informed agent is the LA. Interaction functions are defined to make the model of the multi‐agent system suitable for the design of the coordination control algorithm. The leader‐agent accesses its local data and actively plans its motions through a nonlinear control method. It is proven in this paper that the multi‐agent system tracks the virtual leader and a locally defined point near the LA converges to the position of the virtual leader. It is also shown that in this case, center of mass of the multi‐agent system follows the virtual leader but with a finite distance. We have also discussed positive effects of the LA on network connectivity. Finally illustrative examples are added as well. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Adaptive consensus with a virtual leader of multiple agents governed by locally Lipschitz nonlinearity

This paper is concerned with the second‐order consensus problem of multi‐agent systems with a virtual leader, where all agents and the virtual leader share the same intrinsic dynamics with a locally Lipschitz condition. It is assumed that only a small fraction of agents in the group are informed about the position and velocity of the virtual leader. A connectivity‐preserving adaptive controller is proposed to ensure the consensus of multi‐agent systems, wherein no information about the nonlinear dynamics is needed. Moreover, it is proved that the consensus can be reached globally with the proposed control strategy if the degree of the nonlinear dynamics is smaller than some analytical value. Numerical simulations are further provided to illustrate the theoretical results. Copyright © 2012 John Wiley & Sons, Ltd.     

Consensus in multi-agent systems with nonlinear uncertainties under a fixed undirected graph

This paper presents consensus algorithms by integrating cooperative control and adaptive control laws for multi-agent systems with unknown nonlinear uncertainties. An ideal multi-agent system without uncertainties is introduced first. The cooperative control law, based on an artificial potential function, is designed to make the ideal multi-agent system achieve consensus under a fixed and connected undirected graph. The presence of uncertainties will degenerate the performance, or even destabilize the whole multi-agent system. The L ₁ adaptive control law is therefore introduced to handle unknown nonlinear uncertainties. Two different consensus cases are considered: 1) normal consensus—where all agents reach an agreement on an initially undetermined position and velocity, and 2) consensus with a virtual leader—where all agents’ states converge to the virtual leader’s states. Under a fixed and connected undirected graph, the presented consensus algorithms enable the real multi-agent system to stay close to the ideal multi-agent system which achieves consensus with or without a virtual leader. Simulation results of 2-D consensus with nonlinear uncertainties are provided to demonstrate the presented algorithms.     

基于位置信息的混合多智能体蜂拥控制方法

目前,很多蜂拥控制算法都是基于智能体通信半径为一个固定的值且既考虑多智能体之间的相对位置,又考虑它们的相对速度来设计的,然而,实际的情况往往不会有那么理想。文中试图在基于通信半径不同的混合多智能体控制策略的设计过程中减少考虑的控制因素的个数（只考虑位置信息）,提出一种分布式的控制算法。此控制算法能实现多智能体跟随一个速度固定的虚拟领航者,形成聚合、无碰撞的队列。给出了算法的可行性理论分析,并针对20个智能体跟踪一个速度固定的虚拟领导者的情形给出了计算机仿真,用以验证算法的可行性。     

Flocking shape analysis of multi-agent systems

In this paper,we consider the shape control in flocking behavior of a multi-agent system with a virtual leader.Besides the traditional flocking control terms,which include a gradient-based term,a velocity consensus term and a navigational feed-back in general,a new piecewise smooth neighbor-based local controller is added to regulate the configuration to the desired flocking shape.All agent velocities approach the desired velocity asymptotically,while collisions among agents can be avoided.Furthermore,based...     

Flocking of Multi-Agents With a Virtual Leader

All agents being informed and the virtual leader traveling at a constant velocity are the two critical assumptions seen in the recent literature on flocking in multi-agent systems. Under these assumptions, Olfati-Saber in a recent IEEE Transactions on Automatic Control paper proposed a flocking algorithm which by incorporating a navigational feedback enables a group of agents to track a virtual leader. This paper revisits the problem of multi-agent flocking in the absence of the above two assumptions. We first show that, even when only a fraction of agents are informed, the Olfati-Saber flocking algorithm still enables all the informed agents to move with the desired constant velocity, and an uninformed agent to also move with the same desired velocity if it can be influenced by the informed agents from time to time during the evolution. Numerical simulation demonstrates that a very small group of the informed agents can cause most of the agents to move with the desired velocity and the larger the informed group is the bigger portion of agents will move with the desired velocity. In the situation where the virtual leader travels with a varying velocity, we propose modification to the Olfati-Saber algorithm and show that the resulting algorithm enables the asymptotic tracking of the virtual leader. That is, the position and velocity of the center of mass of all agents will converge exponentially to those of the virtual leader. The convergent rate is also given.      

Distributed control of uncertain multiagent systems for tracking a leader with unknown fractional‐order dynamics

This paper proposes distributed adaptive cooperative control algorithms for second‐order agents to track a leader with unknown dynamics. The models of the followers and the leader are composed of uncertain nonlinear components. The order of the leader's dynamics is unknown and can be fractional. Only the single output information is shared among neighbored agents. To simplify the control design, linearly parameterized neural networks are used to approximate the unknown functions. We first present an adaptive control for leaderless consensus and then extend the method to the tracking problem. Thorough theoretical proofs as well as numerical simulation are included to verify the results. Compared with relevant literature, the new approach applies to a larger variety of systems because (i) knowledge about the structure of leader's model is unnecessary; (ii) the unknown functions in different agents' dynamics can be diverse and arbitrary, in other words, the algorithms apply to heterogeneous agents; (iii) the results can be simply used without parameter calculations.     

邻域交互结构优化的多智能体快速蜂拥控制算法

针对多智能体系统在动态演化过程中容易出现的"局部聚集"现象,融 合复杂网络中的拓扑结构优化理论与多智能体系统协调蜂拥控制研究,提出了一种基 于邻域交互结构优化的多智能体快速蜂拥控制算法.该算法首先从宏观上分析多智 能体的局部聚集现象,利用社团划分算法将局部相对密集的多个智能体聚类成一个 社团,整个多智能体系统可以划分成多个相对稀疏的社团,并为每个社团选择度 最大的个体作为信息智能体,该个体可以获知虚拟领导者信息;随后从多智能体 系统中不同社团相邻个体间的局部交互结构入手,取消社团间相邻个体的交 互作用,设计仅依赖于社团内部邻居个体交互作用的蜂拥控制律;理论分 析表明,只要每个社团存在一个信息智能体,在虚拟领导者的引导作用下,整个多 智能体系统就可以实现收敛的蜂拥控制行为;仿真实验也证实了对多智 能体系统进行邻域交互结构优化可以有效提高整个系统的收敛速度.     

Flocking of Multi‐Agents Following a Leader with Adaptive Protocol in a Noisy Environment

This paper investigates the flocking problem of multi‐agents following a leader with communication delays in a noisy environment. Based on potential fields and the LaSalle‐type theorem for stochastic differential delay equations, by introducing the adaptive protocol compensating for the desired velocity, a new neighbor‐based flocking protocol is proposed such that all the agents move with a virtual leader's velocity almost surely, and avoidance of collision between the agents is ensured. A numerical example is given to illustrate the effectiveness of the proposed methods.     

Flocking for multi-agent systems with optimally rigid topology based on information weighted Kalman consensus filter

This paper investigates the leader-follower flocking problem of multi-agent systems. The leader with input noise is estimated by a proposed continuous-time information weighted Kalman consensus filter (IWKCF) for agents. A novel distributed flocking algorithm based on the IWKCF is further presented to make agents achieve flocking to the leader. It is shown that the proposed flocking algorithm based on the continuous-time IWKCF is asymptotically stable. Applying the topology optimization scheme, the communication complexity of system topologies of multi-agent systems is effectively reduced. Finally, simulations are provided to demonstrate the effectiveness of the proposed results.     

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.     

Semi‐decentralized nonlinear cooperative control strategies for a network of heterogeneous autonomous underwater vehicles

In this paper, we develop nonlinear distributed or semi‐decentralized cooperative control schemes for a team of heterogeneous autonomous underwater vehicles (AUVs). The objective is to have the network of AUVs follow a desired trajectory, while the agents maintain a desired formation when there is a virtual leader whose position information is only available and known to a very small subset of the agents. The virtual leader does not receive any feedback and information from the other agents and the agents only communicate with their nearest neighboring agents. It is assumed that the model parameters associated with each vehicle/agent is different, although the order of the agents is the same. The developed and proposed nonlinear distributed cooperative control schemes are based on the dynamic surface control methodology for a network of heterogeneous autonomous vehicles with uncertainties. The development and investigation of the dynamic surface control methodology for a team of cooperative heterogenous multi‐agent nonlinear systems is accomplished for the first time in the literature. Simulation results corresponding to a team of six AUVs are provided to demonstrate and illustrate the advantages and superiority of our proposed cooperative control strategies as compared to the methods that are available in the literature. Copyright © 2016 John Wiley & Sons, Ltd.     

Distributed adaptive fuzzy iterative learning control of coordination problems for higher order multi-agent systems

In this paper, the adaptive fuzzy iterative learning control scheme is proposed for coordination problems of Mth order (M ≥ 2) distributed multi-agent systems. Every follower agent has a higher order integrator with unknown nonlinear dynamics and input disturbance. The dynamics of the leader are a higher order nonlinear systems and only available to a portion of the follower agents. With distributed initial state learning, the unified distributed protocols combined time-domain and iteration-domain adaptive laws guarantee that the follower agents track the leader uniformly on [0, T]. Then, the proposed algorithm extends to achieve the formation control. A numerical example and a multiple robotic system are provided to demonstrate the performance of the proposed approach.