Abstract
This paper studies a distributed L2−L∞ containment control problem with or without considering nonconvex control input constraints. The main challenge is how to address nonconvex constraints while satisfying the L2−L∞ performance index function. A distributed algorithm is proposed using only the local information, and the containment control problem with nonconvex constraints and L2−L∞ performance can be solved. Based on the properties of the projection operator and convexity, the constrained L2−L∞ containment control problem can be solved under the undirected connected graphs. Finally, the effectiveness of the algorithm is verified by a numerical experiment.
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.
