Fully distributed robust consensus of LPV multi-agent systems

We consider the robust consensus problems of linear parameter varying (LPV) multi-agent systems in this paper. For multiple agents interplay on an undirected graph, sufficient conditions relating to the algebraic connectivity are provided for the robust consensus of the LPV system at first. Then, edge-based adaptive strategy and node-based adaptive one are both introduced to guarantee the robust consensus of the LPV multi-agent systems and simultaneously eliminate the dependence on the algebraic connectivity of the graph. Finally, numerical simulations will be given to prove the feasibility of the theoretical results obtained.