No abstract

No abstract

The containment problem is investigated for networked second‐order agents with nonuniform position and nonconvex velocity constraints under directed switching topologies. A distributed containment algorithm is designed for each agent to drive it into the convex target area formed by multiple leaders. The proposed control strategy only utilizes the information of each agent and its neighbor interaction. Theoretical analysis demonstrates that the constrained containment problem can be addressed only if each agent has a directed communication path from at least one leader to it in the union of the graphs. Finally, several numerical simulation results are presented to demonstrate the proposed control schemes.

No abstract