arXiv AI

AtomTree: A Hierarchical Framework for State-Aware Embodied Instruction Following with LLMs

AtomTree is a hierarchical framework that enables state-aware task planning for embodied instruction following using large language models (LLMs). It incrementally constructs a tree of subgoals and actions, allowing the LLM to decide at each step whether to decompose further or output a grounded low-level action based on the current symbolic state. The system includes a lightweight memory module to summarize past outcomes and employs hierarchical backtracking replanning when a low-level action stalls, thereby preventing drift along incorrect trajectories. In zero-shot evaluation on the ALFRED benchmark, AtomTree outperforms prior LLM-based planners.

arXiv Computation and Language
Oct 23

MemPlan: Memory-Conditioned PDDL Planning for Partially Observable Text Environments

MemPlan is a memory‑conditioned PDDL planning framework designed for partially observable interactive text environments. It keeps the PDDL domain fixed and reconstructs the problem at each step using parsed observations, candidate hypotheses, and interaction memory, employing positive graph memory to assign relevance‑based action costs and negative memory to record refuted assumptions as exclusion constraints. Experiments on TextWorld, ALFWorld, and Robotouille demonstrate that MemPlan improves task completion and step efficiency over language‑only and PDDL‑aware baselines while significantly reducing online token cost compared with LLM‑planning baselines such as ReAct, and its fine‑tuned interface generalizes across task types without task‑specific fine‑tuning.

By Tengwei Song, Robert Hoehndorf
arXiv AI
Oct 26

LeafSkill: Efficient Leaf-Level Action Grounding for Recursive LLM Agents

LeafSkill introduces an external reuse layer for recursive LLM agents that retrieves semantically related action grounding experiences, binds action templates to current objects, and uses a lightweight 1.7B selector to choose or defer actions. This approach preserves high coverage of candidate actions under paraphrases (96–97%) and achieves a 97.34% adoption rate of unseen skill types. In experiments on Robotouille tasks, LeafSkill outperforms ReCAP, completing more tasks and reducing token usage and calls by over 14%.

By Shen Liu, Ze Zhou, Zhenguo Xu, Shaopu Wang, Yike Gao, Chunlei Wang
arXiv AI
Jun 6

Beyond Semantic Organization: Memory as Execution State Management for Long-Horizon Agents

arXiv:2606. 06090v1 Announce Type: new Abstract: LLM-based agents increasingly tackle long-horizon tasks with interdependent decisions, where each action reshapes future constraints and intermediate errors can cascade.

By Yaoqi Chen, Haibin Lai, Yuru Feng, Chuyu Han, Qianxi Zhang, Baotong Lu, Menghao Li, Xinjiang Wang, Zhirui Wang, Shusen Xu, Zengzhong Li, Zewen Jin, Hao Wu, Cheng Li, Qi Chen
Hugging Face Trending Papers
Jul 9

GATS: Graph-Augmented Tree Search with Layered World Models for Efficient Agent Planning

Large Language Model (LLM) agents have shown promise in multi-step planning tasks, but existing approaches like LATS (Language Agent Tree Search) and ReAct rely heavily on LLM inference during planning, leading to high computational costs and stochastic behavior. We present \textbf{GATS} (Graph-Augmented Tree Search), a planning framework that combines systematic UCB1-based tree search with a layered world model to eliminate LLM calls during inference while achieving superior planning performance.