The reviewed record of science sign in
Pith

arxiv: 2409.14562 · v4 · pith:UUCPM7KH · submitted 2024-09-22 · cs.RO

DROP: Dexterous Reorientation via Online Planning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:UUCPM7KHrecord.jsonopen to challenge →

classification cs.RO
keywords contact-richonlineplanningapproachcontroldropperformancereorientation
0
0 comments X
read the original abstract

Achieving human-like dexterity is a longstanding challenge in robotics, in part due to the complexity of planning and control for contact-rich systems. In reinforcement learning (RL), one popular approach has been to use massively-parallelized, domain-randomized simulations to learn a policy offline over a vast array of contact conditions, allowing robust sim-to-real transfer. Inspired by recent advances in real-time parallel simulation, this work considers instead the viability of online planning methods for contact-rich manipulation by studying the well-known in-hand cube reorientation task. We propose a simple architecture that employs a sampling-based predictive controller and vision-based pose estimator to search for contact-rich control actions online. We conduct thorough experiments to assess the real-world performance of our method, architectural design choices, and key factors for robustness, demonstrating that our simple sampling-based approach achieves performance comparable to prior RL-based works. Supplemental material: https://caltech-amber.github.io/drop.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Approximating Global Contact-Implicit MPC via Sampling and Local Complementarity

    cs.RO 2025-05 conditional novelty 7.0

    A hybrid controller samples low-dimensional end-effector targets for a contact-free stage then runs local complementarity MPC at each sample to approximate global contact-implicit optimization.

  2. Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing

    cs.LG 2026-05 unverdicted novelty 6.0

    Recasts sampling-based nonconvex optimization as smoothed gradient descent to obtain non-asymptotic convergence guarantees and introduces the DIDA annealed algorithm that converges to the global optimum.

  3. Sumo: Dynamic and Generalizable Whole-Body Loco-Manipulation

    cs.RO 2026-04 unverdicted novelty 6.0

    Test-time steering of pre-trained whole-body policies via sample-based planning lets legged robots generalize dynamic loco-manipulation to varied heavy objects and tasks without additional training or tuning.