Improving Large Language Model Planning with Action Sequence Similarity
Xinran Zhao, Hanie Sedghi, Bernd Bohnet, Dale Schuurmans, Azade Nova
TL;DR
This work tackles the problem of enhancing large language model planning by improving exemplar selection in in-context learning. It introduces Action Sequence Similarity (AS), based on the longest common ordered action sequence, as a robust signal to select exemplars, and presents GRASE-DC, a two-stage pipeline that generatively re-samples high-AS exemplars (GRASE) and dynamically clusters them (DC) to balance relevance and diversity. Empirical results across classical PDDL planning tasks and natural-language trip planning show substantial planning accuracy gains (up to 11–40 points) with fewer exemplars, and further improvements when combined with a validator (GRASE-DC* + VAL). The approach generalizes across backbone LLMs and supports out-of-distribution problems, with efficiency analyses and approximations (MLP, BPE-Proxy) offering practical trade-offs. Overall, AS-based exemplar selection provides a principled and scalable way to boost LLM planning in diverse settings.
Abstract
Planning is essential for artificial intelligence systems to look ahead and proactively determine a course of actions to reach objectives in the virtual and real world. Recent work on large language models (LLMs) sheds light on their planning capability in various tasks. However, it remains unclear what signals in the context influence the model performance. In this work, we explore how to improve the model planning capability through in-context learning (ICL), specifically, what signals can help select the exemplars. Through extensive experiments, we observe that commonly used problem similarity may result in false positives with drastically different plans, which can mislead the model. In response, we propose to sample and filter exemplars leveraging plan side action sequence similarity (AS). We propose GRASE-DC: a two-stage pipeline that first re-samples high AS exemplars and then curates the selected exemplars with dynamic clustering on AS to achieve a balance of relevance and diversity. Our experimental result confirms that GRASE-DC achieves significant performance improvement on various planning tasks (up to ~11-40 point absolute accuracy improvement with 27.3% fewer exemplars needed on average). With GRASE-DC* + VAL, where we iteratively apply GRASE-DC with a validator, we are able to even boost the performance by 18.9% more. Extensive analysis validates the consistent performance improvement of GRASE-DC with various backbone LLMs and on both classical planning and natural language planning benchmarks. GRASE-DC can further boost the planning accuracy by ~24 absolute points on harder problems using simpler problems as exemplars over a random baseline. This demonstrates its ability to generalize to out-of-distribution problems.
