用大模型引导机器人规划,提升复杂环境下的物体移动效率。
Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search
- 用大模型生成任务计划,作为树搜索的初始引导
- 在6个任务中优于传统规划器和纯搜索算法
- 仅在开始时调用大模型,降低计算成本,适合工程落地
在可移动障碍物环境中重新定位一组物体的问题可建模为几何任务与运动规划(G-TAMP),属于任务与运动规划(TAMP)的一个子类。传统方法依赖领域无关启发式或从规划经验中学习,通常需要大量计算资源或数据。相比之下,人类常利用常识直观判断应操作哪些物体。受此启发,我们提出利用具备互联网规模常识知识的大语言模型(LLM)来指导G-TAMP中的任务规划。为使LLM具备几何推理能力,我们设计了一种基于谓词的提示,编码来自运动规划算法的几何信息。随后查询LLM生成任务计划,并用于搜索连续参数可行性解。由于LLM可能出错,我们不直接采纳其输出,而是将蒙特卡洛树搜索(MCTS)扩展至混合动作空间,并以LLM生成的任务计划所探索节点作为初始化起点。不同于以往在每个节点调用LLM导致高开销的做法,我们仅在初始阶段使用LLM进行热启动。在六个不同G-TAMP问题上,我们的方法显著优于先前的LLM规划器和纯搜索算法。代码已开源:https://github.com/iMSquared/prime-the-search
原文摘要 · Abstract (English)
The problem of relocating a set of objects to designated areas amidst movable obstacles can be framed as a Geometric Task and Motion Planning (G-TAMP) problem, a subclass of task and motion planning (TAMP). Traditional approaches to G-TAMP have relied either on domain-independent heuristics or on learning from planning experience to guide the search, both of which typically demand significant computational resources or data. In contrast, humans often use common sense to intuitively decide which objects to manipulate in G-TAMP problems. Inspired by this, we propose leveraging Large Language Models (LLMs), which have common sense knowledge acquired from internet-scale data, to guide task planning in G-TAMP problems. To enable LLMs to perform geometric reasoning, we design a predicate-based prompt that encodes geometric information derived from a motion planning algorithm. We then query the LLM to generate a task plan, which is then used to search for a feasible set of continuous parameters. Since LLMs are prone to mistakes, instead of committing to LLM's outputs, we extend Monte Carlo Tree Search (MCTS) to a hybrid action space and use the LLM to guide the search. Unlike the previous approach that calls an LLM at every node and incurs high computational costs, we use it to warm-start the MCTS with the nodes explored in completing the LLM's task plan. On six different G-TAMP problems, we show our method outperforms previous LLM planners and pure search algorithms. Code can be found at: https://github.com/iMSquared/prime-the-search
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。