Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.automatica.2016.01.033 | Automatica |
Keywords | Field | DocType |
Consensus,Networks,Switching topology,Time-delays,Finite fields | Consensus,Topology,Finite field,Matrix (mathematics),Control theory,Mathematics,Computation,Alphabet | Journal |
Volume | Issue | ISSN |
68 | 1 | 0005-1098 |
Citations | PageRank | References |
8 | 0.50 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiuxian Li | 1 | 8 | 0.50 |
| Michael Z. Q. Chen | 2 | 834 | 41.20 |
| Housheng Su | 3 | 1360 | 83.94 |
| Chanying Li | 4 | 63 | 8.44 |