Abstract
In this paper, we study both the leaderless consensus problem and the leader-following consensus problem for linear discrete-time multi-agent systems under switching network topology. Under the assumption that the system matrix is marginally stable, we show that these two consensus problems can be solved via the state feedback protocols, provided that the dynamic graph is jointly connected. Our result will contain several existing results as special cases. The proof is based on the stability analysis of a class of linear discrete-time switched systems which may have some independent interest.
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.
