Trajectory Control of Scale-Free Dynamical Networks with Exogenous Disturbances

In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturbances for the low degree node and high degree node is analyzed. Firstly, the consensus of multi-agent systems without disturbances is studied by designing a pinning control strategy on a part of agents, where this pinning control can bring multiple agents' states to an expected consensus track. Then, theinfluence of the disturbances is considered by developing disturbance observers, and disturbance observers based control (DOBC) are developed for disturbances generated by an exogenous system to estimate the disturbances. Asymptotical consensus of the multi-agent systems with disturbances under the composite controller can be achieved for scale-free network topology. Finally, by analyzing examples of multi-agent systems with scale-free network topology and exogenous disturbances, the verities of the results are proved. Under the DOBC with the designed parameters, the trajectory convergence of multi-agent systems is researched by pinning two class of the nodes. We have found that it has more stronger robustness to exogenous disturbances for the high degree node pinned than that of the lowdegree node pinned.     

一类异构多智能体系统固定和切换拓扑下的一致性分析

对包含一阶二阶智能体的异构系统有向图中的一致性问题进行研究.对该系统采用了一种线性分布式一致性协议,基于图论和矩阵分析的方法,分析了在固定和切换拓扑情况下系统获得一致性的充分条件,该条件与控制参数和通信拓扑有关.给出了固定拓扑中系统的一致平衡点,证明了仅通信拓扑中的根节点对平衡点起作用.数值仿真验证了理论分析的正确性.     

Consensus in noisy environments with switching topology and time-varying delays

In this paper, the leader-following consensus problem of noise perturbed multi-agent systems with time-varying delays is investigated. We analyze two different cases of coupling topologies: fixed topology and switching topology. Based on the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, it is analytically proved that the consensus could be achieved almost surely with the perturbation of noise and communication time delays. Furthermore, numerical examples are provided to illustrate the effectiveness of the theoretical results. The simulation results show that the speed of convergence in environments with relatively strong noise intensity is lower than that in environments with relatively weak noise intensity.     

Mean-square composite-rotating consensus of second-order systems with communication noises

We study the mean-square composite-rotating consensus problem of second-order multi-agent systems with communication noises, where all agents rotate around a common center and the center of rotation spins around a fixed point simultaneously. Firstly, a time-varying consensus gain is introduced to attenuate to the effect of communication noises. Secondly, sufficient conditions are obtained for achieving the mean-square composite-rotating consensus. Finally, simulations are provided to demonstrate the effectiveness of the proposed algorithm.     

Consensus protocol for multi-agent continuous systems

Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph （directed graph） represents the topology of a networked system, and then a consensus convergence criterion of system is proposed. Secondly, the issue of stability of multi-agent systems and the consensus convergence problem of information states are all analysed. Furthermore, the consensus equilibrium point of system is proved to be global and asymptotically reach the convex combination of initial states. Finally, two examples are taken to show the effectiveness of the results obtained in this paper.     

H∞ consensus control of a class of second-order multi-agent systems without relative velocity measurement

This paper studies consensus control problems for a class of second-order multi-agent systems without relative velocity measurement. Some dynamic neighbour-based rules are adopted for the agents in the presence of external disturbances. A sufficient condition is derived to make all agents achieve consensus while satisfying desired H_∞ performance. Finally, numerical simulations are provided to show the effectiveness of our theoretical results.     

Consensus for second-order multi-agent systems with position sampled data

In this paper, the consensus problem with position sampled data for second-order multi-agent systems is investigated.The interaction topology among the agents is depicted by a directed graph. The full-order and reduced-order observers with position sampled data are proposed, by which two kinds of sampled data-based consensus protocols are constructed. With the provided sampled protocols, the consensus convergence analysis of a continuous-time multi-agent system is equivalently transformed into that of a discrete-time system. Then, by using matrix theory and a sampled control analysis method, some sufficient and necessary consensus conditions based on the coupling parameters, spectrum of the Laplacian matrix and sampling period are obtained. While the sampling period tends to zero, our established necessary and sufficient conditions are degenerated to the continuous-time protocol case, which are consistent with the existing result for the continuous-time case. Finally, the effectiveness of our established results is illustrated by a simple simulation example.     

Cluster-Delay Mean Square Consensus of Stochastic Multi-Agent Systems with Impulse Time Windows

This paper investigates the cluster-delay mean square consensus problem of a class of first-order nonlinear stochastic multi-agent systems with impulse time windows. Specifically, on the one hand, we have applied a discrete control mechanism (i.e., impulsive control) into the system instead of a continuous one, which has the advantages of low control cost, high convergence speed; on the other hand, we considered the existence of impulse time windows when modeling the system, that is, a single impulse appears randomly within a time window rather than an ideal fixed position. In addition, this paper also considers the influence of stochastic disturbances caused by fluctuations in the external environment. Then, based on algebraic graph theory and Lyapunov stability theory, some sufficiency conditions that the system must meet to reach the consensus state are given. Finally, we designed a simulation example to verify the feasibility of the obtained results.     

Consensus problem in multi-agent systems with physical position neighbourhood evolving network

In multi-agent system (MAS), the communication topology of agent network plays a very important role in its consensus problem. To describe the communication topologies of MAS, a class of evolving network models with the concept of physical position neighbourhood connectivity are proposed and studied in this paper. The analysis and simulation results for network parameters such as the first nonzero eigenvalue and maximal eigenvalue of graph Laplacian matrix, clustering coefficients, average distances and degree distributions for different evolving parameters of these models are presented. The dynamical behaviour of each node on the consensus problem is also studied. It was found that the time to reach consensus becomes shorter sharply with the increasing of neighbourhood depth of the nodes in these models. And it was also found that for the maximal distance preferential attachment model (Model 3), the synthetic characteristic, such as robustness to communication delay, as well as convergence speed in consensus problem, is the best in all these models.     

Finite-time sliding mode synchronization of chaotic systems

A new finite-time sliding mode control approach is presented for synchronizing two different topological structure chaotic systems. With the help of the Lyapunov method, the convergence property of the proposed control strategy is discussed in a rigorous manner. Furthermore, it is mathematically proved that our control strategy has a faster convergence speed than the conventional finite-time sliding mode control scheme. In addition, the proposed control strategy can ensure the finite-time synchronization between the master and the slave chaotic systems under internal uncertainties and external disturbances. Simulation results are provided to show the speediness and robustness of the proposed scheme. It is worth noticing that the proposed control scheme is applicable for secure communications.     

Agreement coordination for second-order multi-agent systems with disturbances

This paper is devoted to the study of consensus problems for the second-order multi-agent systems with external disturbances, switching topology and communication time-delay. Firstly, we perform a model transformation and separate the agreement states from the disagreement states. Secondly, according to this system, we derive a sufficient condition for consensus problem without disturbances by using the Lyapunov-based approach. Furthermore, we give a design criterion in terms of bilinear matrix inequality for the control protocol in the presence of disturbances. Finally, numerical simulations are provided to show the effectiveness of our strategies.     

Consensus protocol for heterogeneous multi-agent systems: A Markov chain approach

This paper deals with the consensus problem for heterogeneous multi-agent systems. Different from most existing consensus protocols, we consider the consensus seeking of two types of agents, namely, active agents and passive agents. The objective is to directly control the active agents such that the states of all the agents would achieve consensus. In order to obtain a computational approach, we subtly introduce an appropriate Markov chain to cast the heterogeneous systems into a unified framework. Such a framework is helpful for tackling the constraints from passive agents. Furthermore, a sufficient and necessary condition is established to guarantee the consensus in heterogeneous multi-agent systems. Finally, simulation results are provided to verify the theoretical analysis and the effectiveness of the proposed protocol.     

Finite-time consensus of second-order leader-following multi-agent systems without velocity measurements

This Letter investigates the finite-time consensus problems of second-order multi-agent systems in the presence of one and multiple leaders under a directed graph. Specifically, we propose two bounded control laws, which are independent of velocity information, to deal with the finite-time consensus tracking problem with one leader and the finite-time containment control problem with multiple leaders, respectively. With the aid of homogeneous theory, some sufficient conditions are established for the achievement of the finite-time tracking control problem of second-order multi-agent systems. Numerical examples are finally provided to illustrate the theoretical results.     

Stochastic bounded consensus tracking of leader-follower multi-agent systems with measurement noises based on sampled data with general sampling delay

In this paper we provide a unified framework for consensus tracking of leader-follower multi-agent systems with measurement noises based on sampled data with a general sampling delay. First, a stochastic bounded consensus tracking protocol based on sampled data with a general sampling delay is presented by employing the delay decomposition technique. Then, necessary and sufficient conditions are derived for guaranteeing leader-follower multi-agent systems with measurement noises and a time-varying reference state to achieve mean square bounded consensus tracking. The obtained results cover no sampling delay, a small sampling delay and a large sampling delay as three special cases. Last, simulations are provided to demonstrate the effectiveness of the theoretical results.     

Consensus of heterogeneous multi-agent systems based on sampled data with a small sampling delay

In this paper, consensus problems of heterogeneous multi-agent systems based on sampled data with a small sampling delay are considered. First, a consensus protocol based on sampled data with a small sampling delay for heterogeneous multi-agent systems is proposed. Then, the algebra graph theory, the matrix method, the stability theory of linear systems, and some other techniques are employed to derive the necessary and sufficient conditions guaranteeing heterogeneous multi-agent systems to asymptotically achieve the stationary consensus. Finally, simulations are performed to demonstrate the correctness of the theoretical results.     

Improving consensual performance of multi-agent systems in weighted scale-free networks

This paper studies consensus problems in weighted scale-free networks of asymmetrically coupled dynamical units, where the asymmetry in a given link is determined by the relative degree of the involved nodes. It shows that the asymmetry of interactions has a great effect on the consensus. Especially, when the interactions are dominant from higher- to lower-degree nodes, both the convergence speed and the robustness to communication delay are enhanced.     

有leader的二阶动态多智能体网络的L2—L∞控制

考虑系统噪声和时滞,利用L₂—L_∞控制理论研究了有leader的二阶定拓扑多智能体系统的协调一致问题.工程应用中控制输出的极大值经常需控制在一定范围内,并且考虑系统对位置变量和速度变量限制的范围不同,分别针对位置和速度的控制输出设计了加权系数;进而建立了多智能体系统的数学模型.对有时滞和无时滞的两种网络拓扑,利用李亚普诺夫函数,分析了多智能体系统在满足L₂—L_∞性 关键词： L₂—L_∞控制')" href="#">L₂—L_∞控制 多智能体系统 一致问题 时滞     

Improving performance of FxRLS algorithm for active noise control of impulsive noise

Active noise control (ANC) systems employing adaptive filters suffer from stability issues in the presence of impulsive noise. New impulsive noise control algorithms based on filtered-x recursive least square (FxRLS) algorithm are presented. The FxRLS algorithm gives better convergence than the filtered-x least mean square (FxLMS) algorithm and its variants but lacks robustness in the presence of high impulsive noise. In order to improve the robustness of FxRLS algorithm for ANC of impulsive noise, two modifications are suggested. First proposed modification clips the reference and error signals while, the second modification incorporates energy of the error signal in the gain of FxRLS (MGFxRLS) algorithm. The results demonstrate improved stability and robustness of proposed modifications in the FxRLS algorithm. However, another limitation associated with the FxRLS algorithm is its computationally complex nature. In order to reduce the computational load, a hybrid algorithm based on proposed MGFxRLS and normalized step size FxLMS (NSS-FXLMS) is also developed in this paper. The proposed hybrid algorithm combines the stability of NSS-FxLMS algorithm with the fast convergence speed of the proposed MGFxRLS algorithm. The results of the proposed hybrid algorithm prove that its convergence speed is faster than that of NSS-FxLMS algorithm with computational complexity lesser than that of FxRLS algorithm.     

领导-跟随多智能体系统的滞后一致性

近年来,随着应用的需要和技术的发展,多智能体系统的一致性逐渐成为研究热点.在通信网络和工程应用中,由于信号传播的延迟效应,系统中智能体的状态可能表现为滞后一致.本文提出多智能体系统的滞后一致性概念,研究了有向网络环境下一阶领导-跟随多智能体系统的滞后一致性问题.通过设计合适的控制协议,利用矩阵理论和稳定性理论,获得该系统达到滞后一致的充分条件.数值模拟验证了理论结果的正确性.     

Stochastic bounded consensus tracking of leader–follower multi-agent systems with measurement noises based on sampled-data with small sampling delay

This paper is concerned with the stochastic bounded consensus tracking problems of leader–follower multi-agent systems, where the control input of an agent can only use the information measured at the sampling instants from its neighborhood agents or a virtual leader with a time-varying reference state, the measurements are corrupted by random noises, and the signal sampling process induces a small sampling delay. The augmented matrix method, probability limit theory and algebra graph theory are employed to derive the necessary and sufficient conditions guaranteeing mean square bounded consensus tracking. It turns out that the convergence of the proposed protocol simultaneously depends on the constant feedback gains, the network topology, the sampling period and the sampling delay, and that the static consensus tracking error depends on not only the above-mentioned factors, but also the noise intensity, the number of agents and the upper bound of the changing rate of the virtual leader’s state. The obtained results cover no sampling delay as a special case. Simulations are provided to demonstrate the effectiveness of the theoretical results.