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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Quan-sheng DOU, Yu-rong LI, Ping JIANG
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2016-10-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016193/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841539585057751040
author Quan-sheng DOU
Yu-rong LI
Ping JIANG
author_facet Quan-sheng DOU
Yu-rong LI
Ping JIANG
author_sort Quan-sheng DOU
collection DOAJ
description 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.
format Article
id doaj-art-6f442ef5d52a4795b2b6175fecc78f25
institution Kabale University
issn 1000-436X
language zho
publishDate 2016-10-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-6f442ef5d52a4795b2b6175fecc78f252025-01-14T06:56:03ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2016-10-0137333959703780Upper bound of mean-square deviation of discrete linear consensus systemQuan-sheng DOUYu-rong LIPing JIANGThe 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016193/collective intelligencemulti-agent systemconsensus protocolnoisy problemmean square consensus
spellingShingle Quan-sheng DOU
Yu-rong LI
Ping JIANG
Upper bound of mean-square deviation of discrete linear consensus system
Tongxin xuebao
collective intelligence
multi-agent system
consensus protocol
noisy problem
mean square consensus
title Upper bound of mean-square deviation of discrete linear consensus system
title_full Upper bound of mean-square deviation of discrete linear consensus system
title_fullStr Upper bound of mean-square deviation of discrete linear consensus system
title_full_unstemmed Upper bound of mean-square deviation of discrete linear consensus system
title_short Upper bound of mean-square deviation of discrete linear consensus system
title_sort upper bound of mean square deviation of discrete linear consensus system
topic collective intelligence
multi-agent system
consensus protocol
noisy problem
mean square consensus
url http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016193/
work_keys_str_mv AT quanshengdou upperboundofmeansquaredeviationofdiscretelinearconsensussystem
AT yurongli upperboundofmeansquaredeviationofdiscretelinearconsensussystem
AT pingjiang upperboundofmeansquaredeviationofdiscretelinearconsensussystem