摘要

In this paper, based on the mathematically geometrical analysis of the vector chart yielded from the ordinary algorithm, we propose a kind of fast nonlinear algorithm of iterative learning control(ILC). Simulations show the advantage and effectiveness of our algorithm. Though this algorithm isn't (couldn't be) the best and fastest one in iterative learning control, it is, in fact, a break through to the restriction of Arimoto method. We hope it could be the initial structure of the geometrical theory of iterative learning control.