Optimizing for what matters: the Top Grasp Hypothesis

2016

Conference Paper

am

In this paper, we consider the problem of robotic grasping of objects when only partial and noisy sensor data of the environment is available. We are specifically interested in the problem of reliably selecting the best hypothesis from a whole set. This is commonly the case when trying to grasp an object for which we can only observe a partial point cloud from one viewpoint through noisy sensors. There will be many possible ways to successfully grasp this object, and even more which will fail. We propose a supervised learning method that is trained with a ranking loss. This explicitly encourages that the top-ranked training grasp in a hypothesis set is also positively labeled. We show how we adapt the standard ranking loss to work with data that has binary labels and explain the benefits of this formulation. Additionally, we show how we can efficiently optimize this loss with stochastic gradient descent. In quantitative experiments, we show that we can outperform previous models by a large margin.

@inproceedings{daniel_ICRA_2016,
  title = {Optimizing for what matters: the Top Grasp Hypothesis},
  author = {Kappler, Daniel and Schaal, Stefan and Bohg, Jeannette},
  booktitle = {Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2016},
  publisher = {IEEE},
  month = may,
  year = {2016},
  doi = {10.1109/ICRA.2016.7487367},
  month_numeric = {5}
}