Optimizing Robotic Placement via Grasp-Dependent Feasibility Prediction
Tianyuan Liu, Richard Dazeley, Benjamin Champion, Akan Cosgun
TL;DR
The paper tackles efficient robotic pick-and-place by learning to score precomputed grasp–place candidates using cheap, physics-free labels. It introduces two signals—path-wise IK feasibility and transit collision risk—learned by a compact dual-output MLP to rank candidates before planning. A rank-and-plan policy using an IK gate outperforms a baseline in physics-enabled execution under a fixed computational budget, delivering earlier successes and fewer planner calls. The approach is demonstrated on a single rigid cuboid with side-face grasps, with discussion of extensions to diversify objects and more complex waypoint schemes.
Abstract
In this paper, we study whether inexpensive, physics-free supervision can reliably prioritize grasp-place candidates for budget-aware pick-and-place. From an object's initial pose, target pose, and a candidate grasp, we generate two path-aware geometric labels: path-wise inverse kinematics (IK) feasibility across a fixed approach-grasp-lift waypoint template, and a transit collision flag from mesh sweeps along the same template. A compact dual-output MLP learns these signals from pose encodings, and at test time its scores rank precomputed candidates for a rank-then-plan policy under the same IK gate and planner as the baseline. Although learned from cheap labels only, the scores transfer to physics-enabled executed trajectories: at a fixed planning budget the policy finds successful paths sooner with fewer planner calls while keeping final success on par or better. This work targets a single rigid cuboid with side-face grasps and a fixed waypoint template, and we outline extensions to varied objects and richer waypoint schemes.
