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

Multi-objective path planner for an agricultural mobile robot in a virtual greenhouse environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
43
0
2

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 86 publications
(45 citation statements)
references
References 11 publications
0
43
0
2
Order By: Relevance
“…To validate the proposed algorithm, which facilitates both global and local planning, five case studies were investigated focusing on the minimization of: (i) the distance travelled in the crop headlands using different turning radii; (ii) the input cost and required time for a fleet of homogeneous vehicles; (iii) the input cost for the required time and both criteria for a fleet of both homogeneous; and (iv) heterogeneous vehicles with small tanks; and (v) the time for a fleet of homogeneous UGVs in a field divided into three parcels. Finally, the work presented in [46] developed a multi-objective path planner for a mobile robot in greenhouse environments. The developed algorithm considered travelling distance and routing angel subject to pesticide tank capacity constraints, and it was tested against four alternative routing test cases.…”
Section: Reviewmentioning
confidence: 99%
“…To validate the proposed algorithm, which facilitates both global and local planning, five case studies were investigated focusing on the minimization of: (i) the distance travelled in the crop headlands using different turning radii; (ii) the input cost and required time for a fleet of homogeneous vehicles; (iii) the input cost for the required time and both criteria for a fleet of both homogeneous; and (iv) heterogeneous vehicles with small tanks; and (v) the time for a fleet of homogeneous UGVs in a field divided into three parcels. Finally, the work presented in [46] developed a multi-objective path planner for a mobile robot in greenhouse environments. The developed algorithm considered travelling distance and routing angel subject to pesticide tank capacity constraints, and it was tested against four alternative routing test cases.…”
Section: Reviewmentioning
confidence: 99%
“…It is used for shortest path problem in graph theory (30). It was commonly utilized to find the navigation cost which is the smallest value by the shortest path planning (31). It is mostly applicable to for use in singlesource shortest path problem.…”
Section: A Dijkstra Algorithmmentioning
confidence: 99%
“…Another multi-objective path planner system was suggested, in which the problem of spraying pesticides in greenhouses was addressed as a vehicle routing issue [11]. The probabilistic roadmap path planner was designed to solve the vehicle routing problem, and the routes are generated between the plants for spraying pesticides based on the virtual environment.…”
Section: Introductionmentioning
confidence: 99%