高级检索+

基于启发式搜索策略的自适应避苗除草作业路径规划

Adaptive seedling-avoiding weeding path planning based on a heuristic search strategy

  • 摘要: 针对小型智能除草机因除草部件作业路径规划策略不完善导致的作物损伤与作业效率低等问题,该研究以土培生菜为试验对象,提出一种基于启发式搜索策略的自适应避苗除草作业路径规划方法。搭建了图像采集与双向并行驱动机构相结合的除草作业平台,应用YOLOv8n-seg模型识别提取生菜边缘形态与杂草位置分布信息,基于自适应递归聚类算法进行杂草位置簇划分、以簇心为关键点构建除草部件作业路径加权无向图,结合A*(A-Star)启发式搜索策略,实现避苗条件下除草部件作业路径的最短规划。进行了不同杂草分布的仿真分析与相同杂草分布的性能对比试验,仿真结果表明:该作业路径规划方法具有较好的适应性,作业路径长度从小到大排序为本文方法、螺旋算法、蛇形算法、BCD算法;试验结果表明:自适应避苗除草模式的除草率为93.91%、伤苗率为0、行株间相邻生菜形成的除草单元平均除草耗时为14.2s,与避苗遍历除草模式相比,作业效率提升了42.28%。研究结果可为田间高质量机械除草提供技术参考。

     

    Abstract: In order to address the issues of crop damage and low operational efficiency caused by imperfect path planning strategies for the weeding components of small-scale intelligent weeding machines, this study utilized soil-cultured lettuce as the experimental subject. The research proposed an adaptive seedling-avoiding weeding operation path planning method based on a heuristic search strategy and concurrently designed a bidirectional parallel drive mechanism to enhance the functionality of the weeding machine. A comprehensive weeding operation platform was constructed by integrating an image acquisition system with the newly designed bidirectional parallel drive mechanism. The Denavit-Hartenberg (D-H) parameters method was employed to perform kinematic analysis of the bidirectional parallel drive mechanism, enabling precise control over the movement of the weeding components. This precise control is crucial for minimizing crop damage while ensuring effective weed removal. The study applied the YOLOv8n-seg model to accurately identify and extract the edge morphology of both lettuce and weeds from the acquired images. To protect the lettuce, a minimum enclosing circle was delineated to define the lettuce protection zone, while the positions of the weeds were represented using their centroid coordinates. This approach provided a clear and concise method for mapping weed locations within the field.Building upon the identified weed positions, an adaptive recursive clustering algorithm was utilized to partition the weed locations into distinct clusters. This clustering facilitated the construction of a weighted undirected graph for the weeding component’s operation path, with the cluster centers serving as key points within the graph. By integrating this graph-based approach with the A* (A-Star) heuristic search strategy, the study successfully achieved the shortest possible path planning for the weeding components under seedling-avoiding conditions. This integration ensures that the weeding machine can navigate efficiently around the protected lettuce areas while effectively targeting weed clusters. To validate the effectiveness and adaptability of the proposed path planning method, extensive simulation analyses were conducted under various weed distribution scenarios. Additionally, performance comparison experiments were carried out under identical weed distribution conditions to benchmark the proposed method against traditional planning algorithms. The simulation results demonstrated that the proposed path planning method consistently achieved coverage of weed growth areas with shorter paths across different weed distributions, highlighting its strong adaptability and efficiency. The operation path lengths, ranked from shortest to longest, are as follows: the proposed method, the Spiral algorithm, the Zigzag algorithm, and the BCD algorithm. Specifically, under discrete weed distribution states with grid coverage rates of 20%, 40%, and 60%, the proposed path planning method outperformed other traditional planning algorithms. Compared to the BCD algorithm, the path lengths were reduced by 54.6%, 53.3%, and 60.5% respectively. These significant reductions in path length not only enhance operational efficiency but also contribute to minimizing fuel consumption and reducing wear and tear on the weeding machinery. Experimental results further corroborated the simulation findings. The adaptive seedling-avoiding weeding mode achieved a weeding rate of 93.91%, indicating a high level of effectiveness in weed removal. Importantly, the crop damage rate was maintained at 0, demonstrating the method’s precision and its ability to protect the cultivated lettuce from unintended harm. Additionally, the average weeding duration per unit, defined by spatially adjacent lettuce plants in both row and column directions, was measured to be 14.2 seconds, indicating a significant improvement in operational speed. When compared to the seedling-avoiding exhaustive weeding mode, the adaptive mode enhanced operational efficiency by 42.28%, showcasing its potential for practical application in agricultural settings. The integration of advanced image processing techniques, precise kinematic control, and sophisticated path planning algorithms in this study provides a robust framework for improving the performance of small-scale intelligent weeding machines. The proposed adaptive seedling-avoiding weeding operation path planning method not only addresses the critical issues of crop damage and low efficiency but also lays a foundation for future advancements in mechanical weeding technologies. In conclusion, the research findings offer a valuable technical reference for achieving high-quality mechanical weeding in field applications. By combining heuristic search strategies with adaptive clustering and precise motion control, the study presents a comprehensive solution that enhances both the effectiveness and efficiency of weeding operations. These advancements hold significant promise for the agricultural industry, contributing to more sustainable and productive farming practices through the adoption of intelligent weeding machinery.

     

/

返回文章
返回