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

πŸ“… 2026-05-02
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF

career value

226K/year
πŸ€– AI Summary
This work addresses the limited generalization and poor adaptability of traditional collective foraging algorithms, which rely heavily on offline parameter tuning. The authors propose a novel approach that integrates a large language model (LLM) into the state machine of the Central Place Foraging Algorithm (CPFA), enabling zero-shot tactical decisions at three critical decision points based solely on local observations. Each robot operates an independent, lightweight LLM client using only its own sensory input, achieving decentralized control without any training. Evaluated across 36 heterogeneous configurations, the method consistently outperforms a genetically optimized baseline, demonstrating superior resource collection efficiency and performance stability. These results highlight the approach’s strong generalization capability and cross-configuration consistency.
πŸ“ Abstract
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.
Problem

Research questions and friction points this paper is trying to address.

swarm robotics
foraging
parameter optimization
deployment generalization
decentralized control
Innovation

Methods, ideas, or system contributions that make the work stand out.

Large Language Models
Swarm Robotics
Decentralized Control
Foraging Algorithms
Zero-shot Transfer
πŸ”Ž Similar Papers
No similar papers found.