On equivalence classes in iterative learning control

This paper advocates a new approach to study the relation between causal iterative learning control (ILC) and conventional feedback control. Central to this approach is the introduction of the set of admissible pairs (of operators) defined with respect to a family of iterations. Considered are two problem settings: standard ILC, which does not include a current cycle feedback (CCF) term and CCF-ILC, which does. By defining an equivalence relation on the set of admissible pairs, it is shown that in the standard ILC problem there exists a bijective map between the induced equivalence classes and the set of all stabilizing controllers. This yields the well-known Youla parameterization as a corollary. These results do not extend in full generality to the case of CCF-ILC; though gain every admissible pair defines a stabilizing equivalent controller, the converse is no longer true in general

On the parameterization of all admissible pairs in a class of CCF-ILC algorithms

This paper extends some recent results on the parameterization of all admissible pairs in a class of 2-parameter current-cycle-feedback ILC algorithms. In addition, a necessary and sufficient condition is given under which the associated set of equivalent controllers coincides with the set of all stabilizing controller

Relaxing Fundamental Assumptions in Iterative Learning Control

Iterative learning control (ILC) is perhaps best decribed as an open loop feedforward control technique where the feedforward signal is learned through repetition of a single task. As the name suggests, given a dynamic system operating on a finite time horizon with the same desired trajectory, ILC aims to iteratively construct the inverse image (or its approximation) of the desired trajectory to improve transient tracking. In the literature, ILC is often interpreted as feedback control in the iteration domain due to the fact that learning controllers use information from past trials to drive the tracking error towards zero. However, despite the significant body of literature and powerful features, ILC is yet to reach widespread adoption by the control community, due to several assumptions that restrict its generality when compared to feedback control. In this dissertation, we relax some of these assumptions, mainly the fundamental invariance assumption, and move from the idea of learning through repetition to two dimensional systems, specifically repetitive processes, that appear in the modeling of engineering applications such as additive manufacturing, and sketch out future research directions for increased practicality: We develop an L1 adaptive feedback control based ILC architecture for increased robustness, fast convergence, and high performance under time varying uncertainties and disturbances. Simulation studies of the behavior of this combined L1-ILC scheme under iteration varying uncertainties lead us to the robust stability analysis of iteration varying systems, where we show that these systems are guaranteed to be stable when the ILC update laws are designed to be robust, which can be done using existing methods from the literature. As a next step to the signal space approach adopted in the analysis of iteration varying systems, we shift the focus of our work to repetitive processes, and show that the exponential stability of a nonlinear repetitive system is equivalent to that of its linearization, and consequently uniform stability of the corresponding state space matrix.PhDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/133232/1/altin_1.pd

Simultaneous Iterative Learning and Feedback Control Design

Iterative learning controllers aim to produce high precision tracking in operations where the same tracking maneuver is repeated over and over again. Model-based iterative learning control laws are designed from the system Markov parameters which could be inaccurate. Chapter 2 examines several important learning control laws and develops an understanding of how and when inaccuracy in knowledge of the Markov parameters results in instability of the learning process. While an iterative learning controller can compensate for unknown repeating errors and disturbances, it is not suited to handle non-repeating, stochastic errors and disturbances, which can be more effectively handled by a feedback controller. Chapter 3 explores feedback and iterative learning combination controllers, showing how a one-time step behind disturbance estimator and one-repetition behind disturbance estimator can be incorporated together in such a combination. Since learning control applications are finite-time by their very nature, frequency response based design techniques are not best suited for designing the feedback controller in this context. A finite-time feedback controller design approach is more appropriate given the overall aim of zero tracking error for the entire trajectory, even for shorter trajectories where the system response is still in its transient phase and has not yet reached steady state. Chapter 4 presents a combination of finite-time feedback and learning control as a natural solution for such a control objective, showing how a finite-time feedback controller and an iterative learning controller can be simultaneously synthesized during the learning process. Finally, Chapter 5 examines different configurations where a combination of a feedback controller and an iterative learning controller can be implemented. Numerical results are used to illustrate the feedback and iterative controller designs developed in this thesis

Resource-aware motion control:feedforward, learning, and feedback

Controllers with new sampling schemes improve motion systems’ performanc

Iterative Learning Control design for uncertain and time-windowed systems

Iterative Learning Control (ILC) is a control strategy capable of dramatically increasing the performance of systems that perform batch repetitive tasks. This performance improvement is achieved by iteratively updating the command signal, using measured error data from previous trials, i.e., by learning from past experience. This thesis deals with ILC for time-windowed and uncertain systems. With the term "time-windowed systems", we mean systems in which actuation and measurement time intervals differ. With "uncertain systems", we refer to systems whose behavior is represented by incomplete or inaccurate models. To study the ILC design issues for time-windowed systems, we consider the task of residual vibration suppression in point-to-point motion problems. In this application, time windows are used to modify the original system to comply with the task. With the properties of the time-windowed system resulting in nonconverging behavior of the original ILC controlled system, we introduce a novel ILC design framework in which convergence can be achieved. Additionally, this framework reveals new design freedom in ILC for point-to-point motion problems, which is unknown in "standard" ILC. Theoretical results concerning the problem formulation and control design for these systems are supported by experimental results on a SISO and MIMO flexible structure. The analysis and design results of ILC for time-windowed systems are subsequently extended to the whole class of linear systems whose input and output are filtered with basis functions (which include time windows). Analysis and design theory of ILC for this class of systems reveals how different ILC objectives can be reached by design of separate parts of the ILC controller. Our research on ILC for uncertain systems is divided into two parts. In the first part, we formulate an approach to analyze the robustness properties of existing ILC controllers, using well developed µ theory. To exemplify our findings, we analyze the robustness properties of linear quadratic (LQ) norm optimal ILC controllers. Moreover, we show that the approach is applicable to the class of linear trial invariant ILC controlled systems with basis functions. In the second part, we present a finite time interval robust ILC control strategy that is robust against model uncertainty as given by an additive uncertainty model. For that, we exploit H1 control theory, however, modified such that the controller is not restricted to be causal and operates on a finite time interval. Furthermore, we optimize the robust controller so as to optimize performance while remaining robustly monotonically convergent. By means of experiments on a SISO flexible system, we show that this control strategy can indeed outperform LQ norm optimal ILC and causal robust ILC control strategies

An empirical Bayes approach to identification of modules in dynamic networks

We present a new method of identifying a specific module in a dynamic network, possibly with feedback loops. Assuming known topology, we express the dynamics by an acyclic network composed of two blocks where the first block accounts for the relation between the known reference signals and the input to the target module, while the second block contains the target module. Using an empirical Bayes approach, we model the first block as a Gaussian vector with covariance matrix (kernel) given by the recently introduced stable spline kernel. The parameters of the target module are estimated by solving a marginal likelihood problem with a novel iterative scheme based on the Expectation-Maximization algorithm. Additionally, we extend the method to include additional measurements downstream of the target module. Using Markov Chain Monte Carlo techniques, it is shown that the same iterative scheme can solve also this formulation. Numerical experiments illustrate the effectiveness of the proposed methods

Robust Network Reconstruction in Polynomial Time

This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work on robust reconstruction to provide a practical implementation with polynomial computational complexity. Following the same experimental protocol, the algorithm obtains a set of structurally-related candidate solutions spanning every level of sparsity. We prove the existence of a magnitude bound on the noise, which if satisfied, guarantees that one of these structures is the correct solution. A problem-specific model-selection procedure then selects a single solution from this set and provides a measure of confidence in that solution. Extensive simulations quantify the expected performance for different levels of noise and show that significantly more noise can be tolerated in comparison to the original method.Comment: 8 pages, to appear in 51st IEEE Conference on Decision and Contro