SOTAVerified

Coarse-to-Fine Q-attention: Efficient Learning for Visual Robotic Manipulation via Discretisation

2021-06-23CVPR 2022Code Available1· sign in to hype

Stephen James, Kentaro Wada, Tristan Laidlow, Andrew J. Davison

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We present a coarse-to-fine discretisation method that enables the use of discrete reinforcement learning approaches in place of unstable and data-inefficient actor-critic methods in continuous robotics domains. This approach builds on the recently released ARM algorithm, which replaces the continuous next-best pose agent with a discrete one, with coarse-to-fine Q-attention. Given a voxelised scene, coarse-to-fine Q-attention learns what part of the scene to 'zoom' into. When this 'zooming' behaviour is applied iteratively, it results in a near-lossless discretisation of the translation space, and allows the use of a discrete action, deep Q-learning method. We show that our new coarse-to-fine algorithm achieves state-of-the-art performance on several difficult sparsely rewarded RLBench vision-based robotics tasks, and can train real-world policies, tabula rasa, in a matter of minutes, with as little as 3 demonstrations.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
RLBenchC2FARM-BC (Evaluated in PerAct)Succ. Rate (18 tasks, 100 demo/task)20.1Unverified

Reproductions