Schooling for multi-agent systems via impulsive containment control algorithms with quantized information

In the paper, schooling problems based on containment control in multi-agent systems that have static or dynamic leaders under directed and undirected communication topologies are investigated. We propose a periodic impulsive containment control algorithm to realize schooling in multi-agent systems. Both ideal and quantized relative state measurements are considered under this framework. Some necessary and sufficient conditions, which depend on the eigenvalues of the Laplacian matrix that is associated with the communication graph, the impulsive period as well as the gain parameters, are obtained to realize the containment control of schooling. Finally, some numerical simulations are illustrated to verify the theoretical results.