缩小
计算
序列(生物学)
数学优化
路径(计算)
算法
代表(政治)
计算机科学
布线(电子设计自动化)
领域(数学)
遗传算法
磁道(磁盘驱动器)
运动规划
数学
人工智能
计算机网络
生物
政治
政治学
纯数学
法学
遗传学
程序设计语言
操作系统
机器人
作者
Ibrahim A. Hameed,Dionysis Bochtis,Claus Aage Grøn Sørensen
摘要
The objective of this article was to develop an initial approach for a method to combine two recently developed methods related to the field area coverage problem. The first stage generated a field geometrical representation and the second stage aimed to optimize the routing of agricultural vehicles within this geometrically defined world. In the first stage, using the former method the optimal driving direction is derived based on the minimization of the overlapped area. The second stage uses the later method, the optimal routing is determined for the derived driving direction and is based on the minimization of the non-working distance. In its current state, the developed approach can provide optimal solutions in terms of overlapped area and sub-optimal solutions in terms of total non-working travelled distance. Still, these sub-optimal solutions proved more efficient compared to the conventional field work patterns. Improving this sub-optimality as well as the reducing the computation times of the method in order to be feasible for real-time implementation, are considered issues of future researching.
科研通智能强力驱动
Strongly Powered by AbleSci AI