Abstract
In this paper, the containment control was studied for high-order discrete-time multi-agent systems. A distributed algorithm is proposed for all followers to be gathered in the convex area formed by multiple stationary leaders. It is revealed that the algorithm can solve the containment problem with communication delays and switching networks provided that each follower has at least a directed path from some leaders to itself in the union of graphs. The main analysis approaches include model transformation techniques, Lyapunov function, and convexity analysis. Finally, a simulation is also given to show the theoretical result.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
