Sejune Joo

Sejune Joo

Auto-generated profile, based on publicly available information

Sejune Joo

Graduate School of AI, Korea Advanced Institute of Science and Technology, Seoul, Korea

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 June 2025 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
DLDongryung Lee
Dongryung Lee
SJSejune Joo
Sejune Joo
KLKimin Lee
Kimin Lee
BKBeomjoon Kim
Beomjoon Kim
The problem of relocating a set of objects to designated areas amidst movable obstacles can be framed as a Geometric Task and Motion Planning ( g-tamp ), a subclass of task and motion planning problem (TAMP). Traditional approaches to g-tamp have relied either on domain-independent heuristics or on learning from planning experience to guide the search, both of which typically demand significant computational resources or data. In contrast, humans often use common sense to intuitively decide which objects to manipulate in g-tamp problems. Inspired by this, we propose leveraging Large Language Models (LLMs), which have common sense knowledge acquired from internet-scale data, to guide task planning in g-tamp problems. To enable LLMs to perform geometric reasoning, we design a predicate-based prompt that encodes geometric information derived from a motion planning algorithm. We then query the LLM to generate a task plan, which is then used to search for a feasible set of continuous parameters. Since LLM is prone to mistakes, instead of committing to LLM’s outputs we extend Monte Carlo Tree Search (MCTS) to a hybrid action space and use the LLM to guide the search. Unlike the previous approach that calls an LLM at every node and incurs high computational costs, we use it to warm-start the MCTS with the nodes explored in completing the LLM’s task plan. On six different g-tamp problems, we show our method outperforms previous LLM planners and pure search algorithms. Code can be found at https://github.com/iMSquared/prime-the-search .