Skip to Main Content
Distributed consensus tracking is addressed in this paper for multi-agent systems with Lipschitz-type node dynamics. The main contribution of this work is solving the consensus tracking problem without the assumption that the topology among followers is strongly connected and fixed. By using tools from M-matrix theory, a class of consensus tracking protocols based only on the relative states among neighboring agents is designed. By appropriately constructing Lyapunov function, it is proved that consensus tracking in the closed-loop multi-agent systems with a fixed topology having a directed spanning tree can be achieved if the feedback gain matrix and the coupling strength are suitably selected. Furthermore, with the assumption that each possible topology contains a directed spanning tree, it is theoretically shown that consensus tracking under switching directed topologies can be achieved if the control parameters are suitably selected and the dwell time is larger than a positive threshold. The results are then extended to the case where the communication topology contains a directed spanning tree only frequently as the system evolves with time. Finally, some numerical simulations are given to verify the theoretical analysis.