Abstract
In this paper, we investigate the controllability problem of multi-agent systems with switching topology over finite fields.The multi-agent system is defined over finite fields, where agents process only values from a finite alphabet.Under leader-follower structure, one agent is selected as a leader for each subsystem.First, we prove that a multi-agent system with switchingtopology is controllable over a finite field if the graph of the subsystemis a spanning forest, and the size of the field is sufficiently large.Second, we show that, by appropriately selecting leaders, the multi-agent system with switching topology can becontrollable over a finite field even if each of its subsystems is not controllable.Specifically, we show that the number of leaders for ensuring controllability of theswitched multi-agent system is less thanthe minimum number of leaders for ensuring the controllability of all subsystems.Finally, it is proved that the multi-agent system iscontrollable over a finite field if the union of the graphs is a directed path graph or a star graph.
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.
