In this paper, a distributed algorithm with obstacle avoidance capability is presented to deploy a group of ground robots for field-based agriculture applications. To this end, the field (consisting of many plots) is first modeled as a directed graph, and the robots are deployed to collect data from some important areas of the field (e.g., areas with high water stress or biotic stress). The key idea is to formulate the underlying problem as a locational optimization problem and then find the optimal solution based on the Voronoi partitioning of the associated graph. The proposed partitioning method is validated through simulation studies, as well as experiments using a group of mobile robots.

This content is only available via PDF.
You do not currently have access to this content.