arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.04264eess.SYcs.SY
收藏

任意非凸区域和多障碍区域的全覆盖和部分覆盖的最优现场布线

Optimal In-field Routing for Full and Partial Field Coverage with Arbitrary Non-Convex Fields and Multiple Obstacle Areas

Mogens Graf Plessen

摘要:

在优化农业物流的背景下,本文涉及到最佳的现场路由的全部和部分领域覆盖任意非凸领域和多个障碍物领域。它是区分九个不同的现场路由任务:两个全域覆盖,七个部分域覆盖和一个过渡图的任何两个顶点之间的最短路径规划。它区分任务的相同或不同的开始和结束顶点、仅顶点子集的覆盖以及边或组合的子集。所提出的方法主要是针对具有较大操作宽度的喷洒和施肥以及具有独特的岬角路径的田地而开发的。仅必须覆盖边缘的特定子集与精确农业相关,并且还与具有有限装载能力的较小尺寸机械的优化物流操作相关。本研究的结果是命题的两个兼容的算法,分别为最佳的全覆盖和部分领域覆盖的路径规划。这些评估三个现实世界的领域,以证明其特点和计算效率。

英文摘要:

Within the context of optimising the logistics in agriculture this paper relates to optimal in-field routing for full and partial field coverage with arbitrary non-convex fields and multiple obstacle areas. It is distinguished between nine different in-field routing tasks: two for full-field coverage, seven for partial-field coverage and one for shortest path planning between any two vertices of the transition graph. It differentiates between equal or different start and end vertices for a task, coverage of only a subset of vertices, and a subset of edges or combinations. The proposed methods are developed primarily for applying sprays and fertilisers with larger operating widths and with fields where there is unique headland path. Partial field coverage where, e.g., only a specific subset of edges has to be covered is relevant for precision agriculture and also for optimised logistical operation of smaller-sized machinery with limited loading capacities. The result of this research is the proposition of two compatible algorithms for optimal full and partial field coverage path planning, respectively. These are evaluated on three real-world fields to demonstrate their characteristics and computational efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑