基于牵制控制的多智能体系统的有限时间与固定时间一致性

主要研究了在有限时间与固定时间内,牵制多智能体系统到异质目标节点的问题.通过设计非连续的控制协议和两种有效的牵制方案,使得一群有向协作个体在有限时间内或者固定时间内与目标节点达到一致.利用微分包含、集值映射及Lyapunov稳定性理论,给出了多智能系统达到有限时间一致性和固定时间一致性的充分条件.最后,通过数值仿真验证了所得条件的有效性.     

A new class of fixed-time bipartite flocking protocols for multi-agent systems

This work is concerned with the fixed-time stability theorem and the fixed-time bipartite flocking with collision avoidance for multi-agent systems. Under the framework of Filippov solution, a new theorem of fixed-time stability is established and a high-precision estimation of settling time is given. As an important application, the fixed-time bipartite flocking protocol of nonlinear multi-agent systems is proposed. Employing this fixed-time stability theorem and the structurally balanced signed graph theorem, the bipartite flocking without collision is achieved within a fixed-time. Moreover, the convergent time of the bipartite flocking is merely depending on the parameters of the protocol and the network connectivity. In addition, the upper bound of the size for each disjoint cluster can be estimated by the parameters of the protocol, the network connectivity and the initial states of the system. These results are novel, which are illustrated by both theoretical analysis and numerical simulations.     

不确定二阶多智能体系统的鲁棒最优一致

针对不确定二阶多智能体系统,研究了其鲁棒最优一致性问题.首先,基于每个智能体所获得的邻居信息,设计了一个使多智能体系统达到一致的控制协议.其次,研究了多智能体系统的最优一致性问题,给出了系统在满足一定性能指标下达到一致的条件.再次,基于该条件,利用Schur补引理和线性矩阵不等式技术,给出了不确定系统达到鲁棒最优一致的条件.最后,通过仿真验证了所得结果的可行性.     

Distributed impulsive control consensus for a class of unknown nonlinear multi-agent systems based on event-triggered scheme

In this study, we are concerned with the impulsive consensus control problem for a class of nonlinear multi-agent systems (MASs) which have unknown dynamics and directed communication topology. The neural networks (NNs) method is the first utilized to construct distributed event-triggered impulsive consensus protocol. In contrast to the existing impulsive consensus protocol, the consensus protocol proposed in this paper does not need the dynamics of agents, which enhances the system robustness, and realizes distributed event-triggered communication between agents, which can reduce unnecessary consumption of communication resources. Sufficient conditions are derived to ensure the consensus of the controlled MASs and the exclusion of Zeno-behavior. Finally, simulation examples are presented to illustrate the effectiveness of the proposed control protocol.     

New differentiated consensus problem with topology cost constraints

A new differentiated consensus problem is studied. The problem is, given a system with multiple classes, consensus is targeted for each class and the consensus values can be different among the classes. Specifically, differentiated consensus is studied in a distributed stochastic network of nodes (or agents), where tasks assigned with different priorities are serviced. The network is assumed to have a switching topology and involves noises, delays in measurements, and topology cost constraints. The goal is to reach a balanced load (i.e., consensus) across the network and, at the same time, to satisfy the topology cost constraint, both for each priority class. A new control protocol is proposed, with which the network resources are allocated in a randomized way with a probability assigned to each priority class. It is shown that the control protocol meets the topology cost constraint and can be used to reach an approximate consensus for each of the priority classes in the network.     

Consensus protocol design for discrete‐time networks of multiagent with time‐varying delay via logarithmic quantizer

This article considers the problem of consensus for discrete‐time networks of multiagent with time‐varying delays and quantization. It is assumed that the logarithmic quantizer is utilized between the information flow through the sensor of each agent, and its quantization error is included in the proposed method. By constructing a suitable Lyapunov‐Krasovskii functional and utilizing matrix theory, a new consensus criterion for the concerned systems is established in terms of linear matrix inequalities (LMIs) which can be easily solved by various effective optimization algorithms. Based on the consensus criterion, a designing method of consensus protocol is introduced. One numerical example is given to illustrate the effectiveness of the proposed method. © 2014 Wiley Periodicals, Inc. Complexity 21: 163–176, 2015     

具有多重权值的时滞复杂网络固定时间同步问题研究

文章研究了基于非周期间歇性控制的具有多重权值和耦合时滞的复杂网络固定时间同步问题.通过构建具有多重权值的复杂网络模型,并基于固定时间稳定性引理和矩阵理论,给出了实现复杂网络固定时间同步的充分条件.此外,文章设计了固定时间非周期切换控制器,获得了实现复杂网络同步的时间上界的估计值.结论证明了实现网络同步的时间与网络的初始状态无关,最后数值模拟说明了理论结果的正确性和有效性.     

Consensus seeking in multi-agent systems via hybrid protocols with impulse delays

This paper studies the consensus problem of multi-agent systems with both fixed and switching topologies. A hybrid consensus protocol is proposed to take into consideration of continuous-time communications among agents and delayed instant information exchanges on a sequence of discrete times. Based on the proposed algorithms, the multi-agent systems with the hybrid consensus protocols are described in the form of impulsive systems or impulsive switching systems. By employing results from matrix theory and algebraic graph theory, some sufficient conditions for the consensus of multi-agent systems with fixed and switching topologies are established, respectively. Our results show that, for small impulse delays, the hybrid consensus protocols can solve the consensus problem if the union of continuous-time and impulsive-time interaction digraphs contains a spanning tree frequently enough. Simulations are provided to demonstrate the effectiveness of the proposed consensus protocols.     

Variable impulsive consensus of nonlinear multi-agent systems

In this paper, the consensus problem for nonlinear multi-agent systems with variable impulsive control method is studied. In order to decrease the communication wastage, a novel distributed impulsive protocol is designed to achieve consensus. Compared with the common impulsive consensus method with fixed impulsive instants, the variable impulsive consensus method proposed in this paper is more flexible and reliable in practical application. Based on Lyapunov stability theory and some inequality techniques, several novel impulsive consensus conditions are obtained to realize the consensus of multi-agent systems. Finally, some necessary simulations are performed to validate the effectiveness of theoretical results.     

Finite-time consensus on strongly convex balls of Riemannian manifolds with switching directed communication topologies

It is known that a consensus problem on any connected complete Riemannian manifold can be transformed into the one on its strongly convex balls via the compression–decompression along geodesics. From the viewpoint of interior metrics, this paper mainly provides a consensus protocol for strongly convex geodesic balls, in which the communication can be switching and directed. With the aid of nonsmooth analysis tools on Riemannian manifolds, our analysis shows that all dynamical points involved can achieve consensus in finite time. Meanwhile, the corresponding global algorithm is given, with its application to the consensus problem of rotation attitudes, as well as a case simulation, to demonstrate and verify our proposed techniques.     

A polytopic strategy for improved non-asymptotic robust control via implicit Lyapunov functions

This paper is concerned with finite- and fixed-time robust stabilization of uncertain multi-input nonlinear systems via the implicit Lyapunov function method. Instead of splitting the system into a linear nominal model and an additive perturbation which gathers nonlinearities, parametric uncertainties, and exogenous disturbances, the methodology hereby proposed preserves some nonlinear terms in the nominal system via an exact polytopic representation which leads to design conditions in the form of linear matrix inequalities. As a result, feasible solutions are found where former approaches fail; these solutions have more accurate settling-time estimates with reduced control effort. The corresponding control law includes well-known high-order sliding modes as a particular case. Numerical simulations are provided to illustrate the advantages of the proposal.     

Impulsive consensus of multi-agent systems with stochastically switching topologies

In this paper, the impulsive consensus problem for multi-agent systems is investigated. The purpose of this paper is to provide a valid consensus protocol that overcomes the difficulty caused by stochastically switching structures via impulsive control. Some sufficient conditions of almost sure consensus are proposed when the switching structures are the independent process or the Markov process. It is shown that the sum-zero rows of matrix play a key role in achieving group consensus. Furthermore, simulation examples are provided to illustrate and visualize the effectiveness of these results.     

Further improvement of finite-time consensus protocols for detail-balanced networks

This paper presents a new class of protocols to solve finite-time consensus for multi-agent systems. The protocols are induced from the classical finite-time consensus algorithm by using the so-called protocol function. Sufficient conditions are established for networked agents to experience finite-time consensus under time-varying undirected and fixed directed topologies. Numerical simulations show that the proposed protocols can provide more flexibility to improve convergence rate.     

Iterative learning consensus control with initial state learning for fractional order distributed parameter models multi-agent systems

This paper considers the consensus control problem of multi-agent systems (MAS) with distributed parameter models. Based on the framework of network topologies, a second-order PI-type iterative learning control (ILC) protocol with initial state learning is proposed by using the nearest neighbor knowledge. A discrete system for proposed ILC is established, and the consensus control problem is then converted to a stability problem for such a discrete system. Furthermore, by using generalized Gronwall inequality, a sufficient condition for the convergence of the consensus errors between any two agents is obtained. Finally, the validity of the proposed method is verified by two numerical examples.     

Nonlinear fixed-time control protocol for uniform allocation of agents on a segment

The paper addresses the problem of row straightening of agents via local interactions. A nonlinear control protocol that ensures finite-time equidistant allocation on a segment is proposed. With the designed protocol, any settling time can be guaranteed regardless of the initial conditions. A robust modification of the control algorithm based on sliding mode control technique is presented. The case of multidimensional agents is also considered. The theoretical results are illustrated via numerical simulations.     

Fixed-time stability of switched systems with application to a problem of formation control

The problem of fixed-time stability of switched systems is studied. With the aid of the multiple Lyapunov function method, constraints on switching signals are derived under which global fixed-time stability of zero solutions of considered systems can be guaranteed. Sufficient conditions of fixed-time stability for Persidskii-type systems are obtained. The developed approaches are applied to the problem of the fixed-time deployment of mobile agents over a line segment under protocols with switched communication topology. Efficiency of the obtained results is demonstrated by a numerical simulation.     

Global fixed-time stabilization for a class of switched nonlinear systems with general powers and its application

This paper investigates the problem of global fixed-time stabilization for a class of uncertain switched nonlinear systems with the general powers, namely, the powers of the considered systems can be different odd rational numbers, even rational numbers or both odd and even rational numbers. By skillfully using the common Lyapunov function method and the adding a power integrator technique, a common state feedback control strategy is developed. It is proved that the proposed controller can guarantee that the state of the resulting closed-loop system converges to zero for any given fixed time under arbitrary switchings. Simulation results of the liquid-level system are provided to show the effectiveness of the proposed method.     

Naming Game with Multiple Hearers

A new model called Naming Game with Multiple Hearers (NGMH) is proposed in this paper. A naming game over a population of individuals aims to reach consensus on the name of an object through pair-wise local interactions among all the individuals. The proposed NGMH model describes the learning process of a new word, in a population with one speaker and multiple hearers, at each interaction towards convergence. The characteristics of NGMH are examined on three types of network topologies, namely ER random-graph network, WS small-world network, and BA scale-free network. Comparative analysis on the convergence time is performed, revealing that the topology with a larger average (node) degree can reach consensus faster than the others over the same population. It is found that, for a homogeneous network, the average degree is the limiting value of the number of hearers, which reduces the individual ability of learning new words, consequently decreasing the convergence time; for a scale-free network, this limiting value is the deviation of the average degree. It is also found that a network with a larger clustering coefficient takes longer time to converge; especially a small-word network with smallest rewiring possibility takes longest time to reach convergence. As more new nodes are being added to scale-free networks with different degree distributions, their convergence time appears to be robust against the network-size variation. Most new findings reported in this paper are different from that of the single-speaker/single-hearer naming games documented in the literature.