Task Assignment And Trajectory Planning Algorithm For A Class Of Cooperative Agricultural Robots

Keywords

agricultural robot; Cooperative trajectory planning; farming automation; fruit harvesting; scouting algorithm

Abstract

Agricultural field operations, such as harvesting for fruits and scouting for disease, are labor intensive and time consuming. With the recent push toward autonomous farming, a method to rapidly generate trajectories for a group of cooperative agricultural robots becomes necessary. The challenging aspect of solving this problem is to satisfy realistic constraints such as changing environments, actuation limitations, nonlinear heterogeneous dynamics, conflict resolution, and formation reconfigurations. In this paper, a hierarchical decision making and trajectory planning method is studied for a group of agricultural robots cooperatively conducting certain farming task such as citrus harvesting. Within the algorithm framework, there are two main parts (cooperative level and individual level): (1) in the cooperative level, once a discrete reconfiguration event is confirmed and replanning is triggered, all the possible formation configurations and associated robot locations for specific farming tasks will be evaluated and ranked according to the feasibility condition and the cooperative level performance index; and (2) in the individual level, a local pursuit (LP) strategy based cooperative trajectory planning algorithm is designed to generate local optimal cooperative trajectories for agricultural robots to achieve and maintain their desired operation formation in a decentralized manner. The capabilities of the proposed method are demonstrated in a citrus harvesting problem.

Publication Date

5-1-2015

Publication Title

Journal of Dynamic Systems, Measurement and Control, Transactions of the ASME

Volume

137

Issue

5

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1115/1.4028849

Socpus ID

84940506756 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84940506756

This document is currently not available here.

Share

COinS