用大模型自动完成机器人任务规划,无需人工调参和训练数据。
LLM-Flax : Generalizable Robotic Task Planning via Neuro-Symbolic Approaches with Large Language Models

- 用本地大模型自动生成规则和修复失败,免去手动编写
- 在10×10到15×15网格上平均成功率94.5%,超越人工基准11.7个百分点
- 零样本评估下仍有效,适合快速部署新任务场景
当前在新领域部署神经符号任务规划器需大量人工:领域专家需编写松弛与互补规则,并提供数百个训练问题以监督图神经网络(GNN)对象评分器。我们提出LLM-Flax,一种三阶段框架,仅需PDDL领域文件即可通过本地大模型消除全部人工成本。第一阶段通过结构化提示与自校正生成规则;第二阶段引入可行性门控预算策略,预先预留API延迟开销,防止下游松弛回退被耗尽;第三阶段以零样本大模型评分完全替代训练过的GNN,无需训练数据。我们在MazeNamo基准上测试10×10、12×12和15×15网格(共8个基准),平均成功率达0.945,优于人工基线的0.828(+0.117),在所有8个基准中表现持平或更优。在12×12 Expert上,其成功率0.733,而人工规划器完全失败(SR 0.000);在15×15 Hard上达到1.000,人工为0.900。第三阶段证明了可行性(12×12 Hard上无训练数据时达0.720),但在大规模下受上下文窗口限制,成为未来主要挑战。
原文摘要 · Abstract (English)
Deploying a neuro-symbolic task planner on a new domain today requires significant manual effort: a domain expert must author relaxation and complementary rules, and hundreds of training problems must be solved to supervise a Graph Neural Network (GNN) object scorer. We propose LLM-Flax, a three-stage framework that eliminates all three sources of manual effort using a locally hosted LLM given only a PDDL domain file. Stage 1 automatically generates relaxation and complementary rules via structured prompting with format validation and self-correction. Stage 2 introduces LLM-guided failure recovery with a feasibility-gated budget policy that explicitly reserves API latency cost before each LLM call, preventing the downstream relaxation fallback from being starved. Stage 3 replaces the domain-trained GNN entirely with zero-shot LLM object importance scoring, requiring no training data. We evaluate all three stages on the MazeNamo benchmark across 10x10, 12x12, and 15x15 grids (8 benchmarks total). LLM-Flax achieves average SR 0.945 versus the manual baseline's 0.828 (+0.117), matching or outperforming manual rules on every one of the eight benchmarks. On 12x12 Expert, LLM-Flax attains SR 0.733 where the manual planner fails entirely (SR 0.000); on 15x15 Hard, it achieves SR 1.000 versus Manual's 0.900. Stage 3 demonstrates feasibility (SR 0.720 on 12x12 Hard with no training data) but faces a context-window bottleneck at scale, pointing to the primary open challenge for future work.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。