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

Hoa Dinh Nguyen, David Banjerdpongchai

Research output: Contribution to journalArticle

9 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)75-84
Number of pages10
JournalAsian Journal of Control
Volume13
Issue number1
DOIs
Publication statusPublished - Jan 1 2011
Externally publishedYes

Fingerprint

Convex optimization
Linear systems
Linear matrix inequalities
Distillation columns
Uncertainty

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Cite this

A convex optimization design of robust iterative learning control for linear systems with iteration-varying parametric uncertainties. / Nguyen, Hoa Dinh; Banjerdpongchai, David.

In: Asian Journal of Control, Vol. 13, No. 1, 01.01.2011, p. 75-84.

Research output: Contribution to journalArticle

@article{2434c86268374078b160a8206921ba32,
title = "A convex optimization design of robust iterative learning control for linear systems with iteration-varying parametric uncertainties",
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.",
author = "Nguyen, {Hoa Dinh} and David Banjerdpongchai",
year = "2011",
month = "1",
day = "1",
doi = "10.1002/asjc.266",
language = "English",
volume = "13",
pages = "75--84",
journal = "Asian Journal of Control",
issn = "1561-8625",
publisher = "National Taiwan University (IEEB)",
number = "1",

}

TY - JOUR

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

AU - Nguyen, Hoa Dinh

AU - Banjerdpongchai, David

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79953816266&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953816266&partnerID=8YFLogxK

U2 - 10.1002/asjc.266

DO - 10.1002/asjc.266

M3 - Article

AN - SCOPUS:79953816266

VL - 13

SP - 75

EP - 84

JO - Asian Journal of Control

JF - Asian Journal of Control

SN - 1561-8625

IS - 1

ER -