Consensus networks with switching topology and time-delays over finite fields

• Xiuxian Li ^[1] ; Michael Z.Q. Chen ^[1] ; Housheng Su ^[2] ; Chanying Li ^[3]
  1. [1] University of Hong Kong

     University of Hong Kong

     RAE de Hong Kong (China)

     
  2. [2] Huazhong University of Science and Technology

     Huazhong University of Science and Technology

     China

     
  3. [3] Chinese Academy of Sciences,China

  Mostrar afiliaciones +
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 68, 2016, págs. 39-43
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.