3 citations · 5 across the 5 of their papers we have counts for
7 papers
Surfer-H Meets Holo1: Cost-Efficient Web Agent Powered by Open Weights
Mathieu Andreux, Breno Baldas Skuk, Hamza Benchekroun +41
We present Surfer-H, a cost-efficient web agent that integrates Vision-Language Models (VLM) to perform user-defined tasks on the web. We pair it with Holo1, a new open-weight coll…
BOP Challenge 2024 on Model-Based and Model-Free 6D Object Pose Estimation
Van Nguyen Nguyen, Stephen Tyree, Andrew Guo +16
We present the evaluation methodology, datasets and results of the BOP Challenge 2024, the 6th in a series of public competitions organized to capture the state of the art in 6D ob…
6D Object Pose Tracking in Internet Videos for Robotic Manipulation
Georgy Ponimatkin, Martin Cífka, Tomáš Souček +4
We seek to extract a temporally consistent 6D pose trajectory of a manipulated object from an Internet instructional video. This is a challenging set-up for current 6D pose estimat…
BOP Challenge 2023 on Detection, Segmentation and Pose Estimation of Seen and Unseen Rigid Objects
Tomas Hodan, Martin Sundermeyer, Yann Labbe +7
We present the evaluation methodology, datasets and results of the BOP Challenge 2023, the fifth in a series of public competitions organized to capture the state of the art in mod…
BOP Challenge 2022 on Detection, Segmentation and Pose Estimation of Specific Rigid Objects
Martin Sundermeyer, Tomas Hodan, Yann Labbe +5
We present the evaluation methodology, datasets and results of the BOP Challenge 2022, the fourth in a series of public competitions organized with the goal to capture the status q…
BOP Challenge 2020 on 6D Object Localization
Tomas Hodan, Martin Sundermeyer, Bertram Drost +5
This paper presents the evaluation methodology, datasets, and results of the BOP Challenge 2020, the third in a series of public competitions organized with the goal to capture the…
Monte-Carlo Tree Search for Efficient Visually Guided Rearrangement Planning
Yann Labbé, Sergey Zagoruyko, Igor Kalevatykh +4
We address the problem of visually guided rearrangement planning with many movable objects, i.e., finding a sequence of actions to move a set of objects from an initial arrangement…