{"title":"定向通信拓扑下一阶多智能体系统的量化一致性","authors":"Jianzhen Li, Shuxia Ye","doi":"10.1109/ICCA.2013.6564980","DOIUrl":null,"url":null,"abstract":"This paper investigates the sampled-data based consensus problem of first-order multi-agent systems with quantized communication. A deterministic consensus protocol with the logarithmic quantizer proposed in the literature is reinvestigated. A new sufficient condition is derived under which consensus is achieved. It is proved that for any network topology that has a directed spanning tree, consensus is achieved if the quantization accuracy parameter and the sampling period are small enough. A numerical example is given to illustrate the theoretical results.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Quantized consensus of first-order multi-agent systems under directed communication topologies\",\"authors\":\"Jianzhen Li, Shuxia Ye\",\"doi\":\"10.1109/ICCA.2013.6564980\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the sampled-data based consensus problem of first-order multi-agent systems with quantized communication. A deterministic consensus protocol with the logarithmic quantizer proposed in the literature is reinvestigated. A new sufficient condition is derived under which consensus is achieved. It is proved that for any network topology that has a directed spanning tree, consensus is achieved if the quantization accuracy parameter and the sampling period are small enough. A numerical example is given to illustrate the theoretical results.\",\"PeriodicalId\":336534,\"journal\":{\"name\":\"2013 10th IEEE International Conference on Control and Automation (ICCA)\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th IEEE International Conference on Control and Automation (ICCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCA.2013.6564980\",\"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 10th IEEE International Conference on Control and Automation (ICCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCA.2013.6564980","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quantized consensus of first-order multi-agent systems under directed communication topologies
This paper investigates the sampled-data based consensus problem of first-order multi-agent systems with quantized communication. A deterministic consensus protocol with the logarithmic quantizer proposed in the literature is reinvestigated. A new sufficient condition is derived under which consensus is achieved. It is proved that for any network topology that has a directed spanning tree, consensus is achieved if the quantization accuracy parameter and the sampling period are small enough. A numerical example is given to illustrate the theoretical results.