Asymptotical rotating consensus algorithm with processing delay

Abstract

Abstract In this paper, we studied some consensus algorithms for the collective rotating motions of a team of agents, which has been widely studied in different disciplines ranging from physics, networks and engineering. Both discrete and continues consensus algorithm with processing delays are investigated. There are three motion patterns determined by the information exchange topology of systems and rotation angle of rotation matrices. The asymptotic consensus appears when 0 is an simple eigenvalue of Laplacian matrix and the rotation angle is less than the critical value, and the rotating consensus achieves when the rotation angle is equal to the critical value. At this point, all agents move on circular orbits and the relative radii of orbits are equal to the relative magnitudes of the components of a right eigenvector associated with 0 eigenvalue of the non-symmetric Laplacian matrix. Finally, all agents move along logarithmic spiral curves with a fixed center when the rotation angle is larger than the critical value.