On consensus speed of multi-agent systems with double-integrator dynamics

The performance of multi-agent systems is an important issue. In this paper, it is focused on consensus speed for multi-agent systems with double-integrator dynamics and fixed undirected graphes under a kind of consensus protocols. It is revealed that, under some conditions, the maximum consensus speed is determined by the largest and the smallest nonzero eigenvalues of the Laplacian matrix of the undirected connected graph. Based on the mentioned results, arbitrary desired consensus speed can be achieved by choosing suitable feedback gains. Numerical simulations are given to illustrate the main results.