Abstract
In this paper, we study a convexified robust control problem and its relation to gain-scheduling control. It reveals that the robust control synthesis condition becomes convex under a special plant structure. Moreover, for this class of robust control problems, the gain-scheduling control approach from scaled small-gain theorem will not provide any performance improvement over convexified robust controllers. Based on this observation, a convexified robust control synthesis framework with stringent performance and computational efficacy is proposed.
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.
