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...
Saved in:
| Main Authors: | , , |
|---|---|
| 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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |