Leader–Follower Consensus Over Finite Fields
- 15 January 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (7) , 4718-4725
Abstract
In this paper, we investigate the leader-follower consensus of multi-agent systems over finite fields, which model agents with limited capacities for storing, processing, and transmitting the information, from the perspectives of the transition graph and the characteristic polynomial of the network matrix, respectively. By the features of dynamics over finite fields, we reveal that the transition graph of networks achieving the leader-follower consensus over finite fields is either a spanning in-tree topped at zero-state or is composed of spanning in-trees with the same structure, topped at steady states. To address the high time complexity associated with transition graphs and existing methods, we integrate the characteristic polynomial of the network matrix with the cycle and tree structures in the transition graph. As a result, a concise criterion is established only based on the characteristic polynomial, which merely requires polynomial computational complexity with respect to the number of network nodes. Finally, a numerical example is presented to validate the effectiveness of the obtained theoretical results.Keywords
Funding Information
- National Natural Science Foundation of China (61833005, 62273286, GRF17201820)
- Jiangsu Provincial Key Laboratory of Networked Collective Intelligence (BM2017002)
- JST FOREST ProgramJPMJFR2123
- ARTIQ (UMO-2021/01/2/ST6/00004, ARTIQ/0004/2021)
This publication has 46 references indexed in Scilit:
- Containment problem of finite-field networks with fixed and switching topologyApplied Mathematics and Computation, 2021
- Controllability of Markovian jump Boolean control networksAutomatica, 2019
- Controllability analysis of multi-agent systems with switching topology over finite fieldsScience China Information Sciences, 2018
- Consensus networks with switching topology and time-delays over finite fieldsAutomatica, 2016
- Consensus networks over finite fieldsAutomatica, 2014
- Analysis and Control of Boolean Networks2011
- Distributed Coordination of Multi-agent Networks2011
- Tracking control for multi-agent consensus with an active leader and variable topologyAutomatica, 2006
- Algebraic Graph Theory2001
- Analysis and Design of Stream Ciphers1986