Cited by 95Robot Manipulation and LearningSoft Robotics and ApplicationsReinforcement Learning in Robotics

SpeedFolding: Learning Efficient Bimanual Folding of Garments

Open access
Avigal, Yahav, Berscheid, Lars, Asfour, Tamim, Kröger, Torsten, Goldberg, Ken·2022·2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

Abstract

Folding garments reliably and efficiently is a long standing challenge in robotic manipulation due to the complex dynamics and high dimensional configuration space of garments. An intuitive approach is to initially manipulate the garment to a canonical smooth configuration before folding. In this work, we develop SpeedFolding, a reliable and efficient bimanual system, which given user-defined instructions as folding lines, manipulates an initially crumpled garment to (1) a smoothed and (2) a folded configuration. Our primary contribution is a novel neural network architecture that is able to predict pairs of gripper poses to parameterize a diverse set of bimanual action primitives. After learning from 4300 human- annotated and self-supervised actions, the robot is able to fold garments from a random initial configuration in under 120 s on average with a success rate of 93 %. Real-world experiments show that the system is able to generalize to unseen garments of different color, shape, and stiffness. While prior work achieved 3–6 Folds Per Hour (FPH), SpeedFolding achieves 30–40 FPH. See https://pantor.github.io/speedfolding for code, videos, and datasets.

Integrity signals

Registry

Crossref · 10.1109/iros47612.2022.9981402

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The number of bins needed to approximate a continuous action space grows exponentially with increasing dimensionality.

    “However, the number of bins needed to approximate a continuous action space grows exponentially with increasing dimensionality.”

    From Diffusion Policy: Visuomotor Policy Learning via Action Diffusion (2023) · cites this paper as Avigal et al. (2022)

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Avigal, Y., Berscheid, L., Asfour, T., Kröger, T., & Goldberg, K.
Affiliations
  • University of California, Berkeley (US)
  • Karlsruhe Institute of Technology (DE)
Venue
2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Publisher
IEEE
Published
2022-10-23
Pages
1-8
ISSN
2153-0858 (ISSN-L)
OpenAlex
W4312610897
Cited by
95
References
6
Citations by year
2026: 13 · 2025: 30 · 2024: 26 · 2023: 25 · 2022: 1
FWCI
31.29
Type
conference paper
Language
en
Open access
Locations
  • IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Robot Manipulation and Learning
  • Physical Sciences › Engineering › Biomedical Engineering › Soft Robotics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
Keywords
garment folding, bimanual manipulation, robotic manipulation, neural network architecture, self-supervised learning

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