The Convergence Of Multi-agent Systems In Random Disturbance

In recent years,distributed coordinated control of multi-agent systems has attracted the attention of scholars due to its wide application prospects,including biology,computer science,control science and so on.One of the core issues in the field of multi-agent system research is convergence,that is,how to make the behavior of each agent eventually converge.However,in the actual network,the process of multi-agent receiving information is often disturbed by various uncertain factors,such as noise,packet loss,delay and so on.These factors will affect the accuracy of communication between multi-agent and reduce the transmission Journal quality.Therefore,in real life,this convergence problem of multi-agent systems with uncertainties has more research value and significance.This paper is concerned with the consensus problem of the multi-agent systems with measurement stochastic noises under the general communication topology.The generalized algebraic connectivity of strongly connected networks is extended to stochastic systems which proposed by professor Yu Wenwu by using the stability theory of differential equations,matrix analysis,stochastic analysis method and the graph theory.We also obtained the sufficient conditions and the final convergence of the mean square consistency of the multi-agent systems.Finally,an example is given to show the effectiveness of this theory.