Challenge: Existing plans for large language model-based agents are limited by their granularity and lack flexibility.
Approach: They propose a self-adaptive hierarchical planning mechanism that mimics human planning strategies and generates self-adapted hierarchic plans tailored to the varying difficulty levels of different tasks.
Outcome: The proposed method significantly improves task execution success rates while mitigating overthinking at the planning level, providing a flexible and efficient solution for multi-step complex decision-making tasks.

Similar Papers

DeepPlanner: Scaling Planning Capability for Deep Research Agents via Advantage Shaping (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to planning involve implicit planning or introduce explicit planners without systematically optimizing the planning stage.
Approach: They propose an end-to-end RL framework that enhances the planning capabilities of deep research agents.
Outcome: Experiments show that DeepPlanner improves planning quality and achieves state-of-the-art results under a lower training budget.
Why Do LLM-based Web Agents Fail? A Hierarchical Planning Perspective (2026.acl-long)

Copied to clipboard

Challenge: Existing evaluations focus primarily on end-to-end success, offering limited insight into where failures arise.
Approach: They propose a hierarchical planning framework that analyzes web agents across three layers . they show that structured Planning Domain Definition Language (PDDL) plans produce more concise and goal-directed strategies than natural language (NL) plans .
Outcome: The proposed framework analyzes web agents across three layers to improve reasoning, grounding, and recovery.
AutoPlan: Automatic Planning of Interactive Decision-Making Tasks With Large Language Models (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for making decisions in grounded environments require costly gradient computation or lengthy in-context demonstrations.
Approach: They propose an approach to guide LLM-based agents to accomplish interactive decision-making tasks by using an LLM prompt and a task-solving plan.
Outcome: The proposed approach outperforms human-written demonstrations on ALFWorld and HotpotQA by 8%.
Coarse-to-Fine Grounded Memory for LLM Agent Planning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to enhance LLM with offline experiences or online trajectory analysis focus on single-granularity memory derived from dynamic environmental interactions.
Approach: They propose a framework that grounds coarse-to-fine memories with LLM to enable flexible adaptation to diverse scenarios.
Outcome: Extensive experiments on AlfWorld, Webshop and ScienceWorld show that the proposed framework outperforms baselines and comprehensively optimizes memory-enhanced LLM Agent system.
KnowAgent: Knowledge-Augmented Planning for LLM-Based Agents (2025.findings-naacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) fail to effectively guide the planning trajectories during task solving and result in planning hallucinations.
Approach: They propose a novel approach to enhance the planning capabilities of large language models by incorporating explicit action knowledge.
Outcome: The proposed approach can achieve comparable or superior performance to existing baselines on HotpotQA and ALFWorld.
ADaPT: As-Needed Decomposition and Planning with Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment.
Approach: They propose an approach that explicitly plans and decomposes complex sub-tasks when the LLM is unable to execute them.
Outcome: The proposed approach significantly outperforms established strong baselines, achieving success rates up to 28.3% higher in ALFWorld, 27% in WebShop, and 33% in TextCraft.
Hierarchical Reinforcement Learning with Augmented Step-Level Transitions for LLM Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing Large language model agents rely on increasingly long interaction histories, resulting in high computational cost and limited scalability.
Approach: They propose a hierarchical reinforcement learning framework that enables step-level learning by conditioning only on single-step transitions rather than full interaction histories.
Outcome: The proposed framework outperforms baselines on ScienceWorld and ALFWorld benchmarks in terms of performance and generalization while reducing token usage.
Personal Large Language Model Agents: A Case Study on Tailored Travel Planning (2024.emnlp-industry)

Copied to clipboard

Challenge: Large Language Models (LLMs) are becoming more autonomous and capable of handling real-world tasks through their access to tools, various planning strategies, and memory, referred to as LLM agents.
Approach: They introduce a personalized version of TravelPlanner and establish baselines for personal LLM agents by comparing generic and personal plans.
Outcome: The proposed model encapsulates user-related information, preferences, and personal concepts and provides baselines for personal LLM agents.
Unlocking the Future: Exploring Look-Ahead Planning Mechanistic Interpretability in Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that large language models may possess preliminary planning capabilities.
Approach: They examine the look-ahead planning mechanism in large language models from the perspectives of information flow and internal representations.
Outcome: The proposed model can decode the decision from the output of MHSA in the middle layers at the last token.
Dynamic Planning for LLM-based Graphical User Interface Automation (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to planning for GUI tasks are limited due to long historical dialogues.
Approach: They propose a novel approach to dynamic planning based on environmental feedback and execution history to guide action prediction in GUI tasks.
Outcome: The proposed approach surpasses the strong GPT-4V baseline by +12.7% in accuracy.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations