大型语言模型能否解决机器人路径规划问题?
Can Large Language Models Solve Robot Routing?
AI总结:
本文系统评估了大型语言模型在8种机器人路径规划变体上的求解能力,发现自我调试与自我验证可提升成功率,并揭示了不同上下文对成功率和最优性差距的差异化影响。
摘要:
路径规划问题在移动机器人中十分常见,涵盖巡检、监控和覆盖等任务。根据目标和约束的不同,这些问题通常可归结为旅行商问题(TSP)的各种变体,传统上通过将高层目标转化为优化形式并利用现代求解器来获得解决方案。在此,我们探索大型语言模型(LLMs)取代从自然语言描述的任务到生成机器人路径的整个流程的潜力。我们通过构建一个包含80个独特机器人路径规划问题的数据集,在单机器人和多机器人场景下覆盖8种变体,系统地研究了LLMs在机器人路径规划中的表现。我们通过三种框架评估LLMs:单次尝试、自我调试,以及带有自我验证的自我调试,并提供多种上下文,包括数学公式、伪代码和相关研究论文。我们的研究结果表明,自我调试和自我验证都能提高成功率,而不会显著降低最优性差距。我们观察到上下文敏感行为——提供数学公式作为上下文会降低最优性差距,但会显著降低成功率;而提供伪代码和相关研究论文作为上下文并不能一致地提高成功率或降低最优性差距。我们识别了关键挑战,并提出了增强LLMs在解决机器人路径规划问题中表现的未来方向。我们的源代码可在项目网站上获取:https://sites.google.com/view/words-to-routes/。
英文摘要:
Routing problems are common in mobile robotics, encompassing tasks such as inspection, surveillance, and coverage. Depending on the objective and constraints, these problems often reduce to variants of the Traveling Salesman Problem (TSP), with solutions traditionally derived by translating high-level objectives into an optimization formulation and using modern solvers to arrive at a solution. Here, we explore the potential of Large Language Models (LLMs) to replace the entire pipeline from tasks described in natural language to the generation of robot routes. We systematically investigate the performance of LLMs in robot routing by constructing a dataset with 80 unique robot routing problems across 8 variants in both single and multi-robot settings. We evaluate LLMs through three frameworks: single attempt, self-debugging, and self-debugging with self-verification and various contexts, including mathematical formulations, pseudo-code, and related research papers. Our findings reveal that both self-debugging and self-verification enhance success rates without significantly lowering the optimality gap. We observe context-sensitive behavior - providing mathematical formulations as context decreases the optimality gap but significantly decreases success rates and providing pseudo-code and related research papers as context does not consistently improve success rates or decrease the optimality gap. We identify key challenges and propose future directions to enhance LLM performance in solving robot routing problems. Our source code is available on the project website: https://sites.google.com/view/words-to-routes/.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。