TY - JOUR
T1 - Robust iterative learning control for linear systems with multiple time-invariant parametric uncertainties
AU - Nguyen, Dinh Hoa
AU - Banjerdpongchai, David
N1 - Funding Information:
We gratefully acknowledge the financial support from JICA project for AUN/SEED-Net through collaborative research program and the facility from the Faculty of Electrical Engineering, Department of Automatic Control, Hanoi University of Technology, and the Faculty of Engineering, Department of Electrical Engineering, Chulalongkorn University. We also thank anonymous reviewers for useful comments and suggestions.
PY - 2010/12
Y1 - 2010/12
N2 - This article presents a novel robust iterative learning control algorithm (ILC) for linear systems in the presence of multiple time-invariant parametric uncertainties.The robust design problem is formulated as a min-max problem with a quadratic performance criterion subject to constraints of the iterative control input update. Then, we propose a new methodology to find a sub-optimal solution of the min-max problem. By finding an upper bound of the worst-case performance, the min-max problem is relaxed to be a minimisation problem. Applying Lagrangian duality to this minimisation problem leads to a dual problem which can be reformulated as a convex optimisation problem over linear matrix inequalities (LMIs). An LMI-based ILC algorithm is given afterward and the convergence of the control input as well as the system error are proved. Finally, we apply the proposed ILC to a generic example and a distillation column. The numerical results reveal the effectiveness of the LMI-based algorithm.
AB - This article presents a novel robust iterative learning control algorithm (ILC) for linear systems in the presence of multiple time-invariant parametric uncertainties.The robust design problem is formulated as a min-max problem with a quadratic performance criterion subject to constraints of the iterative control input update. Then, we propose a new methodology to find a sub-optimal solution of the min-max problem. By finding an upper bound of the worst-case performance, the min-max problem is relaxed to be a minimisation problem. Applying Lagrangian duality to this minimisation problem leads to a dual problem which can be reformulated as a convex optimisation problem over linear matrix inequalities (LMIs). An LMI-based ILC algorithm is given afterward and the convergence of the control input as well as the system error are proved. Finally, we apply the proposed ILC to a generic example and a distillation column. The numerical results reveal the effectiveness of the LMI-based algorithm.
UR - http://www.scopus.com/inward/record.url?scp=78650340270&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650340270&partnerID=8YFLogxK
U2 - 10.1080/00207179.2010.531398
DO - 10.1080/00207179.2010.531398
M3 - Article
AN - SCOPUS:78650340270
SN - 0020-7179
VL - 83
SP - 2506
EP - 2518
JO - International Journal of Control
JF - International Journal of Control
IS - 12
ER -