94,001 research outputs found

    A 2D systems approach to iterative learning control for discrete linear processes with zero Markov parameters

    No full text
    In this paper a new approach to iterative learning control for the practically relevant case of deterministic discrete linear plants with uniform rank greater than unity is developed. The analysis is undertaken in a 2D systems setting that, by using a strong form of stability for linear repetitive processes, allows simultaneous con-sideration of both trial-to-trial error convergence and along the trial performance, resulting in design algorithms that can be computed using Linear Matrix Inequalities (LMIs). Finally, the control laws are experimentally verified on a gantry robot that replicates a pick and place operation commonly found in a number of applications to which iterative learning control is applicable

    Iterative nonlinear model predictive control of a PH reactor. A comparative analysis

    Get PDF
    IFAC WORLD CONGRESS (16) (16.2005.PRAGA, REPÚBLICA CHECA)This paper describes the control of a batch pH reactor by a nonlinear predictive controller that improves performance by using data of past batches. The control strategy combines the feedback features of a nonlinear predictive controller with the learning capabilities of run-to-run control. The inclusion of real-time data collected during the on-going batch run in addition to those from the past runs make the control strategy capable not only of eliminating repeated errors but also of responding to new disturbances that occur during the run. The paper uses these ideas to devise an integrated controller that increases the capabilities of Nonlinear Model Predictive Control (NMPC) with batch-wise learning. This controller tries to improve existing strategies by the use of a nonlinear controller devised along the last-run trajectory as well as by the inclusion of filters. A comparison with a similar controller based upon a linear model is performed. Simulation results are presented in order to illustrate performance improvements that can be achieved by the new method over the conventional iterative controllers. Although the controller is designed for discrete-time systems, it can be applied to stable continuous plants after discretization

    Robust gradient-based discrete-time iterative learning control algorithms

    Get PDF
    This paper considers the use of matrix models and the robustness of a gradient-based Iterative Learning Control (ILC) algorithm using both fixed learning gains and gains derived from parameter optimization. The philosophy of the paper is to ensure monotonic convergence with respect to the mean square value of the error time series. The paper provides a complete and rigorous analysis for the systematic use of matrix models in ILC. Matrix models make analysis clearer and provide necessary and sufficient conditions for robust monotonic convergence. They also permit the construction of sufficient frequency domain conditions for robust monotonic convergence on finite time intervals for both causal and non-causal controller dynamics. The results are compared with recent results for robust inverse-model based ILC algorithms and it is seen that the algorithm has the potential to improve robustness to high frequency modelling errors provided that resonances within the plant bandwidth have been suppressed by feedback or series compensation

    Iterative learning control for constrained linear systems

    Get PDF
    This paper considers iterative learning control for linear systems with convex control input constraints. First, the constrained ILC problem is formulated in a novel successive projection framework. Then, based on this projection method, two algorithms are proposed to solve this constrained ILC problem. The results show that, when perfect tracking is possible, both algorithms can achieve perfect tracking. The two algorithms differ however in that one algorithm needs much less computation than the other. When perfect tracking is not possible, both algorithms can exhibit a form of practical convergence to a "best approximation". The effect of weighting matrices on the performance of the algorithms is also discussed and finally, numerical simulations are given to demonstrate the e®ectiveness of the proposed methods
    • …
    corecore