Official URL: http://www.elsevier.com/wps/find/journaldescriptio...

This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of casual iterations. The approach taken here adopts an infinite-time setting and looks at limit behavior.The first part of the paper considers iterations without current-cycle-feedback (CCF) term. A notion of admissibility is introduced to distinguish between pairs of operators that define a rebustly converging iteration and pairs that do not. The set of admissible pairs is partitioned into disjoint equivalence classes. Different members of an equivalence class are shown to correspond to different realizations of a feedback controller. Conversely, every stabilizing controller is shown to allow for a (non-unique) factorization in terms of admissible pairs. Class representatives are introduced to remove redundancy. The smaller set of representative pairs is shown to have a trivial parameterization that concides with the Youla parameterization of all stabilizing controllers (stable plant case). The second part of the paper considers the general family of CCF-iterations. Results derived in the non-CCF case carry over, with the execption that the set of equivalent controllers now forms but a subset of all stabilizing controllers. Necessary and sufficient conditions for full generalization are given.