多智能体系统的交换拓扑群一致性

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI:10.1109/CIS.2013.68

Xin-Lei Feng, Xiaoli Yang, Zhihe Zhang, Zhongwei Si

{"title":"多智能体系统的交换拓扑群一致性","authors":"Xin-Lei Feng, Xiaoli Yang, Zhihe Zhang, Zhongwei Si","doi":"10.1109/CIS.2013.68","DOIUrl":null,"url":null,"abstract":"In this paper, we consider group consensus problem with switching topology by giving a kind of new protocol in which communication graph weights are all nonnegative. This is also consistent with classic protocols. The sufficient conditions which group consensus under this kind of protocols can reach for both single and second order multi-agent system are obtained. Finally, numerical examples are given to illustrate our theoretical results.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Group Consensus with Switching Topology of Multi-agent Systems\",\"authors\":\"Xin-Lei Feng, Xiaoli Yang, Zhihe Zhang, Zhongwei Si\",\"doi\":\"10.1109/CIS.2013.68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider group consensus problem with switching topology by giving a kind of new protocol in which communication graph weights are all nonnegative. This is also consistent with classic protocols. The sufficient conditions which group consensus under this kind of protocols can reach for both single and second order multi-agent system are obtained. Finally, numerical examples are given to illustrate our theoretical results.\",\"PeriodicalId\":294223,\"journal\":{\"name\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2013.68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Ninth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2013.68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文通过给出一种通信图权值均为非负的新协议，研究了具有交换拓扑的群一致性问题。这也与经典协议一致。得到了在这种协议下，单阶和二阶多智能体系统都能达到群体一致性的充分条件。最后，通过数值算例对理论结果进行了验证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Group Consensus with Switching Topology of Multi-agent Systems

In this paper, we consider group consensus problem with switching topology by giving a kind of new protocol in which communication graph weights are all nonnegative. This is also consistent with classic protocols. The sufficient conditions which group consensus under this kind of protocols can reach for both single and second order multi-agent system are obtained. Finally, numerical examples are given to illustrate our theoretical results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 Ninth International Conference on Computational Intelligence and Security

自引率

0.00%

发文量