Consensus networks with switching topology and time-delays over finite fields. (June 2016)

• Record Type: Journal Article
• Authors: Li, Xiuxian; Chen, Michael Z.Q.; Su, Housheng; Li, Chanying
• Is Part Of: Automatica. Volume 68(2016)
• Page Start: 39
• Page End: 43
• Publication Date: 2016-06
• Subjects: Consensus -- Networks -- Switching topology -- Time-delays -- Finite fields; Automatic control -- Periodicals; Automation -- Periodicals; 629.805
• DOI: 10.1016/j.automatica.2016.01.033
• Languages: English
• ISSNs: 0005-1098

Abstract

Abstract: The consensus problem in networks with both switching topology and time-delays over finite fields is investigated in this paper. The finite field, which is a kind of finite alphabet, is considered due to the fact that networks often possess limited computation, memory, and capabilities of communication. First, by graph-theoretic method, one necessary and sufficient condition is derived for finite-field consensus of switching networks without time-delays. Subsequently, another necessary and sufficient condition on finite-field consensus without time-delays is provided based on FFC property of matrices associated with switching networks. Moreover, by means of the results on delay-free networks, some necessary and sufficient conditions for finite-field consensus of networks with both switching topology and time-delays are obtained. Additionally, it can be shown that switching networks with time-delays present in each self-transmission cannot achieve consensus.