Code Driven Planning with Domain-Adaptive Critic
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909802474504192 |
|---|---|
| author | Tian, Zikang Peng, Shaohui Huang, Du Guo, Jiaming Chen, Ruizhi Zhang, Rui Zhang, Xishan Guo, Yuxuan Du, Zidong Guo, Qi Li, Ling Pu, Yewen Hu, Xing Chen, Yunji |
| author_facet | Tian, Zikang Peng, Shaohui Huang, Du Guo, Jiaming Chen, Ruizhi Zhang, Rui Zhang, Xishan Guo, Yuxuan Du, Zidong Guo, Qi Li, Ling Pu, Yewen Hu, Xing Chen, Yunji |
| contents | Large Language Models (LLMs) have been widely adopted as task planners for AI agents in sequential decision-making problems, leveraging their extensive world knowledge. However, the gap between their general knowledge and environment-specific requirements often leads to inaccurate plans. To address this, existing approaches rely on frequent LLM queries to iteratively refine plans based on immediate environmental feedback, which incurs substantial query costs. However, this refinement is typically guided by short-term environmental feedback, limiting LLMs from developing plans aligned with long-term rewards. We propose Code Driven Planning with Domain-Adaptive Critic (CoPiC). Instead of relying on frequent queries, CoPiC employs LLMs to generate a diverse set of high-level planning programs, which iteratively produce and refine candidate plans. A trained domain-adaptive critic then evaluates these candidates and selects the one most aligned with long-term rewards for execution. Using high-level planning programs as planner and domain-adaptive critic as estimator, CoPiC improves planning while significantly reducing query costs. Results in ALFWorld, NetHack, and StarCraft II Unit Building show that CoPiC outperforms advanced LLM-based baselines, AdaPlanner and Reflexion, achieving an average (1) 23.33% improvement in success rate and (2) 91.27% reduction in query costs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_19077 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Code Driven Planning with Domain-Adaptive Critic Tian, Zikang Peng, Shaohui Huang, Du Guo, Jiaming Chen, Ruizhi Zhang, Rui Zhang, Xishan Guo, Yuxuan Du, Zidong Guo, Qi Li, Ling Pu, Yewen Hu, Xing Chen, Yunji Artificial Intelligence Large Language Models (LLMs) have been widely adopted as task planners for AI agents in sequential decision-making problems, leveraging their extensive world knowledge. However, the gap between their general knowledge and environment-specific requirements often leads to inaccurate plans. To address this, existing approaches rely on frequent LLM queries to iteratively refine plans based on immediate environmental feedback, which incurs substantial query costs. However, this refinement is typically guided by short-term environmental feedback, limiting LLMs from developing plans aligned with long-term rewards. We propose Code Driven Planning with Domain-Adaptive Critic (CoPiC). Instead of relying on frequent queries, CoPiC employs LLMs to generate a diverse set of high-level planning programs, which iteratively produce and refine candidate plans. A trained domain-adaptive critic then evaluates these candidates and selects the one most aligned with long-term rewards for execution. Using high-level planning programs as planner and domain-adaptive critic as estimator, CoPiC improves planning while significantly reducing query costs. Results in ALFWorld, NetHack, and StarCraft II Unit Building show that CoPiC outperforms advanced LLM-based baselines, AdaPlanner and Reflexion, achieving an average (1) 23.33% improvement in success rate and (2) 91.27% reduction in query costs. |
| title | Code Driven Planning with Domain-Adaptive Critic |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2509.19077 |