English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This study addressed sufficient conditions for the robust monotonic convergence of repetitive discrete-time linear parameter varying systems, with the parameter variation rate bound. The learning law under consideration is an anticipatory iterative learning control. Of particular interest in this study is that the iterations can eliminate the influence of disturbances. Based on a simple quadratic performance function, a sufficient condition for the proposed learning algorithm is presented in terms of linear matrix inequality (LMI) by imposing a polytopic structure on the Lyapunov matrix. The set of LMIs to be determined considers the bounds on the rate of variation of the scheduling parameter. The control law designs polynomial ILC by constructing a sequence of control inputs to a discrete-time R-LPV system, producing an iterative dynamic for the R-LPV system with respect to the polytopic structure for uncertain parameters. Numerical simulations were performed to demonstrate the benefits of the proposed technique.

Robustness Convergence for Iterative Learning Tracking Control Applied to Repetitfs Systems