高级检索+

复杂环境下果园机器人路径规划方法研究

Research on path planning method of orchard robot in complex environment

  • 摘要: 果园机器人在复杂环境中的工作效率的高低主要是由机器人的路径规划决定的,基本人工势场算法存在的问题很多,比如死锁现象、运行时间长等等。基于此提出一种新的算法,对基本人工势场算法进行改进。首先是重构识别路径,引入障碍物检测算法,可以识别出有效障碍物,同时还计算出有效的路径中间点;然后进行优化斥力作用,引入障碍物有关的边界条件,进而地图信息矩阵力向矩阵,计算出受力最大的方向,同时按此方向从起点重新检索,并且把中间点设为新起点反复迭代,这样就可以得到一个局部最优路径,最终的全局路径就是由各个局部最优路径构成。通过Matlab进行对比测试,测试结果表明:本文算法和基本人工势场算法相比,路径长度减小0.586 m,迭代次数减少19次,算法运行时间减少8.662 s,在复杂的环境中,本文算法路径规划优势明显。

     

    Abstract: The working efficiency of orchard robot in complex environment is mainly determined by the path planning of robot. There are many problems in the basic artificial potential field algorithm, such as deadlock, long running time and so on. Based on this, a new algorithm was proposed to improve the basic artificial potential field algorithm. The first is to reconstruct the recognition path, introduce the obstacle detection algorithm, which could identify the effective obstacles and calculate the effective middle point of the path. Then it was optimizd the repulsive force, introduced the boundary conditions related to the obstacles, and then mapped the information matrix to the matrix, calculated the direction of the maximum force. At the same time, re-searching from the starting point in this direction, and setting the intermediate point as the new starting point to iterate repeatedly, so that a local optimal path could be obtained, and the final global path was composed of each local optimal path. Through the comparative test of MATLAB, the test results showed that: compared with the basic artificial potential field algorithm, the path length of this algorithm was reduced by 0.586 meters, the number of iterations was reduced by 19, and the running time of the algorithm is reduced by 8.662 seconds. In the complex environment, the advantages of this algorithm are obvious.

     

/

返回文章
返回