Computer Science Faculty Publications
Document Type
Conference Proceeding
Publication Date
6-10-2026
Abstract
The complete collection of sparse resources in large, unknown environments remains a challenging problem for autonomous robot swarms. Previous studies have shown that a substantial portion of total mission time is consumed during the final stage of collection, where only a small fraction of randomly scattered resources remain. Consequently, many existing swarm foraging algorithms (search and collection) focus on collecting most resources within a limited time window, rather than improving end-stage efficiency for collecting all resources. We propose a grid-based stochastic foraging strategy that explicitly reduces redundant visits and accelerates late-stage collection. The unknown search area is partitioned into a grid map, which is maintained by a lightweight central server. To maintain scalability, both robots and the server operate within limited memory and computational constraints. Robots execute decentralized search behaviors while exploring assigned regions and communicate summarized trajectory information to the server upon returning to the center only. The server updates the grid-level visitation counts based on robot-reported locations, producing a global estimate of the exploration density. For each new foraging trip, a robot selects its next search area from a local 3 × 3 neighborhood of grids probabilistically with the lowest visitation count, thus biasing exploration toward under-visited regions while maintaining stochasticity. Extensive simulation experiments demonstrate that the proposed strategy consistently outperforms the canonical centrally placed baseline foraging algorithm (CPFA). Compared to CPFA, the proposed method reduces the total collection time by up to 33% and improves collection efficiency by more than 48% during the final stage of the mission. These results indicate that the proposed strategy is robust, flexible, and scalable for near-complete and complete resource collection in robot swarms and can serve as a general enhancement for stochastic swarm foraging methods under limited onboard resources.
Recommended Citation
Gonzalez, Arturo, Yifeng Gao, Li Zhang, and Qi Lu. "A Visitation Grid for Complete Coverage Foraging in Robot Swarms." In 2026 23rd International Conference on Ubiquitous Robots (UR), pp. 321-328. IEEE, 2026. https://doi.org/10.1109/UR69537.2026.11626681
Publication Title
2026 23rd International Conference on Ubiquitous Robots (UR)
DOI
10.1109/UR69537.2026.11626681
Comments
Copyright IEEE.