arXiv:2605.01461cs.ROcs.MA2026-05

用大模型让机器人团队自适应觅食,无需重新训练就能跨环境稳定工作。

LLM-Foraging: Large Language Models for Decentralized Swarm Robot Foraging

论文配图:LLM-Foraging: Large Language Models for Decentralized Swarm Robot Foraging
图 1 · 摘自论文原文
  • 在关键决策点接入大语言模型,实现无需训练的分布式控制
  • 36种配置下资源收集量均优于传统优化算法,且稳定性更强
  • 适合需要快速部署、多变环境的机器人协同场景

群体觅食算法(如中心点觅食算法,CPFA)通常依赖遗传算法或强化学习进行离线参数优化,导致策略与特定团队规模、场地大小和资源分布强耦合。当部署条件变化时性能下降,重训练成本高昂。我们提出LLM-Foraging,一种去中心化的群组控制器,在CPFA状态机的三个结构化决策点(返巢后、到达中心区、搜索饥饿时)引入大语言模型(LLM)战术决策模块。每台机器人运行独立的LLM客户端,仅基于本地可观测状态发起查询,原有CPFA运动与感知模块执行选定动作。由于LLM作为通用决策策略而非特定配置的参数,该控制器在部署时无需训练,可直接跨配置迁移。我们在Gazebo中使用TurtleBot3机器人评估了36种配置,涵盖4至10台机器人、6×6至10×10米场地以及三种资源分布(聚集型、幂律型、随机型)。LLM-Foraging在所有测试配置中收集的资源均超过经遗传算法调优的CPFA基线,且表现更一致——这是单配置调优的GA无法实现的跨域泛化能力。

原文摘要 · Abstract (English)

Swarm foraging algorithms, such as the central-place foraging algorithm (CPFA), typically rely on offline parameter optimization using genetic algorithms (GA) or reinforcement learning, yielding policies tightly coupled to a specific combination of team size, arena size, and resource distribution. When deployment conditions change, performance degrades, and retraining is computationally expensive. We propose LLM-Foraging, a decentralized swarm controller that augments the CPFA state machine with a large language model (LLM) tactical decision-maker at three structured decision points, namely post-deposit, central-zone arrival, and search starvation. Each robot runs its own LLM client and queries it using only locally observable state, while the existing CPFA motion and sensing stack executes the selected action. Because the LLM serves as a general decision policy rather than parameters fitted to a single configuration, the controller is training-free at deployment and transfers across configurations without re-optimization. We evaluate LLM-Foraging in Gazebo with TurtleBot3 robots across 36 configurations spanning team sizes of 4 to 10 robots, arena sizes from 6x6 to 10x10 meters, and three resource distributions (clustered, powerlaw, random). LLM-Foraging collects more resources than the GA-tuned CPFA baseline across the evaluated configurations and is more consistent, a property that the GA's single-configuration tuning does not transfer.

机器人集群大模型应用自适应控制

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。