Abstract
This brief studies the constrained containment control problem of continuous-time multiagent systems with nonconvex states constraints, nonuniform time delays, and switching directed networks. A distributed containment control algorithm consisting of nonlinear projection, nonlinear constraints, and communication delays is proposed. Based on the model transformation technique, convex analysis method, and the Lyapunov function, we prove that all agents finally converge into the convex hull formed by the given stationary points with arbitrarily bounded communication delays and arbitrarily switching networks as long as each agent jointly has at least one path from the given points to itself. Finally, a numerical example is included to show the effectiveness of theoretical results.
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 callMore From: IEEE Transactions on Neural Networks and Learning Systems
Disclaimer: 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.
