Journal
AUTOMATICA
Volume 68, Issue -, Pages 39-43Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2016.01.033
Keywords
Consensus; Networks; Switching topology; Time-delays; Finite fields
Funding
- Research Grants Council, Hong Kong [106140120]
- HKU CRCG Seed Funding Programme for Basic Research [201411159037]
- Natural Science Foundation of China [61374053, 61473129]
- Program for New Century Excellent Talents in University from Chinese Ministry of Education [NCET-12-0215]
- National Natural Science Foundation of China [61422308]
Ask authors/readers for more resources
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. (C) 2016 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available