Pith. sign in

REVIEW 1 cited by

CaTGrasp: Learning Category-Level Task-Relevant Grasping in Clutter from Simulation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.09163 v2 pith:T5RF7DN6 submitted 2021-09-19 cs.RO cs.AIcs.CVcs.SYeess.SY

classification cs.ROcs.AIcs.CVcs.SYeess.SY
keywords task-relevantframeworkgraspinggraspsindustrialsimulationcatgraspdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Task-relevant grasping is critical for industrial assembly, where downstream manipulation tasks constrain the set of valid grasps. Learning how to perform this task, however, is challenging, since task-relevant grasp labels are hard to define and annotate. There is also yet no consensus on proper representations for modeling or off-the-shelf tools for performing task-relevant grasps. This work proposes a framework to learn task-relevant grasping for industrial objects without the need of time-consuming real-world data collection or manual annotation. To achieve this, the entire framework is trained solely in simulation, including supervised training with synthetic label generation and self-supervised, hand-object interaction. In the context of this framework, this paper proposes a novel, object-centric canonical representation at the category level, which allows establishing dense correspondence across object instances and transferring task-relevant grasps to novel instances. Extensive experiments on task-relevant grasping of densely-cluttered industrial objects are conducted in both simulation and real-world setups, demonstrating the effectiveness of the proposed framework. Code and data are available at https://sites.google.com/view/catgrasp.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions

    cs.RO 2024-12 conditional novelty 2.0 of 10

    Running-buffer minimization for tabletop rearrangement is NP-hard, can require Ω(√n) buffers even for identical cylinders in the worst case, and exact search algorithms scale to over 100 objects.

Pith tools