Abstract
In this paper, the containment problem with nonconvex velocity constraints is studied for second-order discrete-time multiagent systems. A distributed projection-based 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 velocity-constrained 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. A simulation example is also included to elucidate the obtained 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.
