Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
In this paper it is shown how Stochastic Approximation theory can be used to derive and analyse well-known Iterative Learning Control algorithms for linear systems. The Stochastic Approximation theory gives conditions that, when satisfied, ensure almost sure convergence of the algorithms to the optimal input in the presence of stochastic disturbances. The practical issues of monotonic convergence and robustness to model uncertainty are considered. Specific choices of the learning matrix are studied, as well as a model-free choice. Moreover, the model-free method is applied to a linear motor system, leading to greatly improved tracking.
John Richard Thome, Gustavo Rabello Dos Anjos, Gustavo Charles Peixoto de Oliveira