2019
DOI: 10.1016/j.cie.2019.06.037
|View full text |Cite
|
Sign up to set email alerts
|

A collaborative control protocol for agricultural robot routing with online adaptation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 32 publications
(10 citation statements)
references
References 24 publications
0
10
0
Order By: Relevance
“…The protocol of joint routing management of the robotic platform with online adaptation can be formed according to the methodology proposed by Dusadeerungsikul and Nof (2019).…”
Section: Literature Reviewmentioning
confidence: 99%
“…The protocol of joint routing management of the robotic platform with online adaptation can be formed according to the methodology proposed by Dusadeerungsikul and Nof (2019).…”
Section: Literature Reviewmentioning
confidence: 99%
“…To date, many different robots have been developed and/or deployed in both greenhouse environments (Arad et al, 2020; Mahmud et al, 2019; Schor et al, 2016; van Henten et al, 2002; Xiong et al, 2020) and field conditions (Åstrand & Baerveldt, 2002; Birrell et al, 2020; Nagasaka et al, 2009; Underwood et al, 2017). Growers are enthusiastic about using robotic technologies to reduce labor costs and increase profit margins in harvesting (Arad et al, 2020; Birrell et al, 2020; van Henten et al, 2002; Xiong et al, 2020), phenotyping (Narvaez et al, 2017; Underwood et al, 2017), transplanting (Nagasaka et al, 2009), weed control (Åstrand & Baerveldt, 2002), disease detection (Dusadeerungsikul & Nof, 2019; Schor et al, 2016), and so on.…”
Section: Introductionmentioning
confidence: 99%
“…Stressed areas in the field 177 are first identified and, then, the shortest path for traversing 178 them is defined using a TSP-based solution. Similarly, the 179 identification of stressed areas is considered in [15] where 180 a TSP routing algorithm is combined with human inputs to 181 build a collaborative and adaptive framework. A TSP-based 182 walk problem, where the robot is required to repeatedly carry out a closed walk in a graph with weighted vertices.…”
mentioning
confidence: 99%
“…Based on the solution to (15), the nodes that each robot r j has to serve are determined by the variables xh, j , i.e., s i, j = 1 if edge êh terminates in v i , i.e., êh = (v s , v i ), with v i = v 0 and it is assigned to robot r j , i.e., xh, j = 1, s i, j = 0 otherwise. Concerning the route assigned to each robot r j , it is determined by the shortest paths associated with the variables xh, j = 1, i.e., x k, j = 1 with e k ∈ E if xh, j = 1 and a k,h, j = 1, x k, j = 0 otherwise.…”
mentioning
confidence: 99%
See 1 more Smart Citation