Journal on Communications ›› 2016, Vol. 37 ›› Issue (10): 33-39.doi: 10.11959/j.issn.1000-436x.2016193

• Papers • Previous Articles     Next Articles

Upper bound of mean-square deviation of discrete linear consensus system

Quan-sheng DOU1,2,Yu-rong LI1,Ping JIANG1   

  1. 1 School of Computer Science and Technology,Shandong Institute of Business and Technology,Yantai 264005,China
    2 Shandong Vehicle Networking Engineering Technology Research Center,Yantai 264005,China
  • Online:2016-10-25 Published:2016-10-25
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Basic Research Program of China (973 Program);The Natural Science Foundation of Shandong Province

Abstract:

The consistency problem is the basis of cooperative control of multi-agents,and has wide application background.The previous research has given the sufficient condition for the linear consistency protocol to realize mean-square consistency problem .Based on graph theory and random analysis,the noise-deviation upper bound of linear discrete mean-square consistency problem was strictly proved further,at the same time,four different network were used as examples to explain the theoretical results.The conclusion provides theoretical basis for the noise evaluation and control of the linear discrete consistency system.

Key words: collective intelligence, multi-agent system, consensus protocol, noisy problem, mean square consensus

No Suggested Reading articles found!