Distance constrained flocking of multi-agents with time delay

In this paper, flocking problem of multi-agents with time delay is investigated. A connectivity-preserving flocking algorithm with bounded potential function is proposed. Using the flocking algorithm, it is proved the distance between agents can be larger than a constant r during the motion evolution. Moreover all agents' velocities become asymptotically the same.