Abstract

This paper presents a robust fixed order compensator design for the H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> /H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> control problem. The design uses an approximate Loop Transfer Recovery (LTR) method to achieve performance robustness to unstructured uncertainty at the plant output. To provide robustness to the real structured uncertainty, the performance index is modified to include a penalty on the closed loop sensitivity dynamics. The formulation avoids the explicit introduction of the sensitivity states into the performance index, and thus, the formulation does not increase the overall dimension of the problem. A brief outline of the design procedure is as follows. First, full state gains are designed for the dual system which is the equivalent of designing a full order observer. Next, the loop characteristics at the dual system input are approximated with an observer canonical compensator. After the loop transfer functions is sufficiently recovered, then the penalty on the sensitivity dynamics is introduced. Finally the optimal gains are implemented in the dual compensator, which is the controller form. The implemented compensator ensured tracking performance and robustness to unstructured uncertainty as well as robustness to the structured parameter variations resulting from the uncertain spring stiffness.

Full Text
Paper version not known

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 call

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.