1. University of Electronic Science and Technology of China 2. School of Aeronautics and Astronautics, University of Electronic Science and Technology of China 3. 电子科技大学
Abstract This paper studies a collective surrounding motion problem for network with undirected and time-varying graphs, where the multiple targets are surrounded by agents. We first propose an algorithm to achieve the collective surrounding motion. Based on Lyapunov theory, graph theory and La Salle's Invariant Principle, a sufficient condition for the surrounding motion is established. Finally, some simulation results are provided to show effectiveness of the obtained theoretical results.
