检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋文清 赵奇 陈玉 李银广 冀永臻 冯朱建 SONG Wenqing;ZHAO Qi;CHEN Yu;LI Yinguang;JI Yongzhen;FENG Zhujian(Guoneng Beidian Shengli Energy Co.,Ltd.,Xilinhot 026002,China;Guangzhou Bright Dream Robotics Co.,Ltd.,Guangzhou 511370,China)
机构地区:[1]国能北电胜利能源有限公司,内蒙古锡林浩特026002 [2]广州博智林机器人有限公司,广东广州511370
出 处:《无线电工程》2024年第9期2249-2257,共9页Radio Engineering
基 金:国家自然科学基金(51877129)。
摘 要:针对巡检机器人需在电站复杂环境下多任务点遍历巡检路径规划问题,提出一种多策略差分扰动机制改进的堆优化(Heap-Based Optimizer,HBO)算法。对不同个体实行差异化的扰动策略,增强新解的多样性。针对巡检任务起终点一致的特性,使用交错同步搜索策略,双种群各执行一半搜索任务,降低了搜索时间,提高了收敛速度。环境建模引入了无限邻域机制,可搜索邻域个数变为连续任意方向,减少了转折点数,使用四阶最小Snap平滑算法平滑整体路径,增大路径平顺度,满足机器人动力学特性。经仿真对比,改进后HBO算法在多任务点遍历巡检任务中性能提升明显,相对于改进前HBO算法和对比的混合粒子群灰狼(Hybrid Gray Wolf Optimizer with Particle Swarm Optimization,HGWOP)算法的步数最低,路径最平滑,最优路径分别缩短了11.1%和20.0%,平均迭代次数分别降低了25.78%和10.53%。To solve the problem of multi-task point traversal and inspection path planning for inspection robots in the complex environment of power station,a Heap-Based Optimizer(HBO)with improved multi-strategy differential perturbation mechanism is proposed.Firstly,differentiated perturbation strategies are implemented for different individuals to enhance the diversity of new solutions.Secondly,for the characteristics of the inspection tasks with the same starting and ending points,an interleaved synchronous search strategy is used,where the dual populations each perform half of the search tasks to reduce the search time and improve the convergence speed.Finally,the infinite neighborhood mechanism is introduced into the environment modeling,and the number of searchable neighborhoods becomes continuous in any direction,which reduces the number of turning points,and then the fourth-order minimum Snap smoothing algorithm is used to smooth the overall path,increase the smoothness of the path,and satisfy the robot dynamics characteristics.After simulation and comparison,the performance of the improved HBO algorithm in the multi-task point traversal inspection task is significantly improved,and the improved HBO algorithm has the lowest number of steps and the smoothest paths,the optimal paths are shortened by 11.1%and 20.0%,and the average number of iterations is reduced by 25.78%and 10.53%,respectively,compared to the pre-improvement HBO algorithm and the comparative Hybrid Gray Wolf Optimizer with Particle Swarm Optimization(HGWOP).
分 类 号:TP242[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.190.152.131