路径(计算)
机器人
运动规划
数学优化
领域(数学)
计算机科学
航程(航空)
移动机器人
地头
路径长度
树(集合论)
运筹学
工程类
人工智能
数学
海洋学
地质学
数学分析
航空航天工程
海岸
程序设计语言
纯数学
计算机网络
作者
Danial Pour Arab,Matthias Spisser,Caroline Essert
摘要
Abstract In the agricultural industry, an evolutionary effort has been made over the last two decades to achieve precise autonomous systems to perform typical in‐field tasks, including harvesting, mowing, and spraying. One of the main objectives of an autonomous system in agriculture is to improve the efficiency while reducing the environmental impact and cost. Due to the nature of these operations, complete coverage path planning (CCPP) approaches play an essential role to find an optimal path which covers the entire field while taking into account land topography, operation requirements, and robot characteristics. The aim of this paper is to propose a CCPP approach defining the optimal movements of mobile robots over an agricultural field. First, a method based on tree exploration is proposed to find all potential solutions satisfying some predefined constraints. Second, a similarity check and selection of optimal solutions method is proposed to eliminate similar solutions and find the best solutions. The optimization goals are to maximize the coverage area and to minimize overlaps, nonworking path length, and overall travel time. To explore a wide range of possible solutions, our approach is able to consider multiple entrances for the robot. For fields with a complex shape, different dividing lines to split them into simple polygons are also considered. Our approach also computes the headland zones and covers them automatically which leads to a high coverage rate of the field.
科研通智能强力驱动
Strongly Powered by AbleSci AI