基于二分搜索的牛耕式全覆盖规划算法研究  

Research on boustrophedon complete coverage path planning based on binary search

作　　者：赵慧南[1,2] 刘淑华[1] 吴富章[1] 程宇[1] 

机构地区：[1]东北师范大学计算机学院,长春130024 [2]东北师范大学人文学院,长春130117

出　　处：《计算机工程与应用》2011年第23期51-53,60,共4页Computer Engineering and Applications

基　　金：吉林省科技厅高新处重点项目(No.20100305)

摘　　要：针对栅格环境下存在任意形状的静态障碍物问题,提出了结合二分搜索法的牛耕式全覆盖路径规划算法,该算法可以加速寻找下一个未覆盖空间的初始位置,提高了覆盖的效率。对该算法在多种室内环境中进行仿真,仿真结果表明该算法切实可行。另外,通过与其他全覆盖算法进行对比,结果表明该方法能有效地降低重复覆盖率。This paper proposes an improved boustrophedon complete coverage path planning combined with binary search. There are some static obstacles in the grid environment.The binary search algorithm enable robot search next uncovered area faster so as to increase coverage efficiency.The proposed algorithm is tested in many indoor environments.Simulation results show that the method is feasible and is not sensitive to robot’s initial position.In addition,compared with other algorithm, the proposed method is more effective.

关 键 词：全覆盖路径规划 牛耕式 二分法 

分 类 号：TP242[自动化与计算机技术—检测技术与自动化装置]