Pith. sign in

REVIEW 1 cited by

Persistent Homology for Effective Non-Prehensile Manipulation

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 2202.02937 v1 pith:CHPFJNVC submitted 2022-02-07 cs.RO

classification cs.RO
keywords actionshomologynon-prehensilepersistentpushingachievingclutteredconstrained
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This work explores the use of topological tools for achieving effective non-prehensile manipulation in cluttered, constrained workspaces. In particular, it proposes the use of persistent homology as a guiding principle in identifying the appropriate non-prehensile actions, such as pushing, to clean a cluttered space with a robotic arm so as to allow the retrieval of a target object. Persistent homology enables the automatic identification of connected components of blocking objects in the space without the need for manual input or tuning of parameters. The proposed algorithm uses this information to push groups of cylindrical objects together and aims to minimize the number of pushing actions needed to reach to the target. Simulated experiments in a physics engine using a model of the Baxter robot show that the proposed topology-driven solution is achieving significantly higher success rate in solving such constrained problems relatively to state-of-the-art alternatives from the literature. It manages to keep the number of pushing actions low, is computationally efficient and the resulting decisions and motion appear natural for effectively solving such tasks.

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