Abstract
In this paper we consider the problem of designing an observer-based controller for switched linear systems under arbitrary switching, with guaranteed l∞ → l∞ performance. It is shown that, by using the concepts of polyhedral Lyapunov functions and superstability, the problem can be recast into a nonconvex constrained Polynomial Optimization Problem (POP). In turn, this problem can be relaxed into a sequence of convex Semi-Definite Programs (SDPs) by resorting to moments-based polynomial optimization techniques. Further, by exploiting the sparsity pattern exhibited by the problem, we show that the original POP can be equivalently reformulated as an SDP problem with a rank-1 constraint. An efficient algorithm is proposed to solve the later, by seeking low rank solution through re-weighted nuclear norm minimization.
Sign-in/Register to access full text options 
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.
