Monte Carlo Tree Search on Directed Acyclic Graphs for Object Pose Verification

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Reliable object pose estimation is an integral part of robotic vision systems as it enables robots to manipulate their surroundings. Powerful methods exist that estimate object poses from RGB and RGB-D images, yielding a set of hypotheses per object. However, determining the best hypotheses from the set of possible combinations is a challenging task. We apply MCTS to this problem to find an optimal solution in limited time and propose to share information between equivalent object combinations that emerge during the tree search, so-called transpositions. Thereby, the number of combinations that need to be considered is reduced and the search gathers information on these transpositions in a single statistic. We evaluate the resulting verification method on the YCB-VIDEO dataset and show more reliable detection of the best solution as compared to state of the art. In addition, we report a significant speed-up compared to previous MCTS-based methods for object pose verification.

Cite

CITATION STYLE

APA

Bauer, D., Patten, T., & Vincze, M. (2019). Monte Carlo Tree Search on Directed Acyclic Graphs for Object Pose Verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11754 LNCS, pp. 386–396). Springer. https://doi.org/10.1007/978-3-030-34995-0_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free