摘要

This paper considers the flocking of multi-agents. A new flocking algorithm with bounded potential function is proposed. Using the flocking algorithm, it is proved that the distance between agents can be larger than a constant r during the motion evolution and all agents' velocities become asymptotically the same. If the initial communication graph is connected, then it remains connected throughout the system evolution.

  • 出版日期2013

全文