arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.22067cs.AI
收藏

通过大语言模型实现语义部分 grounding

Semantic Partial Grounding via LLMs

Department of Computer Science, University of Cambridge(剑桥大学计算机科学系)

Giuseppe Canonaco, Alberto Pozanco, Daniel Borrajo

AI总结:

本文提出SPG-LLM,利用大语言模型分析领域和问题文件,提前识别可能不相关的对象、动作和谓词,从而减少grounding任务的规模,提升grounding效率并在某些领域实现更优的计划成本。

摘要:

Grounding是经典规划中的关键步骤,但随着任务规模增大,grounded动作和原子的指数增长常使其成为计算瓶颈。近期部分grounding方法通过预测模型逐步grounding最有前景的操作符来解决这一挑战。然而,这些方法主要依赖关系特征或学习到的嵌入,未利用PDDL描述中的文本和结构线索。我们提出SPG-LLM,利用大语言模型分析领域和问题文件,启发式地识别潜在不相关的对象、动作和谓词,从而在grounding前显著减少grounded任务的规模。在七个难以grounding的基准测试中,SPG-LLM实现了更快的grounding速度(通常快几个数量级),并在某些领域实现了可比或更优的计划成本。

英文摘要:

Grounding is a critical step in classical planning, yet it often becomes a computational bottleneck due to the exponential growth in grounded actions and atoms as task size increases. Recent advances in partial grounding have addressed this challenge by incrementally grounding only the most promising operators, guided by predictive models. However, these approaches primarily rely on relational features or learned embeddings and do not leverage the textual and structural cues present in PDDL descriptions. We propose SPG-LLM, which uses LLMs to analyze the domain and problem files to heuristically identify potentially irrelevant objects, actions, and predicates prior to grounding, significantly reducing the size of the grounded task. Across seven hard-to-ground benchmarks, SPG-LLM achieves faster grounding-often by orders of magnitude-while delivering comparable or better plan costs in some domains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑