Two consensus problems for discrete-time multi-agent systems with switching network topology

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.