arXiv:2607. 01942v1 Announce Type: new Abstract: LLM-based agents have shown strong potential for solving complex multi-step tasks, yet existing performance improvements often rely on either scaling to larger backbone models or task-specific fine-tuning.
By Yue Zhang, Sihan Chen, Ziwen Huang, Hanyun Cui, Kangye Ji, Zhi Wang
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
A ReAct-style agent accumulates observations, intermediate results, and failed attempts in a single context. As this context grows, stale and off-path information consumes its limited capacity and obs...
arXiv:2610.20334v1 Announce Type: cross
Abstract: A ReAct-style agent accumulates observations, intermediate results, and failed attempts in a single context. As this context grows, stale and off-pat...
By Dongzhuo Li, Fangzhou Cheng, Weiwei Li, Kevin Han, Haixu Ma, Zhongchang Sun, Ruiyi Li, Serena Li, Xiangjun Fan, Lizhu Zhang, Yuandong Tian
arXiv:2607. 25853v1 Announce Type: new Abstract: Skills have become an important abstraction for enabling large language model (LLM) agents to reuse past experience in long-horizon interactive tasks.
By Yu Hao, Jinxuan Cai, Qi Zhang, Yawen Li, Zhiqiang Zhang, Chuan Shi, Cheng Yang
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:2603.05294v3 Announce Type: replace
Abstract: Existing LLM-based web agents struggle on complex, long-horizon tasks due to limited in-context memory, weak planning abilities, and greedy behavio...
By ELita Lobo, Xu Chen, Jingjing Meng, Nan Xi, Yang Jiao, Chirag Agarwal, Yair Zick, Yan Gao
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
arXiv:2606. 11680v1 Announce Type: new Abstract: Large language model (LLM) agents struggle with long-horizon tasks due to their inherent statelessness, requiring all task-relevant information to be encoded in growing input contexts.
By Hao-Lun Hsu, Nikki Lijing Kuang, Boyi Liu, Zhewei Yao, Yuxiong He
arXiv:2608. 15703v1 Announce Type: new Abstract: Large language model (LLM) agents often perform poorly on complex, long-horizon tasks because their context becomes increasingly cluttered over time.
By XinQi Wang, Jinwei Xiao, Sijia Cui, Hongming Zhang, Yanna Wang, Qingyang Zhang, Bo Xu
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.
Large language model (LLM) agents often perform poorly on complex, long-horizon tasks because their context becomes increasingly cluttered over time. As interactions accumulate, detailed execution tra...