让大模型自动调整规划精细度,复杂任务更细致,简单任务更简洁。
From Coarse to Fine: Self-Adaptive Hierarchical Planning for LLM Agents

- 基于认知科学的渐进精炼原理,从粗略计划逐步细化。
- 在多个任务上提升成功率,同时减少过度规划现象。
- 适合需要灵活决策的复杂多步任务,如智能体系统开发。
基于大语言模型的智能体近期成为解决动态多步任务的强大方法。现有规划机制通常采用固定粒度,导致简单任务过于冗余、复杂任务又信息不足,难以平衡简洁性与复杂性。受认知科学中“渐进精炼”原则启发,我们提出自适应分层规划方法 AdaPlan-H:从粗粒度宏观计划开始,根据任务复杂度动态细化。该方法生成针对不同任务难度的自适应分层计划,可通过模仿学习和能力增强进行优化。实验表明,该方法显著提升了任务执行成功率,同时缓解了规划层面的过度规划问题,为多步复杂决策任务提供了灵活高效的解决方案。代码与数据将公开于 https://github.com/import-myself/AHP。
原文摘要 · Abstract (English)
Large language model-based agents have recently emerged as powerful approaches for solving dynamic and multi-step tasks. Most existing agents employ planning mechanisms to guide long-term actions in dynamic environments. However, current planning approaches face a fundamental limitation that they operate at a fixed granularity level. Specifically, they either provide excessive detail for simple tasks or insufficient detail for complex ones, failing to achieve an optimal balance between simplicity and complexity. Drawing inspiration from the principle of \textit{progressive refinement} in cognitive science, we propose \textbf{AdaPlan-H}, a self-adaptive hierarchical planning mechanism that mimics human planning strategies. Our method initiates with a coarse-grained macro plan and progressively refines it based on task complexity. It generates self-adaptive hierarchical plans tailored to the varying difficulty levels of different tasks, which can be optimized by imitation learning and capability enhancement. Experimental results demonstrate that our method significantly improves task execution success rates while mitigating overplanning at the planning level, providing a flexible and efficient solution for multi-step complex decision-making tasks. To contribute to the community, our code and data will be made publicly available at https://github.com/import-myself/AHP.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。