Agbots: Weeding a field with a team of autonomous robots
•We created a realistic simulation framework for weed growth.•This was used to evaluate our algorithm for coordinated multi-robot weeding.•Results showed the feasibility of the algorithm in various field conditions.•Information sharing between agents was shown to improve system performance. This wor...
Gespeichert in:
Veröffentlicht in: | Computers and electronics in agriculture 2019-08, Vol.163, p.104827, Article 104827 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •We created a realistic simulation framework for weed growth.•This was used to evaluate our algorithm for coordinated multi-robot weeding.•Results showed the feasibility of the algorithm in various field conditions.•Information sharing between agents was shown to improve system performance.
This work presents a strategy for coordinated multi-agent weeding under conditions of partial environmental information. The goal is to demonstrate the feasibility of coordination strategies for improving the weeding performance of autonomous agricultural robots. It is shown that, given a sufficient number of agents, a team of autonomous robots can successfully weed fields with various initial seed bank densities, even when multiple days are allowed to elapse before weeding commences. Furthermore, the use of information sharing between agents is demonstrated to strongly improve system performance as the number of agents increases.
As a domain to test these algorithms, a simulation environment, Weed World, was developed, which allows real-time visualization of coordinated weeding policies, and includes realistic weed generation. In this work, experiments are conducted to determine the required number of agents for given initial seed bank densities and varying allowed days before the start of the weeding process. |
---|---|
ISSN: | 0168-1699 1872-7107 |
DOI: | 10.1016/j.compag.2019.05.036 |