Tidiness Score-Guided Monte Carlo Tree Search for Visual Tabletop Rearrangement

2025-02-24 · Hogun Kee, Wooseok Oh, Minjae Kang, Hyemin Ahn, Songhwai Oh

In this paper, we present the tidiness score-guided Monte Carlo tree search (TSMCTS), a novel framework designed to address the tabletop tidying up problem using only an RGB-D camera. We address two major problems for tabletop tidying up problem: (1) the lack of public datasets and benchmarks, and (2) the difficulty of specifying the goal configuration of unseen objects. We address the former by presenting the tabletop tidying up (TTU) dataset, a structured dataset collected in simulation. Using this dataset, we train a vision-based discriminator capable of predicting the tidiness score. This discriminator can consistently evaluate the degree of tidiness across unseen configurations, including real-world scenes. Addressing the second problem, we employ Monte Carlo tree search (MCTS) to find tidying trajectories without specifying explicit goals. Instead of providing specific goals, we demonstrate that our MCTS-based planner can find diverse tidied configurations using the tidiness score as a guidance. Consequently, we propose TSMCTS, which integrates a tidiness discriminator with an MCTS-based tidying planner to find optimal tidied arrangements. TSMCTS has successfully demonstrated its capability across various environments, including coffee tables, dining tables, office desks, and bathrooms. The TTU dataset is available at: https://github.com/rllab-snu/TTU-Dataset.

📄 PDF Abstract BibTeX arXiv:2502.17235

Code (1)

rllab-snu/ttu-dataset 공식 구현

"Tidy Up the Table": Grounding Common-sense Objective for Tabletop Object Rearrangement

2023-07-21 · Yiqing Xu, David Hsu

Tidying up a messy table may appear simple for humans, but articulating clear criteria for tidiness is challenging due to the ambiguous nature of common sense reasoning. Large Language Models (LLMs) have proven capable o…

Common Sense Reasoning Object Rearrangement

NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search

2026-05-01 · Sizhe Tang, Zuyuan Zhang, Mahdi Imani, Tian Lan arxiv

Monte Carlo Tree Search (MCTS) scales poorly in cooperative multi-agent domains because expansion must consider an exponentially large set of joint actions, severely limiting exploration under realistic search budgets. W…

StarCraft II Build Order Optimization using Deep Reinforcement Learning and Monte-Carlo Tree Search

2020-06-12 · Islam Elnabarawy, Kristijana Arroyo, Donald C. Wunsch II

The real-time strategy game of StarCraft II has been posed as a challenge for reinforcement learning by Google's DeepMind. This study examines the use of an agent based on the Monte-Carlo Tree Search algorithm for optimi…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+2

Retrosynthetic Planning with Experience-Guided Monte Carlo Tree Search

2021-12-11 · Siqi Hong, Hankz Hankui Zhuo, Kebing Jin, Guang Shao 외

In retrosynthetic planning, the huge number of possible routes to synthesize a complex molecule using simple building blocks leads to a combinatorial explosion of possibilities. Even experienced chemists often have diffi…

Multi-step retrosynthesis

Limits of PRM-Guided Tree Search for Mathematical Reasoning with LLMs

2025-10-23 · Tristan Cinquin, Geoff Pleiss, Agustinus Kristiadi arxiv

While chain-of-thought prompting with Best-of-N (BoN) selection has become popular for mathematical reasoning in large language models (LLMs), its linear structure fails to capture the branching and exploratory nature of…

Mathematical Reasoning