对抗网络下时滞非线性多智能体系统固定时间二分一致性

本文针对一类存在输入时延的非线性多智能体系统,研究了其在结构平衡的无向符号图下的固定时间二分一致性问题.首先,本文针对智能体间相互合作与相互竞争的关系,设计了一类存在输入时延的多智能体系统固定时间分布式一致性控制协议,使得系统状态在固定时间内收敛到数值相同但符号相反的两个值,且收敛时间上界与初始状态无关.随后,利用Lyapunov稳定性理论和代数图论给出了在存在输入时延的情况下多智能体系统实现固定时间二分一致性的充分条件和收敛时间的上界值,证明了控制算法的稳定性.最后,仿真实例验证了所提固定时间二分一致性算法和理论结果的有效性.     

Adaptive bipartite consensus control of high‐order multiagent systems on coopetition networks

In this paper, a bipartite consensus problem is considered for a high‐order multiagent system with cooperative‐competitive interactions and unknown time‐varying disturbances. A signed graph is used to describe the interaction network associated with the multiagent system. The unknown disturbances are expressed by linearly parameterized models, and distributed adaptive laws are designed to estimate the unknown parameters in the models. For the case that there is no exogenous reference system, a fully distributed adaptive control law is proposed to ensure that all the agents reach a bipartite consensus. For the other case that there exists an exogenous reference system, another fully distributed adaptive control law is also developed to ensure that all the agents achieve bipartite consensus on the state of the exogenous system. The stability of the closed‐loop multiagent systems with the 2 proposed adaptive control laws are analyzed under an assumption that the interaction network is structurally balanced. Moreover, the convergence of the parameter estimation errors is guaranteed with a persistent excitation condition. Finally, simulation examples are provided to demonstrate the effectiveness of the proposed adaptive bipartite consensus control laws for the concerned multiagent system.     

Coordination of discrete‐time multi‐agent systems via relative output feedback

This paper investigates the joint effects of agent dynamic and network topology on the consensusability of linear discrete‐time multi‐agent systems via relative output feedback. An observer‐based distributed control protocol is proposed. A necessary and sufficient condition for consensusability under this control protocol is given, which explicitly reveals how the intrinsic entropy rate of the agent dynamic and the eigenratio of the undirected communication graph affect consensusability. As a special case, multi‐agent systems with discrete‐time double integrator dynamics are discussed where a simple control protocol directly using two‐step relative position feedback is provided to reach a consensus. Finally, the result is extended to solve the formation and formation‐based tracking problems. The theoretical results are illustrated by simulations. Copyright © 2010 John Wiley & Sons, Ltd.     

Stochastic consensus of single‐integrator multi‐agent systems under relative state‐dependent measurement noises and time delays

This paper proposes a consensus algorithm for continuous‐time single‐integrator multi‐agent systems with relative state‐dependent measurement noises and time delays in directed fixed and switching topologies. Each agent's control input relies on its own information state and its neighbors' information states, which are delayed and corrupted by measurement noises whose intensities are considered a function of the agents' relative states. The time delays are considered time‐varying and uniform. For directed fixed topologies, condition to ensure mean square linear χ‐consensus (average consensus, respectively) are derived for digraphs having spanning tree (balanced digraphs having spanning tree, respectively). For directed switching topologies, conditions on both time delays and dwell time have been given to extend the mean square linear χ‐consensus (average consensus, respectively) of fixed topologies to switching topologies. Copyright © 2016 John Wiley & Sons, Ltd.     

Convergence analysis of directed signed networks via an M-matrix approach

This paper aims at solving convergence problems on directed signed networks with multiple nodes, where interactions among nodes are described by signed digraphs. The convergence analysis is achieved by matrix-theoretic and graph-theoretic tools, in which M-matrices play a central role. The fundamental digon sign-symmetry assumption upon signed digraphs can be removed with the proposed analysis approach. Furthermore, necessary and sufficient conditions are established for semi-positive and positive stabilities of Laplacian matrices of signed digraphs, respectively. A benefit of this result is that given strong connectivity, a directed signed network can achieve bipartite consensus (or state stability) if and only if the signed digraph associated with it is structurally balanced (or unbalanced). If the interactions between nodes are described by a signed digraph only with spanning trees, a directed signed network can achieve interval bipartite consensus (or state stability) if and only if the signed digraph contains a structurally balanced (or unbalanced) rooted subgraph. Simulations are given to illustrate the developed results by considering signed networks associated with digon sign-unsymmetric signed digraphs.     

Observer‐based consensus of second‐order multi‐agent system with fixed and stochastically switching topology via sampled data

This paper addresses the distributed observer‐based consensus problem of second‐order multi‐agent systems via sampled data. Firstly, for the case of fixed topology, a velocity‐independent distributed control law is proposed by designing a distributed observer to estimate the unavailable velocity, then a sufficient and necessary condition of consensus on design parameters and sampling period is obtained by using the matrix analysis method. Secondly, for the case of stochastically switching topology, a sufficient and necessary condition of mean square consensus is also proposed and proven, and an algorithm is provided to design the parameters in the consensus protocol. Two simulation examples are given to illustrate the effectiveness of the proposed consensus algorithms. Copyright © 2012 John Wiley & Sons, Ltd.     

Leader‐Following Consensus of Multi‐Agent System with Diffusion

This paper is concerned with the leader‐following consensus problem for multi‐agent systems consisting of one stationary leader and multiple cooperative followers, where the controlling effect of each follower depends on its own state. It is noted that the influence of diffusion among followers is taken into account and the system is modeled by reaction‐diffusion equations. With the assumption of the followers' initial states, a linear control protocol is designed. Based on algebraic graph theory, the method of energy estimates, and Sobolev embedding theorem, the sufficient conditions guaranteeing the leader‐following consensus under the proposed control protocol are provided. Numerical examples illustrate the effectiveness of the theoretical results.     

Robust and nonfragile consensus of positive multiagent systems via observer‐based output‐feedback protocols

This article investigates the consensus problem for positive multiagent systems via an observer‐based dynamic output‐feedback protocol. The dynamics of the agents are modeled by linear positive systems and the communication topology of the agents is expressed by an undirected connected graph. For the consensus problem, the nominal case is studied under the semidefinite programming framework while the robust and nonfragile cases are investigated under the linear programming framework. It is required that the distributed state‐feedback controller and observer gains should be structured to preserve the positivity of multiagent systems. Necessary and/or sufficient conditions for the analysis of consensus are obtained by using positive systems theory and graph theory. For the nominal case, necessary and sufficient conditions for the codesign of state‐feedback controller and observer of consensus are derived in terms of matrix inequalities. Sufficient conditions for the robust and nonfragile consensus designs are derived and the codesign of state‐feedback controller and observer can be obtained in terms of solving a set of linear programs. Numerical simulations are provided to show the effectiveness and applicability of the theoretical results and algorithms.     

Synchronization of General Linear Multi‐Agent Systems With Measurement Noises

This paper studies the synchronization of general linear multi‐agent systems with measurement noises in mean square. It shows that the conventional consensus protocol is efficient and robust to the additive and multiplicative measurement noises in mean square. For the additive measurement noises which are independent of the relative‐states, it shows that the multi‐agent systems can achieve synchronization in practical mean square. For the multiplicative measurement noises which are dependent of the relative‐states, it shows that the multi‐agent systems can achieve synchronization in (strict) mean square. Furthermore, the new consensus protocol is better than the conventional one at some specific situations, i.e., the multi‐agent systems with additive measurement noises can also achieve synchronization in (strict) mean square. Numerical simulations are also provided and the results show highly consistent with the theoretical results.     

Bipartite Byzantine-resilient event-triggered consensus control of heterogeneous multi-agent systems

This article studies the bipartite resilient event-triggered consensus control for a class of the heterogeneous multi-agent systems. Due to the external cyberattacks, some agents may become the Byzantine agents and will affect the behavior of the other agents. To improve the security of the multi-agent systems against the Byzantine agents, a novel bipartite event-triggered heterogeneous mean-subsequence-reduced algorithm is designed. First, to handle the heterogeneous multi-agent systems, a state transformation is carefully designed, to facilitate the design and analysis of the bipartite resilient consensus algorithm. Based upon the designed state transformation, the bipartite resilient control inputs are constructed, where the structural balance analysis shows that the resulting effective signed graph and the equivalent signed graph are both structurally balanced, if the signed graph of the multi-agent systems is structurally balanced. In addition, a dynamic event-triggered mechanism is proposed, where a set of dynamic factors are introduced into the event-triggered functions to prevent the usage of the global topology information. By virtue of the designed algorithm, it is guaranteed that the heterogeneous multi-agent systems can achieve the bipartite consensus in the presence of the Byzantine agents, and the communication burden among the agents can be reduced. The numerical simulations are conducted to verify the effectiveness of the proposed algorithm.     

Consensus seeking in a network of discrete-time linear agents with communication noises

This paper studies the mean square consensus of discrete-time linear time-invariant multi-agent systems with communication noises. A distributed consensus protocol, which is composed of the agent's own state feedback and the relative states between the agent and its neighbours, is proposed. A time-varying consensus gain a[k] is applied to attenuate the effect of noises which inherits in the inaccurate measurement of relative states with neighbours. A polynomial, namely ‘parameter polynomial’, is constructed. And its coefficients are the parameters in the feedback gain vector of the proposed protocol. It turns out that the parameter polynomial plays an important role in guaranteeing the consensus of linear multi-agent systems. By the proposed protocol, necessary and sufficient conditions for mean square consensus are presented under different topology conditions: (1) if the communication topology graph has a spanning tree and every node in the graph has at least one parent node, then the mean square consensus can be achieved if and only if ∑^∞_{k = 0}a[k] = ∞, ∑^∞_{k = 0}a²[k] < ∞ and all roots of the parameter polynomial are in the unit circle; (2) if the communication topology graph has a spanning tree and there exits one node without any parent node (the leader–follower case), then the mean square consensus can be achieved if and only if ∑^∞_{k = 0}a[k] = ∞, lim_{k → ∞}a[k] = 0 and all roots of the parameter polynomial are in the unit circle; (3) if the communication topology graph does not have a spanning tree, then the mean square consensus can never be achieved. Finally, one simulation example on the multiple aircrafts system is provided to validate the theoretical analysis.     

Consensus of data‐sampled multi‐agent systems with Markovian switching topologies

This paper studies the consensus problem of data‐sampled multi‐agent systems with Markovian switching topologies. Two different consensus algorithms are considered. By a system transformation, the mean‐square consensus problem of multi‐agent systems is converted into the mean‐square stability problem of Markov jump systems. Necessary and sufficient conditions of mean‐square consensus are obtained. The cone complementary linearization algorithm is used to get the allowable control gain. Simulation examples are given to show the effectiveness of the results. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Consensus of Fractional‐Order Uncertain Multi‐Agent Systems Based on Output Feedback

This paper is devoted to the consensus protocol design for a set of agents with fractional‐order uncertainty dynamics where the fractional order α satisfies 0 < α < 2. For multi‐agent systems (MASs) with fixed undirected topology, a distributed static output feedback protocol is proposed with an undetermined system matrix. Based on model transformation and fractional‐order stability theory, sufficient conditions are derived to ensure the consensus of MASs in terms of linear matrix inequalities (LMIs). Finally, a simulation example is employed to validate the effectiveness of the proposed consensus protocol.     

事件触发下多智能体系统固定时间二分一致性

针对具有符号有向图的一阶多智能体系统,研究了其固定时间二分一致性问题。为降低控制过程中多智能体系统的能量损耗,提出了一种基于事件触发机制的分布式控制协议。以图论和李雅普诺夫理论为主要研究工具,给出了多智能体系统在所设计控制协议作用下实现固定时间二分一致性的充分条件和与系统初始状态无关的收敛时间上界,并证明了使用该协议可以有效避免对智能体的连续控制和Zeno行为的发生。数值算例验证了所得理论结果的有效性。     

Fully distributed bipartite output consensus of heterogeneous linear multiagent systems based on event‐triggered transmission mechanism

This study investigates the fully distributed bipartite output consensus issue of heterogeneous linear multiagent systems (HLMASs) based on event‐triggered transmission mechanism. Both the cooperative interaction and the antagonistic interaction between neighbor agents are considered. A fully distributed bipartite compensator consisting of time‐varying coupling gain and dynamic event‐triggered mechanism is first proposed to estimate the leader's states. Different from the existing schemes, the proposed compensator is independent of any global information of the network topology, is capable of achieving intermittent communication between neighbors, and is applicable for the signed communication topology. Then the distributed output feedback control protocol is developed such that the fully distributed bipartite event‐triggered output consensus problem can be achieved. Moreover, we extend the results in HLMASs without external disturbances to HLMASs with disturbances, which is more challenging in three cases (a) the disturbances are not available for measurement, (b) the disturbances suffered by each agent are heterogeneous, and (c) the disturbances are not required to be stable or bounded. It is proven that the proposed controllers fulfill the exclusion of Zeno behavior in two consensus problems. Finally, two examples are provided to illustrate the feasibility of the theoretical results.     

L2 − L∞ Consensus Control for High‐Order Multi‐Agent Systems with Nonuniform Time‐Varying Delays

This paper considers consensus problem for high‐order multi‐agent systems with dynamically changing topologies and nonuniform time‐varying delays. By means of the tree‐type transformation approach, the model transformation is conducted and the consensus problem is converted into an L₂ ? L_∞ control problem of equivalent reduced‐order systems. Furthermore, a Lyapunov‐Krasovkii function is constructed for stability analysis and sufficient conditions in terms of linear matrix inequalities are derived to ensure the consensus with the prescribed L₂ ? L_∞ performance. A numerical simulation is provided to verify the correctness of the theoretical results.     

Bipartite consensus of multi‐agent systems over signed graphs: State feedback and output feedback control approaches

This paper studies bipartite consensus problems for continuous‐time multi‐agent system over signed directed graphs. We consider general linear agents and design both state feedback and dynamic output feedback control laws for the agents to achieve bipartite consensus. Via establishing an equivalence between bipartite consensus problems and the conventional consensus problems under both state feedback and output feedback control approaches, we make direct application of existing state feedback and output feedback consensus algorithms to solve bipartite consensus problems. Moreover, we propose a systematical approach to design bipartite consensus control laws. Copyright © 2016 John Wiley & Sons, Ltd.     

Discrete‐Time Consensus Filters for Average Tracking of Time‐Varying Inputs on Directed Switching Graphs

In this paper, we consider discrete‐time distributed estimation on a directed graph with switching topologies. Motivated by a recent PI consensus filter, we modify the protocol and remove the limitation of undirected graph and gain conditions with requirement for global topological information. The protocol is then extended to switching topologies. Convergence analysis is conducted for constant inputs under both balanced directed and general directed graphs with topological switching. Then, the result is extended to all cases for time‐varying inputs with an analytical derivation of the error bound. Satisfactory simulation results are shown to validate theoretical claims.     

Distributed node‐to‐node consensus of multi‐agent systems with stochastic sampling

This paper is concerned with the mean square node‐to‐node consensus tracking problem for multi‐agent systems with nonidentical nonlinear dynamics and directed topologies. The randomly occurred uncertainties in the sampling devices may result in stochastically varied sampling periods, which lead to the investigation of node‐to‐node consensus problem under stochastic sampling. By employing the input‐delay method and discontinuous Lyapunov functional approach, it arrives at some sufficient conditions under which the state of each follower can track that of the corresponding leader asymptotically in the mean square sense. Finally, some numerical simulations are provided to verify the effectiveness of the theoretical results. Copyright © 2015 John Wiley & Sons, Ltd.     

Event‐Triggered Control for Couple‐Group Multi‐Agent Systems with Logarithmic Quantizers and Communication Delays

This paper mainly investigates the event‐triggered control for couple‐group multi‐agent systems with communication delay. Logarithmic quantization is considered in the communication channels. Event‐triggered control laws are adopted to reduce the frequency of individual actuation updating for discrete‐time agent dynamics. The proposed protocol is efficient as long as the quantization levels are dense enough, i.e. the density of quantization levels goes to infinity is a sufficient condition for the asymptotic consensus of the multi‐agent systems. It turns out that the bounded consensus depends on not only the density of quantization levels, but also the updating strategy of events. Finally, a simulation example is given to demonstrate the effectiveness of the proposed methods.