{"title":"Cluster consensus of finite-field networks with stochastic communication topology","authors":"Yalu Li , Gaoxi Xiao , Haitao Li","doi":"10.1016/j.sysconle.2024.105944","DOIUrl":null,"url":null,"abstract":"<div><div>Most of the multi-agent systems (MASs) in real life are with limited storage and communication capabilities; studies on such systems, including consensus problem, however have been mainly based on real number field models. In this article, the cluster consensus problem of MASs with stochastic communication topology over finite-field known as the cluster consensus of finite-field networks (FFNs), is considered. Using the semi-tensor product of matrices, the dynamics of FFNs with stochastic communication topology are equivalently converted into a logical algebraic form, which facilitates further studies. Then a permutation system is introduced. The relationship between cluster consensus of FFNs with stochastic communication topology and the set stability with probability one (SSPO) of the permutation system is revealed. In such an approach, some verifiable criteria can be derived for the cluster consensus of FFNs with stochastic communication topology, without requesting the connectivity of the whole network. Finally, an example is presented to validate the main results.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"193 ","pages":"Article 105944"},"PeriodicalIF":2.1000,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems & Control Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167691124002329","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Most of the multi-agent systems (MASs) in real life are with limited storage and communication capabilities; studies on such systems, including consensus problem, however have been mainly based on real number field models. In this article, the cluster consensus problem of MASs with stochastic communication topology over finite-field known as the cluster consensus of finite-field networks (FFNs), is considered. Using the semi-tensor product of matrices, the dynamics of FFNs with stochastic communication topology are equivalently converted into a logical algebraic form, which facilitates further studies. Then a permutation system is introduced. The relationship between cluster consensus of FFNs with stochastic communication topology and the set stability with probability one (SSPO) of the permutation system is revealed. In such an approach, some verifiable criteria can be derived for the cluster consensus of FFNs with stochastic communication topology, without requesting the connectivity of the whole network. Finally, an example is presented to validate the main results.
期刊介绍:
Founded in 1981 by two of the pre-eminent control theorists, Roger Brockett and Jan Willems, Systems & Control Letters is one of the leading journals in the field of control theory. The aim of the journal is to allow dissemination of relatively concise but highly original contributions whose high initial quality enables a relatively rapid review process. All aspects of the fields of systems and control are covered, especially mathematically-oriented and theoretical papers that have a clear relevance to engineering, physical and biological sciences, and even economics. Application-oriented papers with sophisticated and rigorous mathematical elements are also welcome.