Cluster consensus of finite-field networks with stochastic communication topology

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.