Necessary and sufficient conditions for mean square consensus under Markov switching topologies

This article deals with the mean square consensus problem for second-order discrete-time multi-agent systems. Both cases of systems with and without time delays in Markov switching topologies are considered. With the introduced control protocols, necessary and sufficient conditions for mean square consensus of second-order multi-agent systems are derived. Under the given control protocols in Markov switching topologies, the second-order multi-agent systems can reach mean square consensus if and only if each union of the graphs corresponding to all the nodes in closed sets has a spanning tree. Finally, a simulation example is provided to illustrate the effectiveness of our theoretical results.     

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.     

Mean square leader-following consensus of heterogeneous multi-agent systems with Markovian switching topologies and communication delays

This article considers the mean square leader-following output consensus problem of heterogeneous multi-agent systems under randomly switching topologies and time-varying communication delays. By modeling the switching topologies as a time-homogeneous Markov process and taking the communication delays into consideration, a distributed observer is proposed to estimate the state of the leader. A novel distributed output feedback controller is then designed. By constructing a novel switching Lyapunov functional, an easily-verifiable sufficient condition to achieve the mean square leader-following output consensus is given. Finally, two simulation examples are presented to show the effectiveness of the proposed control scheme.     

Distributed consensus of discrete‐time multi‐agent systems with multiplicative noises

In this paper, we consider the consensus problem of discrete‐time multi‐agent systems with multiplicative communication noises. Each agent can only receive information corrupted by noises from its neighbors and/or a reference node. The intensities of these noises are dependent on the relative states of agents. Under some mild assumptions of the noises and the structure of network, consensus is analyzed under a fixed topology, dynamically switching topologies and randomly switching topologies, respectively. By combining algebraic graph theory and martingale convergence theorem, sufficient conditions for mean square and almost sure consensus are given. Further, when the consensus is achieved without a reference, it is shown that the consensus point is a random variable with its expectation being the average of the initial states of the agents and its variance being bounded. If the multi‐agent system has access to the state of the reference, the state of each agent can asymptotically converge to the reference. Numerical examples are given to illustrate the effectiveness of our results. Copyright © 2014 John Wiley & Sons, Ltd.     

Consensus seeking in multi-agent systems with noisy and delayed communication in digraphs having spanning tree

This paper studies the consensus problem of continuous-time single-integrator multi-agent systems with measurement noises and time delays under directed fixed topologies. Each agent in the team receives imprecise and delayed information from its neighbours. The noises are considered white noises, and time delays are assumed to be uniform for all the received information states. An analysis framework based on graph theory and stochastic tools is followed to derive conditions under which the asymptotic unbiased mean square linear χ-consensus is achieved in directed fixed topologies having a spanning tree. Then, conditions to achieve asymptotic unbiased mean square average consensus are deduced for fixed balanced digraphs having a spanning tree. The effectiveness of the proposed algorithms is proved through some simulations.     

An output formation consensus control for leader–follower networked multi-agent systems under communication constraints and switching topologies

In this paper, the formation consensus problem for a class of leader–follower networked multi-agent systems under communication constraints and switching topologies is investigated. A networked predictive control scheme is proposed to achieve stability and output formation consensus with the switching topology, capable of compensating for data loss and time delays in the network. By equating the whole closed-loop networked multi-agent system with the proposed control scheme to the corresponding switched system, the sufficient and necessary condition of output formation consensus and stability for agents is given. Finally, using three-degree-of-freedom air-bearing spacecraft simulators as the control objects, the proposed scheme is demonstrated to be able to actively compensate for the communication constraints through numerical simulations, and it is also verified to have a good control performance by further realizing the formation task of the simulators through practical experiments.     

Mean square average-consensus under measurement noises and fixed topologies: Necessary and sufficient conditions

In this paper, average-consensus control is considered for networks of continuous-time integrator agents under fixed and directed topologies. The control input of each agent can only use its local state and the states of its neighbors corrupted by white noises. To attenuate the measurement noises, time-varying consensus gains are introduced in the consensus protocol. By combining the tools of algebraic graph theory and stochastic analysis, the convergence of these kinds of protocols is analyzed. Firstly, for noise-free cases, necessary and sufficient conditions are given on the network topology and consensus gains to achieve average-consensus. Secondly, for the cases with measurement noises, necessary and sufficient conditions are given on the consensus gains to achieve asymptotic unbiased mean square average-consensus. It is shown that under the protocol designed, all agents’ states converge to a common Gaussian random variable, whose mathematical expectation is just the average of the initial states.     

Leader-following consensus of multi-agent systems with switching topologies and time-delays

This paper investigates the leader-following consensus problem of multi-agent systems where the leader is static and the controlling effect of each follower depends on its own state. The control protocols are proposed for two cases: i) for network with switching topologies and undirected information flow; ii) for network with directed information flow and communication time-delays. With the aid of several tools from algebraic graph, matrix theory and stability theory, the sufficient conditions guaranteeing leader-following consensus are obtained by constructing appropriate Lyapunov functions. Simulations are presented to demonstrate the effectiveness of our theoretical results.     

Consensus of heterogeneous first‐ and second‐order multi‐agent systems with directed communication topologies

In this paper, we consider the consensus problem for heterogeneous multi‐agent systems composed of some first‐order and some second‐order dynamic agents in directed communication graphs. Consensus protocols are proposed for the second‐ and first‐order dynamic agents, respectively. Under certain assumptions on the control parameters, for fixed communication topologies, necessary and sufficient conditions for consensus are given, and the consensus values of all agents are established. For switching topologies, sufficient conditions are given for all agents to reach consensus. Finally, simulation examples are presented to demonstrate the effectiveness of the proposed methods. Copyright © 2013 John Wiley & Sons, Ltd.     

Consensus of double-integrator multi-agent systems without relative states derivative under relative-state dependent measurement noises*

This paper proposes a consensus protocol for continuous-time double-integrator multi-agent systems under noisy communication in directed topologies. Each agent’s control input relies on its own velocity and the relative positions with neighbours; it does not require the relative velocities. The agent receives its neighbours’ positions information corrupted by time-varying measurement noises whose intensities are proportional to the absolute relative distance that separates the agent from the neighbours. The consensus protocol is mainly based on the velocity damping gain to derive conditions under which the unbiased mean square χ-consensus is achieved in directed fixed topologies, and the unbiased mean square average consensus is achieved in directed switching topologies. The mean square state errors are quantified for both the positions and velocities. Finally, to illustrate the approach presented, some numerical simulations are performed.     

Mean square consensus of multi-agent systems with multiplicative noises and time delays under directed fixed topologies

This paper investigates the mean square consensus problem of multi-agent systems impacted by the combined uncertainty of multiplicative noises and time delays. Considering general network under directed fixed topologies, we propose consensus protocol that take into account both the multiplicative noises and time delays. Using tools from stochastic differential delay equation (SDDE), martingale theory and stochastic inequality, we establish sufficient conditions and obtain the explicit consensus gain and delay upper bounds under which the proposed protocol leads to mean square consensus. In addition, we compare the impact of multiplicative and additive noise and reach the conclusion that multiplicative noises have the property of stabilizing effect. Simulations demonstrate the theoretical results.     

带有不确定时变延时的有向网络多智能体平均一致性研究（英文）

This paper investigates the average consensus problem in directed networks of multi-agent systems with uncertain time-varying delays. Fixed and switching topologies that are kept weakly connected and balanced are firstly analyzed. The original system is then transformed into a reduced dimension model. Based on Jensen s inequality and reciprocally convex approach, sufficient conditions for average consensus are further presented. Specially, a less conservative upper bound of time-varying communication delays is derived in comparison with the existing results. Numerical examples confirm the effectiveness of the proposed method.     

Output consensus for heterogeneous multiagent systems with Markovian switching network topologies

This paper investigates the output consensus problem of heterogeneous continuous‐time multiagent systems under randomly switching communication topologies. The switching mechanism is governed by a time‐homogeneous Markov process, whose states correspond to all possible communication topologies among agents. A novel dynamic consensus controller is proposed. The controller gains are designed based on the information of the expectation graph and the solutions to regulator equations. Furthermore, a necessary and sufficient condition is presented for output consensus of the controlled multiagent system in mean square sense. Finally, a simulation example is provided to corroborate the effectiveness of the proposed controller.     

Distributed finite-time consensus tracking for nonlinear multi-agent systems with a time-varying reference state

This paper investigates the consensus tracking problem for nonlinear multi-agent systems with a time-varying reference state. The consensus reference is taken as a virtual leader, whose output is only its position information that is available to only a subset of a group of followers. The dynamics of each follower consists of two terms: nonlinear inherent dynamics and a simple communication protocol relying only on the position of its neighbours. In this paper, the consensus tracking problem is respectively considered under fixed and switching communication topologies. Some corresponding sufficient conditions are obtained to guarantee the states of followers can converge to the state of the virtual leader in finite time. Rigorous proofs are given by using graph theory, matrix theory, and Lyapunov theory. Simulations are presented to illustrate the theoretical analysis.     

带有不确定时变延时的有向网络多智能体平均一致性研究

针对带有不确定时变通信延时的有向网络多智能体系统的平均一致性问题,本文首先深入分析了弱连接且平衡的固定/切换拓扑特性.然后,通过分解系统状态变量,建立了初始系统的降维综合模型.考虑降维模型带有不确定时变延时,基于Jensen's不等式和最近提出的新型互凸方法,得到了系统平均一致性的充分条件,特别是,给出了与目前研究结果相比具有更小保守性的时变通信延时上界.最后,数值仿真验证了提出方法的可行性和有效性.     

Consentability and protocol design of multi-agent systems with stochastic switching topology

This paper studies the mean square consentability problem for a network of double-integrator agents with stochastic switching topology. It is proved that in Markov-switching topologies, the network is mean square consentable under linear consensus protocol if and only if the union of graphs in the switching topology set has globally reachable nodes. A necessary and sufficient condition of the mean square consensus is obtained. Finally, an LMI approach to the design of the consensus protocol is presented. Numerical simulations are given to illustrate the results.     

Lyapunov-Based Output Containment Control of Heterogeneous Multi-Agent Systems With Markovian Switching Topologies and Distributed Delays

This paper considers the mean square output containment control problem for heterogeneous multi-agent systems(MASs) with randomly switching topologies and nonuniform distributed delays. By modeling the switching topologies as a continuous-time Markov process and taking the distributed delays into consideration, a novel distributed containment observer is proposed to estimate the convex hull spanned by the leaders’ states.A novel distributed output feedback containment controller is then designed...     

Observer‐based consensus control of nonlinear multiagent systems under semi‐Markovian switching topologies and cyber attacks

This article investigates the leader‐following consensus of nonlinear multiagent systems under semi‐Markovian switching topologies and cyber attacks. Unlike the related works, the communication channels considered herein are subjected to successful but recoverable attacks, and when the channels work well, the network topology is time‐varying and described by a semi‐Markovian switching topology. Due to the effect of attacks, the communication network is intermittently paralyzed. For the cases that the transition rates of semi‐Markovian switching topologies are completely known and partially unknown, observer‐based control protocols and sufficient conditions are proposed, respectively, to ensure the consensus of the systems in the mean square sense. Finally, simulation examples are given to illustrate the validity of the theoretical results.     

Consensus of second‐order discrete‐time multi‐agent systems with relative‐state‐dependent noises

This paper studies the consensus problem of second‐order discrete‐time multi‐agent systems with relative‐state‐dependent noises. Directed switching topologies are considered. Firstly, for a kind of switching topology with each digraph containing a spanning tree, we give a weak consensus result on the basis of the mode‐dependent average dwell time method. Then, if all digraphs in a switching topology are strongly connected and the corresponding Laplacian matrices have a common left eigenvector for zero eigenvalue, we prove that the mean square and almost sure consensus can always be guaranteed for an arbitrary switching sequence with some constant distributed control gains, and we also give the statistic properties of the final consensus points. Numerical examples are presented to illustrate the effectiveness of our results. Copyright © 2017 John Wiley & Sons, Ltd.     

Stochastic consensus of double-integrator leader-following multi-agent systems with measurement noises and time delays

This paper studies a leader-following consensus problem of continuous-time double-integrator multi-agent systems with measurement noises and time-varying communication delays under directed topology. By utilising the neighbour position and velocity information, which are delayed and disturbed by measurement noises whose intensities are considered a function related to the neighbour position and velocity of agents, a distributed consensus protocol is presented, sufficient conditions of the tracking consensus in the sense of mean square are derived. Finally, the effectiveness of the proposed consensus protocol is proved by some simulations.