A convex optimization design of robust iterative learning control for linear systems with iteration-varying parametric uncertainties

18Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a new robust iterative learning control (ILC) algorithm has been proposed for linear systems in the presence of iteration-varying parametric uncertainties. The robust ILC design is formulated as a min-max problem using a quadratic performance criterion subject to constraints of the control input update. An upper bound of the maximization problem is derived, then, the solution of the min-max problem is achieved by solving a minimization problem. Applying Lagrangian duality to this minimization problem results in a dual problem which can be reformulated as a convex optimization problem over linear matrix inequalities (LMIs). Next, we present an LMI-based algorithm for the robust ILC design and prove the convergence of the control input and the error. Finally, the proposed algorithm is applied to a distillation column to demonstrate its effectiveness. © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society.

Cite

CITATION STYLE

APA

Nguyen, D. H., & Banjerdpongchai, D. (2011). A convex optimization design of robust iterative learning control for linear systems with iteration-varying parametric uncertainties. Asian Journal of Control, 13(1), 75–84. https://doi.org/10.1002/asjc.266

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free