Abstract
This paper investigates the consensus of finite-field networks with switching topologies and linear protocols by using the semi-tensor product (STP) method, and presents a number of new results. First, an algebraic form of finite-field networks with switching topologies and linear protocols is obtained via STP. Second, based on the algebraic form and the switching point reachability, a necessary and sufficient condition is presented for the consensus of finite-field networks under arbitrary switching signal. Finally, an illustrative example is given to verify the obtained new results. The study of the illustrative example shows that the new results presented in this paper are very effective in the consensus analysis of finite-field networks with switching topologies and linear protocols under arbitrary switching signal.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
