Abstract
The problem of robustness in the design of restricted complexity controllers is addressed. Starting from a full-order regulator, robustness considerations are incorporated into the controller reduction problem in order to produce an priori bound over the admissible degrees of approximation between the high-order and the low-order controllers. An example application is given to show the usefulness of the proposed methodology.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
