Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 406

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Iterative learning control for discrete-time systems with exponential rate of convergence

Amann, N., Owens, D.H., Rogers, E.·1996·IEE Proceedings - Control Theory and Applications

Abstract

An algorithm for iterative learning control is proposed based on an optimisation principle used by other authors to derive gradient-type algorithms. The new algorithm is a descent algorithm and has potential benefits which include realisation in terms of Riccati feedback and feedforward components. This realisation also has the advantage of implicitly ensuring automatic step-size selection and hence guaranteeing convergence without the need for empirical choice of parameters. The algorithm achieves a geometric rate of convergence for invertible plants. One important feature of the proposed algorithm is the dependence of the speed of convergence on weight parameters appearing in the norms of the signals chosen for the optimisation problem.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1049/ip-cta:19960244

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 406

Metadata

Authors
Amann, N., Owens, D. H., & Rogers, E.
Venue
IEE Proceedings - Control Theory and Applications
Published
1996-03-25
Volume
143
Issue
2
Pages
217-224
ISSN
  • 1350-2379 (ISSN-L)
  • 1359-7035
OpenAlex
W2063498039
Cited by
406
References
9
FWCI
7.84
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.