ABSTRACT
Finite-field consensus network is a kind of multi-agent systems which requires finite memory, computation and communication resources, and converges in finite time. Finite-field consensus algorithms are suitable for capacity and memory constrained networks, and for applications subject to time constraints. This chapter discusses finite-field consensus networks. Firstly, the consensus of finite-field networks with switching topologies and linear protocols is studied, and some necessary and sufficient conditions are presented. Secondly, the leader-follower consensus of multi-agent systems over finite fields is considered, and some new criteria are proposed for the leader-follower consensus with multiple time delays.
