Guaranteed‐Performance Consensualization for High‐Order Lipschitz Nonlinear Multi‐Agent Systems with Balanced Directed Switching Topologies

Guaranteed‐performance consensus design problems for both the leaderless and leader‐following high‐order multi‐agent systems with balanced directed switching topologies and Lipschitz nonlinear dynamics are investigated. Consensus protocols and quadratic performance functions based on state errors are proposed to obtain the guaranteed‐performance consensus. By a state decomposition method, the consensualization problems for leaderless cases are transformed into asymptotic stability ones of a reduced‐order subsystem and the guaranteed‐performance cost is determined by the Lyapunov stability analysis of the reduced‐order subsystem, and the state error method is utilized to deal with the guaranteed‐performance consensualization problems for leader‐following cases. Then, by using the structure property of the transformation matrix and the Lipschitz condition, the impacts of Lipschitz nonlinear terms can be determined. Moreover, guaranteed‐performance consensualization criteria are presented based on linear matrix inequalities for both leaderless and leader‐following cases with directed switching topologies. Furthermore, the guaranteed‐performance costs are determined, which can respectively reflect the structures of the interaction topologies of leaderless and leader‐following cases. Finally, two numerical simulations are presented to verify the validity of theoretical results.     

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.     

Connectivity Preserving Flocking without Velocity Measurement

In this paper, we address the design of a decentralized controller for connectivity‐preserving flocking, where each agent only can access to the position information of the agents within its sensing zone. An output vector, based on the position information alone, is constructed to replace the role of velocity, and some bounded attractive and repulsive forces are integrated together to design the controller. We prove that the controller not only synchronizes all agents in a stable formation, but also enables collision avoidance and connectivity preserving all of the time, when the initial condition meets certain requirements. Moreover, a leader‐follower method is used to guide the group to a desired direction, where the followers can sense the leader only if the distance between them is less than the communication radius.     

Finite‐Time Consensus Problem for Second‐Order Multi‐Agent Systems Under Switching Topologies

This paper investigates the finite‐time consensus problem for multi‐agent systems with second‐order individual dynamics under switching topologies. A distributed continuous‐time protocol is designed to guarantee finite‐time consensus for homogeneous agents without predetermined leaders, i.e., it ensures agents asymptotically converge to an average consensus within finite time, even if the interaction topology among them is time‐varying but stepwise jointly‐connected. In particular, it introduces a distributed continuous‐time protocol to reach consensus in finite time and reduce the chattering together. Finally, the simulation results are also given to validate the proposed approach.     

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.     

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

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

Bounded Consensus Algorithms for Multi‐Agent Systems in Directed Networks

In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods.     

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.     

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     

有向切换拓扑下多智能体系统编队控制

针对多智能体系统编队形成过程中受lur'e型非线性项影响,并考虑降低系统通信要求,基于一致性理论,设计了分布式控制器,使得多智能体系统形成时变编队.利用Laplacian矩阵的特殊性质,对其进行分解,将多智能体系统的编队控制问题转化为低阶系统的稳定性问题.给出了切换拓扑的平均驻留时间概念,据此提供了一种设计分布式控制器...     

Necessary and sufficient conditions for bounded distributed mean square tracking of multi‐agent systems with noises

This paper is concerned with the distributed control problem of second‐order agents under directed network topology. The control input of each agent only depends on its own state and the states of its neighbors corrupted by white noises. By using the algebraic graph theory and stochastic analysis method, necessary and sufficient conditions are presented for mean square bounded tracking. Finally, several simulation examples are given to illustrate the results. Copyright © 2015 John Wiley & Sons, Ltd.     

Observer‐based leader‐following consensus of uncertain nonlinear multi‐agent systems

In this paper, the leader‐following consensus problem of uncertain high‐order nonlinear multi‐agent systems on directed graph with a fixed topology is studied, where it is assumed that the relative states of a follower and its neighbors are immeasurable and only the relative outputs are available. Nonlinear adaptive observers are firstly proposed for each follower to estimate the states of it and its neighbors, and an observer‐based distributed adaptive control scheme is constructed to guarantee that all followers asymptotically synchronize to a leader with tracking errors being semi‐globally uniform ultimate bounded. On the basis of algebraic graph theory and Lyapunov theory, the closed‐loop system stability analysis is conducted. Finally, numerical simulations are presented to illustrate the effectiveness and potential of the proposed new design techniques. Copyright © 2017 John Wiley & Sons, Ltd.     

Asynchronous Distributed Algorithms for Heading Consensus of Multi‐Agent Systems with Communication Delay

In this paper, we propose two asynchronous distributed protocols for the heading consensus of a multi‐agent group which cannot access a global coordinate system and a global time. Both the leaderless and leader‐following cases are addressed, and inter‐agent communication delay is taken into account. It is proved, under some standard connectivity assumptions, that our leaderless algorithm ensures the heading consensus provided the initial headings are not balanced; and the leader‐based algorithm guarantees the global heading consensus.     

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.     

带强连通分支的多智能体系统可控包含控制

研究有强连通子图拓扑结构的有向多智能体系统领导者选择及可控包含控制问题.根据网络拓扑结构,智能体被分为两类:单元智能体和一般智能体.首先设计强连通子图中个体组成的单元智能体的一致性协议实现各个单元的一致;后由单元智能体和一般智能体构成新的拓扑结构,结合复杂网络可控性理论与二分图最大匹配算法确定满足网络可控的最少领导者集合,并为所有智能个体设计相应的控制协议,驱使跟随者渐近收敛到多个领导者组成的动态凸包中,从而实现网络的可控包含控制.仿真结果验证了理论分析的正确性.     

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.     

切换有向拓扑中的网络化Euler-Lagrange系统自适应同步控制

在动态切换拓扑中研究了带有参数不确定性和单向信息交互的网络化Euler-Lagrange系统的协同控制问题.针对通信拓扑随时间变化的问题,利用有效的局部信息交互设计了一个分布式控制律,并利用自适应技术解决了系统动力学中的参数不确定性问题.通过构造一个连续的Lyapunov函数,证明了系统在切换拓扑的并图存在一棵有向生成树的频率足够高时即可实现网络同步.此外,进一步拓展使用简单的干扰观测器或滑模控制方法进一步研究了该协同策略下的干扰抑制问题.最后,以五颗异构航天器的姿态同步为背景,通过数值仿真及其对照说明了所提合作控制策略的有效性.     

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.     

Relaxed Stability Conditions for Switched Systems with Dwell Time

The paper presents asymptotic, and input‐to‐state stability results, for switched systems with dwell time in which the switching signal is not arbitrary, but is rather chosen as part of the control design strategy. Then, appropriate switching policies allow the use of functions without sign‐definite time derivatives in lieu of a common Lyapunov‐like function.     

Reaching a consensus in networks of high-order integral agents under switching directed topologies

Consensus problem of high-order integral multi-agent systems under switching directed topology is considered in this study. Depending on whether the agent’s full state is available or not, two distributed protocols are proposed to ensure that states of all agents can be convergent to a same stationary value. In the proposed protocols, the gain vector associated with the agent’s (estimated) state and the gain vector associated with the relative (estimated) states between agents are designed in a sophisticated way. By this particular design, the high-order integral multi-agent system can be transformed into a first-order integral multi-agent system. Also, the convergence of the transformed first-order integral agent’s state indicates the convergence of the original high-order integral agent’s state, if and only if all roots of the polynomial, whose coefficients are the entries of the gain vector associated with the relative (estimated) states between agents, are in the open left-half complex plane. Therefore, many analysis techniques in the first-order integral multi-agent system can be directly borrowed to solve the problems in the high-order integral multi-agent system. Due to this property, it is proved that to reach a consensus, the switching directed topology of multi-agent system is only required to be ‘uniformly jointly quasi-strongly connected’, which seems the mildest connectivity condition in the literature. In addition, the consensus problem of discrete-time high-order integral multi-agent systems is studied. The corresponding consensus protocol and performance analysis are presented. Finally, three simulation examples are provided to show the effectiveness of the proposed approach.