This paper investigates how to choose pinned node set to maximize the convergence rate of multiagent systems under digraph topologies in cases of sufficiently small and large pinning strength. In the case of sufficiently small pinning strength, perturbation methods are employed to derive formulas in terms of asymptotics that indicate that the left eigenvector corresponding to eigenvalue zero of the Laplacian measures the importance of node in pinning control multiagent systems if the underlying network has a spanning tree, whereas for the network with no spanning trees, the left eigenvectors of the Laplacian matrix corresponding to eigenvalue zero can be used to select the optimal pinned node set. In the case of sufficiently large pinning strength, by the similar method, a metric based on the smallest real part of eigenvalues of the Laplacian submatrix corresponding to the unpinned nodes is used to measure the stabilizability of the pinned node set. Different algorithms that are applicable for different scenarios are develped. Several numerical simulations are given to verify theoretical results.
展开▼
