Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering applicatio...Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering application.The existing fault-tolerant dynamical consensus protocol suitable for synchronous SSFFs cannot be directly used to tackle fault-tolerant dynamical consensus of double-integrator MASs with partial agents subject to asynchronous SSFFs.Motivated by these facts,this paper explores a new fault-tolerant dynamical consensus protocol suitable for asynchronous SSFFs.First,multi-hop communication together with the idea of treating asynchronous SSFFs as multiple piecewise synchronous SSFFs is used for recovering the connectivity of network topology among all normal agents.Second,a fault-tolerant dynamical consensus protocol is designed for double-integrator MASs by utilizing the history information of an agent subject to SSFF for computing its own state information at the instants when its minimum-hop normal neighbor set changes.Then,it is theoretically proved that if the strategy of network topology connectivity recovery and the fault-tolerant dynamical consensus protocol with proper time-varying gains are used simultaneously,double-integrator MASs with all normal agents and all agents subject to SSFFs can reach dynamical consensus.Finally,comparison numerical simulations are given to illustrate the effectiveness of the theoretical results.展开更多
The effects of measurement noise are investigated in the context of bipartite consensus of multi-agent systems. In the system setting, discrete-time double-integrator dynamics are assumed for the agent, and measuremen...The effects of measurement noise are investigated in the context of bipartite consensus of multi-agent systems. In the system setting, discrete-time double-integrator dynamics are assumed for the agent, and measurement noise is present for the agent receiving the state information from its neighbors. Time-varying stochastic bipartite consensus protocols are designed in order to lessen the harmful effects of the noise. Consequently, the state transition matrix of the closed-loop system is analyzed, and sufficient and necessary conditions for the proposed protocol to be a mean square bipartite consensus protocol are given with the help of linear transformation and algebraic graph theory. It is proven that the signed digraph to be structurally balanced and having a spanning tree are the weakest communication assumptions for ensuring bipartite consensus. In particular, the proposed protocol is a mean square bipartite average consensus one if the signed digraph is also weight balanced.展开更多
In this paper, we consider multi-agent consensus problems in a decentralised fashion. The interconnection topology graph among the agents is switching and undirected. The agent dynamics is expressed in the form of a d...In this paper, we consider multi-agent consensus problems in a decentralised fashion. The interconnection topology graph among the agents is switching and undirected. The agent dynamics is expressed in the form of a double integrator model. Two different cases are considered in this study. One is the leader-following case and the other is leaderless case. Based on graph theory and common Lyapunov function method, some sufficient conditions are obtained for the consensus stability of the considered systems with the neighbour-based feedback laws in both leader-following case and leaderless case respectively. Finally, two numerical examples are given to illustrate the obtained results.展开更多
This paper revisits the synchronisation problem for second-order multi-agent systems(MASs)under dynamically changing communication topology.By employing the reference model-based synchronisation algorithm,it is finall...This paper revisits the synchronisation problem for second-order multi-agent systems(MASs)under dynamically changing communication topology.By employing the reference model-based synchronisation algorithm,it is finally shown that synchronisation for both the position and velocity states can be achieved if the union of the communication topologies has a directed spanning tree frequently enough.This extends the existing results obtained for second-order MASs which exploits mild communication topology condition guaranteeing the synchronisation to a more general case.Convergence analysis is successfully performed by exploiting the product properties of row-stochastic matrices,which can also provide us with an estimate the convergence rate towards the synchronisation.展开更多
基金National Natural Science Foundation of China(No.61876073)Fundamental Research Funds for the Central Universities of China(No.JUSRP21920)。
文摘Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering application.The existing fault-tolerant dynamical consensus protocol suitable for synchronous SSFFs cannot be directly used to tackle fault-tolerant dynamical consensus of double-integrator MASs with partial agents subject to asynchronous SSFFs.Motivated by these facts,this paper explores a new fault-tolerant dynamical consensus protocol suitable for asynchronous SSFFs.First,multi-hop communication together with the idea of treating asynchronous SSFFs as multiple piecewise synchronous SSFFs is used for recovering the connectivity of network topology among all normal agents.Second,a fault-tolerant dynamical consensus protocol is designed for double-integrator MASs by utilizing the history information of an agent subject to SSFF for computing its own state information at the instants when its minimum-hop normal neighbor set changes.Then,it is theoretically proved that if the strategy of network topology connectivity recovery and the fault-tolerant dynamical consensus protocol with proper time-varying gains are used simultaneously,double-integrator MASs with all normal agents and all agents subject to SSFFs can reach dynamical consensus.Finally,comparison numerical simulations are given to illustrate the effectiveness of the theoretical results.
基金supported by the National Natural Science Foundation of China under Grant Nos.61104136,61673350,61573228the Natural Science Foundation of Shandong Province under Grant Nos.ZR2010FQ002,ZR2016FQ09+1 种基金Postgraduate Education Innovation Program of Shandong Province under Grant No.SDYY16088the Young Teacher Capability Enhancement Program for Overseas Study,Qufu Normal University
文摘The effects of measurement noise are investigated in the context of bipartite consensus of multi-agent systems. In the system setting, discrete-time double-integrator dynamics are assumed for the agent, and measurement noise is present for the agent receiving the state information from its neighbors. Time-varying stochastic bipartite consensus protocols are designed in order to lessen the harmful effects of the noise. Consequently, the state transition matrix of the closed-loop system is analyzed, and sufficient and necessary conditions for the proposed protocol to be a mean square bipartite consensus protocol are given with the help of linear transformation and algebraic graph theory. It is proven that the signed digraph to be structurally balanced and having a spanning tree are the weakest communication assumptions for ensuring bipartite consensus. In particular, the proposed protocol is a mean square bipartite average consensus one if the signed digraph is also weight balanced.
基金Project supported by the National Natural Science Foundation of China (Grant No. 60674071)
文摘In this paper, we consider multi-agent consensus problems in a decentralised fashion. The interconnection topology graph among the agents is switching and undirected. The agent dynamics is expressed in the form of a double integrator model. Two different cases are considered in this study. One is the leader-following case and the other is leaderless case. Based on graph theory and common Lyapunov function method, some sufficient conditions are obtained for the consensus stability of the considered systems with the neighbour-based feedback laws in both leader-following case and leaderless case respectively. Finally, two numerical examples are given to illustrate the obtained results.
文摘This paper revisits the synchronisation problem for second-order multi-agent systems(MASs)under dynamically changing communication topology.By employing the reference model-based synchronisation algorithm,it is finally shown that synchronisation for both the position and velocity states can be achieved if the union of the communication topologies has a directed spanning tree frequently enough.This extends the existing results obtained for second-order MASs which exploits mild communication topology condition guaranteeing the synchronisation to a more general case.Convergence analysis is successfully performed by exploiting the product properties of row-stochastic matrices,which can also provide us with an estimate the convergence rate towards the synchronisation.
