REVIEW 2 cited by
Dynamic On-Palm Manipulation via Controlled Sliding
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
read the original abstract
Non-prehensile manipulation enables fast interactions with objects by circumventing the need to grasp and ungrasp as well as handling objects that cannot be grasped through force closure. Current approaches to non-prehensile manipulation focus on static contacts, avoiding the underactuation that comes with sliding. However, the ability to control sliding contact, essentially removing the no-slip constraint, opens up new possibilities in dynamic manipulation. In this paper, we explore a challenging dynamic non-prehensile manipulation task that requires the consideration of the full spectrum of hybrid contact modes. We leverage recent methods in contact-implicit MPC to handle the multi-modal planning aspect of the task. We demonstrate, with careful consideration of integration between the simple model used for MPC and the low-level tracking controller, how contact-implicit MPC can be adapted to dynamic tasks. Surprisingly, despite the known inaccuracies of frictional rigid contact models, our method is able to react to these inaccuracies while still quickly performing the task. Moreover, we do not use common aids such as reference trajectories or motion primitives, highlighting the generality of our approach. To the best of our knowledge, this is the first application of contact-implicit MPC to a dynamic manipulation task in three dimensions.
Forward citations
Cited by 2 Pith papers
-
Global Contact-Rich Planning with Sparsity-Rich Semidefinite Relaxations
Sparse semidefinite relaxations, exploiting correlative, term, and robotics-specific sparsity, solve contact-rich planning problems to certified near-global optimality in seconds for several benchmark tasks.
-
On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning
CRISP is a primal-only sequential convex programming solver with a weighted l1 penalty merit function that solves contact-implicit motion planning problems from all-zero initialization.
Discussion (0). Continue with ORCID to comment.