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.     

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.     

Underwater guidance of distributed autonomous underwater vehicles using one leader

Consider the case where autonomous underwater vehicles (AUVs) are deployed to monitor a 3D underwater environment. This paper tackles the problem of guiding all AUVs to the destination while not colliding with a priori unknown 3D obstacles. Suppose that among all AUVs, only the leader AUV has an ability of locating itself, while accessing a destination location. A follower, an AUV that is not a leader, has no sensors for locating itself. Every follower can only measure the relative position of its neighbor AUVs utilizing its sonar sensors. Our paper addresses distributed controls, so that multiple followers track the leader while preserving communication connectivity. We design controls, so that all AUVs reach the destination safely, while maintaining connectivity in cluttered 3D environments. To the best of our knowledge, our article is novel in developing 3D underwater guidance controls, so that all AUVs equipped with sonar sensors are guided to reach a destination in a priori unknown cluttered environments. MATLAB simulations are used to validate the proposed guidance scheme in underwater environments with many obstacles.     

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     

Connectivity maintenance and distributed tracking for double‐integrator agents with bounded potential functions

In this paper, we develop a set of decentralized control laws with bounded potential functions. The basic control law is a combination of attractive, repulsive, and alignment forces, which can keep connectivity, avoid collision, synchronize all agents, and further track a constant moving leader. Furthermore, we investigate the distributed tracking problem with a varying‐velocity leader, where the acceleration of the leader can not be measured. Two cases are considered; the acceleration of the leader is bounded, and the acceleration function satisfies Lipschitz condition. In the first case, the relative velocities of neighbors are integrated and transmitted as a new variable to account for the uncertain time‐varying acceleration. In the second case, two distributed estimators are added for the leader's position and velocity. Finally, some simulations are presented to show the effectiveness of the proposed algorithms. Copyright © 2013 John Wiley & Sons, Ltd.     

A Markovian jump system approach to consensus of heterogeneous multiagent systems with partially unknown and uncertain attack strategies

The problem of robust leader‐following consensus of heterogeneous multiagent systems subject to deny‐of‐service attacks is investigated, where attack strategies are partially unknown and uncertain to defender. A Markovian jump system approach is proposed, that is, capable of describing the occurrence of different attack strategies, and the occurring probability of each attack strategy is represented by the transition probability of the Markovian jump model. Then, sufficient conditions are derived such that the output tracking performance can be guaranteed. In order to design the controller gains, some slack matrices are introduced, which can provide some design freedom. Finally, it is shown that the controller design results can be applied to the multivehicle position‐tracking system. The simulation results reveal that the consensus performance is much better if one has more statistics information on attacks.     

Rigid body attitude coordination without inertial frame information

We study a motion coordination problem where the objective is to achieve identical orientation and synchronous rotation for a group of rigid bodies. Unlike existing designs which assume that the inertial frame is available to each agent, we develop a passivity-based design which relies only on relative attitude information with respect to neighboring agents. The desired equilibria, where all the rigid bodies possess the same attitude and rotate at a desired angular velocity, are shown to be locally asymptotically stable and a manifold of undesired equilibria may exist. We then consider the situation where the reference angular velocity is available only to the leader, and propose a distributed adaptive controller with which the other agents reconstruct this reference angular velocity.     

Robust consensus tracking of second-order nonlinear systems using relative position information by K-filter and disturbance observer based control

This work considers the problem of distributed consensus tracking control of second-order uncertain nonlinear systems under a directed communication graph which contains a spanning tree, where the leader node is the root. It is assumed that the followers receive only the relative positions from the neighbours. For the purpose of consensus tracking controller design, in each follower, a group of K-filters is introduced so that the necessity of velocity estimating is avoided. Then we can express each follower's tracking error dynamics as a second-order system with mismatched uncertainties. And hence we can design a robust consensus tracking controller for each follower by using the combination of the backstepping design and the disturbance observer based control using only relative position information. Theoretical analysis is performed to show that the DOBs' estimation errors can be made to decay to be sufficiently small very quickly before the system states escape from the feasible region. Then we show that all the followers' states track those of the leader with arbitrarily small ultimate error bounds. And simulation examples are provided to demonstrate the performance of the proposed method.     

时延网络中 Euler-Lagrange 系统的分布式自适应协调控制

对一类含未知参数的Euler-Lagrange系统协调控制问题进行了研究, 提出了一种自适应控制算法. 该算法容许通信网络为最一般的伪强连通图, 并允许通信时延的存在. 对系统中领航者为静态和动态两种情况分别进行了研究, 设计了相应的控制器.研究结果表明,在仅有部分个体能够和领航者进行通信的情况下, 控制器能保证网络中其他个体最终和领航者趋于一致. 运用Lyapunov稳定性定理和Barbalat 定理等对自适应控制器的稳定性进行了证明,并利用数值仿真验证了算法的有效性.     

Finite-time formation of multiple agents based on multiple virtual leaders

The finite-time formation problem of multiple agents aims to find a control protocol to guarantee finite-time consensus, in which every agent can be in the right position and keep in the given formation configuration efficiently. However, it is hard to achieve a stable state if only by setting one virtual leader in multiple tasks system. This paper presents a formation controller design for a second-order multiple agents to address the finite-time formation problem. In the procedure, each agent has a virtual leader, and then a control law is designed so that the agents can keep pace with their virtual leaders in terms of speed and position. Accordingly, the controller can ensure that the relative positions among different agents and the trajectory of the whole formation can be specified in advance. Moreover, since the closed-loop system is finite-time stable, which implies that the required formation is attainable without a deviation in finite time. Finally, the stability analysis is proved by applying the graph theory, Lyapunov stability theory and homogeneous system theory. The effectiveness of the algorithm is demonstrated by numerical simulations.     

Containment control of linear multi‐agent systems with multiple leaders of bounded inputs using distributed continuous controllers

This paper considers the containment control problem for multi‐agent systems with general linear dynamics and multiple leaders whose control inputs are possibly nonzero and time varying. Based on the relative states of neighboring agents, a distributed static continuous controller is designed, under which the containment error is uniformly ultimately bounded and the upper bound of the containment error can be made arbitrarily small, if the subgraph associated with the followers is undirected and, for each follower, there exists at least one leader that has a directed path to that follower. It is noted that the design of the static controller requires the knowledge of the eigenvalues of the Laplacian matrix and the upper bounds of the leaders’ control inputs. In order to remove these requirements, a distributed adaptive continuous controller is further proposed, which can be designed and implemented by each follower in a fully distributed fashion. Extensions to the case where only local output information is available and to the case of multi‐agent systems with matching uncertainties are also discussed. Copyright © 2014 John Wiley & Sons, Ltd.     

Distributed Adaptive Event‐Triggered Control for Leader‐Following Consensus of Multi‐Agent Systems

This paper studies the leader‐following consensus problem for Lipschitz nonlinear multi‐agent systems using novel event‐triggered controllers. A distributed adaptive law is introduced for the event‐based control strategy design such that the proposed controllers are independent of system parameters and only use the relative states of neighboring agents, and hence are fully distributed. Due to the introduction of an event‐triggered control scheme, the controller of the agent is only triggered at it's own event times, and thus reduces the amount of communication between controller and actuator and lowers the frequency of controller updates in practice. Based on a quadratic Lyapunov function, the event condition which uses only neighbor information and local computation at trigger instants is established. Infinite triggers within a finite time are also verified to be impossible. The effectiveness of the theoretical results are illustrated through simulation examples.     

Adaptive design for reference velocity recovery in motion coordination

We study a coordination problem where the objective is to steer a group of agents to a formation that translates with a prescribed reference velocity. Unlike existing designs which assume that the reference velocity information is available to each agent, we consider the situation where this information is available only to a leader. We then develop an adaptive design with which the other agents reconstruct the reference velocity and recover the desired formation. This design relies only on relative distance information with respect to neighbouring agents and, thus, can be implemented in a decentralized fashion.     

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.     

Decentralized adaptive consensus control for discrete‐time heterogeneous semiparametric multiagent systems

Different from the consensus control of traditional multiagent systems, this paper studies the decentralized adaptive consensus control for discrete‐time heterogeneous hidden leader‐following semiparametric multiagent system, in which the dynamic equation of each agent has both parametric uncertainties and nonparametric uncertainties. In the considered system, there is a hidden leader agent who can receive the reference signal, but it can only affect the states of those agents who are in its neighborhood. For other following agents, they do not know the leader's existence or the reference signal, and they can only receive information from their neighbors. Our goal is to design decentralized adaptive controllers to make sure that all agents can track the reference signal, and the closed‐loop system achieves consensus in the presence of mutual coupling relations. Due to the existence of both parametric and nonparametric uncertainties in the system, we need to estimate them separately. For the parametric part, we propose a novel dead zone with threshold converging to zero to modify the traditional gradient update law, while for the nonparametric part, we introduce an auxiliary variable including both two uncertainties to facilitate the nonparametric uncertainties compensation. Based on the certainty equivalence principle in adaptive control theory, the decentralized adaptive controller is designed for each agent to make sure that all of them can track the reference signal. Finally, under the proposed control protocol, strict mathematical proofs are given by using Lyapunov theory; then, simulation results are provided to demonstrate the effectiveness of proposed decentralized adaptive controllers.     

仅考虑位置信息连通性保持的群体机器人集结控制

研究速度信息未知情形下的群体机器人集结控制问题.分别针对未设置虚拟领导者和设置虚拟领导者两种情形,提出了仅考虑位置信息的观测器和具有网络连通性保持的分布式控制方法.理论分析表明该算法具有网络连通性保持功能,并且保证所有机器人的速度信息收敛到一致,机器人最终也会聚集到一起.数值仿真实验验证了所提出分布式控制算法的有效性.     

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.     

An internal model approach to autonomous leader/follower trailing for non‐holonomic vehicles

The focus of this paper is on the design of a control architecture of decentralized type for controlling a leader/follower pair of autonomous non‐holonomic vehicles. A fundamental constraint in this trailing control requires that each agent employs local sensor information to process data on the relative position and velocity between its neighbouring vehicles, without relying on global communication with mission control. This constraint poses a challenge in the design of the control system because the reference trajectory to be tracked, which in the case considered in this paper is related to the motion of the leader, is not known a priori. It is shown in the paper that this specific control problem can be approached from the point of view of the internal model paradigm. In particular, once models of the autonomous dynamics of the leader are embedded in a decentralized dynamic controller, the design of the controller can be completed with a robust stabilizer, obtained by using ISS‐gain‐assignment techniques. It is shown that asymptotic convergence of the follower to an arbitrarily small neighbourhood of the desired steady‐state configuration is achieved, despite the presence of possibly large parameter uncertainties, while the motion of each agent remains confined into specified ‘sectors’ to avoid possible collision between neighbouring vehicles during transients. Simulation results are presented to illustrate the design methodology. Copyright © 2006 John Wiley & Sons, Ltd.     

Consensus analysis for leader‐following multi‐agent systems with second‐order individual dynamics and arbitrary sampling

This paper performs a consensus analysis of leader‐following multi‐agent systems with multiple double integrators in the framework of sampled‐data control. Both single‐leader and multiple‐leader scenarios are considered under the assumption of networks with detectable position‐like state information. The coordination tasks are accomplished by a given protocol with the robustness against the change of sampling periods. The sampling periods can be chosen to be of an arbitrary fixed length or large time‐varying length. Under the proposed protocol, we achieve two objectives: (i) in the single leader‐subgroup case, all followers reach an agreement with leaders on states asymptotically and (ii) in the multiple leader‐subgroup case, each follower converges to some convex combination of the final states of all leaders. It is shown that the final state configuration of the convex combination is uniquely determined by the underlying interaction topology, which can be any weakly connected graph. Compared with the existing results on leader‐following networks, the consensus problem and the containment problem are solved in a unified framework with large sampling periods. Some numerical experiments are conducted to illustrate the dynamic behavior of all agents with this protocol. Copyright © 2017 John Wiley & Sons, Ltd.