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

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

A Provably Stable Iterative Learning Controller for Continuum Soft Robots

Pierallini, Michele, Stella, Francesco, Angelini, Franco, Deutschmann, Bastian, Hughes, Josie, Bicchi, Antonio, Garabini, Manolo, Santina, Cosimo Della · 2023 · IEEE Robotics and Automation Letters

Abstract

Fully exploiting soft robots' capabilities requires devising strategies that can accurately control their movements with the limited amount of control sources available. This task is challenging for reasons including the hard-to-model dynamics, the system's underactuation, and the need of using a prominent feedforward control action to preserve the soft and safe robot behavior. To tackle this challenge, this letter proposes a purely feedforward iterative learning control algorithm that refines the torque action by leveraging both the knowledge of the model and data obtained from past experience. After presenting a 3D polynomial description of soft robots, we study their intrinsic properties, e.g., input-to-state stability, and we prove the convergence of the controller coping with locally Lipschitz nonlinearities. Finally, we validate the proposed approach through simulations and experiments involving multiple systems, trajectories, and in the case of external disturbances and model mismatches.

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.1109/lra.2023.3307007

Cites

1 of 1 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

Show all 1 references

Research works printed but not linked: 25

  1. 10.1109/TRO.2022.3231360 · DOI · Paper page
  2. 10.1109/MCS.2023.3253419 · DOI · Paper page
  3. 10.1109/ICRA.2019.8793653 · DOI
  4. 10.1371/journal.pone.0246102 · DOI · Paper page
  5. 10.1109/RoboSoft51838.2021.9479340 · DOI
  6. 10.1109/TRO.2018.2878318 · DOI · Paper page
  7. 10.1109/RoboSoft48309.2020.9116011 · DOI · Paper page
  8. 10.1177/0278364920907679 · DOI
  9. 10.1098/rspa.2022.0593 · DOI
  10. 10.1109/LRA.2022.3150829 · doi:10.1109/lra.2022.3150829
  11. 10.1002/aisy.202200024 · DOI
  12. 10.1109/TRO.2018.2830351 · DOI
  13. 10.1109/TSMC.2023.3234403 · DOI
  14. 10.1109/LRA.2019.2955936 · DOI
  15. 10.1177/0278364915587926 · DOI · Paper page
  16. 10.3390/mi13091532 · doi:10.3390/mi13091532
  17. 10.1109/RoboSoft55895.2023.10121939 · doi:10.1109/robosoft55895.2023.10121939
  18. 10.1109/LRA.2022.3192887 · doi:10.1109/lra.2022.3192887
  19. 10.1109/IROS40897.2019.8967668 · doi:10.1109/iros40897.2019.8967668
  20. 10.1109/ACCESS.2021.3124014 · doi:10.1109/access.2021.3124014
  21. 10.1109/IROS.1994.407375 · doi:10.1109/iros.1994.407375
  22. 10.1109/TNNLS.2019.2951752 · doi:10.1109/tnnls.2019.2951752
  23. 10.1109/RoboSoft54090.2022.9762144 · DOI
  24. 10.1109/LRA.2020.2967269 · DOI · Paper page
  25. 10.1007/978-3-030-71151-1_48 · doi:10.1007/978-3-030-71151-1_48

Metadata

Authors
Pierallini, M., Stella, F., Angelini, F., Deutschmann, B., Hughes, J., Bicchi, A., Garabini, M., & Santina, C. D.
Venue
IEEE Robotics and Automation Letters
Published
2023-10
Volume
8
Issue
10
Pages
6427-6434
ISSN
  • 2377-3766
  • 2377-3774
Cited by
20
References
1

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Provably Stable Iterative Learning Controller for Continuum Soft Robots. https://app.cochat.ai/papers/10.1109/lra.2023.3307007
The paper
Pierallini, M., Stella, F., Angelini, F., Deutschmann, B., Hughes, J., Bicchi, A., Garabini, M., & Santina, C. D. (2023). A Provably Stable Iterative Learning Controller for Continuum Soft Robots. IEEE Robotics and Automation Letters. https://doi.org/10.1109/lra.2023.3307007

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.