用进化算法让机器人规划既智能又安全,还能在本地运行。
EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees

- 用演示数据提取时空逻辑约束,通过对抗生成补全负样本并进化优化。
- 结合大模型与程序验证的进化规划器,在开放世界任务中超越基线且抗词汇不匹配。
- 本地部署、端到端可执行,适合对安全性和自主性要求高的机器人应用。
基于大语言模型的机器人规划虽流畅,但无法保证可执行性与安全性;传统PDDL规划虽能保障这些性质,却需完整问题定义,且难以利用大模型理解上下文和修复计划的能力。本文提出一种神经符号框架,包含三部分:首先,离线挖掘来自演示数据的单一全局信号时序逻辑(STL)移动约束,通过反事实扰动和大模型生成违规样本,以进化搜索拟合约束,用于屏蔽Bench2Drive上的视觉-语言驾驶策略及HA-VLN-CE上的两个离散动作导航策略;其次,设计一种进化式PDDL规划器,由大模型生成并修复计划,程序化验证器筛选有效部分,经多轮迭代逐步扩展有效计划,测试于开放世界ALFWorld文本基准,优于强基线且在目标词表与动作模型词表不匹配时仍保持鲁棒;第三,构建约束执行循环,将计划编译为航点,逐个检查是否违反挖掘出的约束,一旦违规则重新规划。整个流程通过Gazebo仿真演示,所有大模型调用均使用本地部署的开源权重模型,实现无云依赖的机载部署。
原文摘要 · Abstract (English)
LLM-based robot planners are fluent but cannot guarantee that their plans are executable or safe. Classical PDDL planners can guarantee these properties, but only after the problem is fully specified, and they make poor use of an LLM's ability to read context and repair plans. This paper presents a neuro-symbolic framework with three parts. All LLM calls use a locally-hosted open-weight model, so the pipeline can be deployed on-robot with no cloud dependency. First, an offline procedure that mines a single global Signal Temporal Logic (STL) constraint on mobility from demonstration data. The procedure recovers codified rules (e.g., stopping at red lights, mined from nuPlan driving logs) or population preferences (e.g., social-navigation comfort, mined from SCAND teleoperation), depending on what the demonstrations encode. Because the demonstrations are a one-class signal, we generate the missing negatives with counterfactual perturbations and an LLM violation generator and then fit the constraint by evolutionary search. We use the mined constraint to shield a vision-language driving policy on Bench2Drive and two discrete-action navigation policies on HA-VLN-CE. Second, an evolutionary PDDL planner: an LLM proposes and repairs plans, programmatic validators decide which ones survive, and the validated portion of the plan grows over iterations. We test the planner on the open-world ALFWorld Text benchmark, where it beats strong baselines and stays robust when the goal vocabulary does not match the action-model vocabulary. Third, a constrained execution loop: the planner's plan is compiled into waypoints, the waypoints are checked against the mined constraint, and the planner re-plans on a violation. We illustrate the full pipeline via demonstrations using the Gazebo simulator.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。