By Topic

Controller gain bounding in the minimal control synthesis algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. E. M. Sebusang ; Autom. Control Lab., Bristol Univ., UK ; D. P. Stoten

The minimal controller synthesis (MCS) algorithm is an extension of the class of model reference adaptive control (MRAC) algorithms that requires neither plant model identification nor linear controller synthesis. Various theoretical and experimental studies have shown it to possess the stability and robustness features essential to any successful adaptive control scheme. However, due to its high responsiveness to plant parameter variations and external disturbances, it can occasionally suffer from the long-term effects of measurement errors resulting in gain wind-up, closed-loop signal aliasing and hence instability. To counteract this effect, we propose an algorithm that extends MCS in such a way as to confine its adaptive gain evolutions by using automatically adjusting bounding corridors. The gain corridors MCS (GCMCS) algorithm that results does not suffer from error-boundedness or gain decay problems. Its name describes the controller's graphic functionality. In this paper, we extend the normal Popov criterion based stability proofs of MCS by including the consideration of plants with measurement or state errors, which had hitherto not been included. By working through this proof for single input single output (SISO) phase-variable plant structures, we show that the new algorithm retains the asymptotic properties of basic MCS and satisfies Popov's inequality under the assumed conditions of slower plant parameter variations relative to the controller bandwidth

Published in:

System Theory, 1998. Proceedings of the Thirtieth Southeastern Symposium on

Date of Conference:

8-10 Mar 1998