| 208 | 1 | 496 |
| 下载次数 | 被引频次 | 阅读次数 |
针对巡检机器人需在电站复杂环境下多任务点遍历巡检路径规划问题,提出一种多策略差分扰动机制改进的堆优化(Heap-Based Optimizer,HBO)算法。对不同个体实行差异化的扰动策略,增强新解的多样性。针对巡检任务起终点一致的特性,使用交错同步搜索策略,双种群各执行一半搜索任务,降低了搜索时间,提高了收敛速度。环境建模引入了无限邻域机制,可搜索邻域个数变为连续任意方向,减少了转折点数,使用四阶最小Snap平滑算法平滑整体路径,增大路径平顺度,满足机器人动力学特性。经仿真对比,改进后HBO算法在多任务点遍历巡检任务中性能提升明显,相对于改进前HBO算法和对比的混合粒子群灰狼(Hybrid Gray Wolf Optimizer with Particle Swarm Optimization,HGWOP)算法的步数最低,路径最平滑,最优路径分别缩短了11.1%和20.0%,平均迭代次数分别降低了25.78%和10.53%。
Abstract: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% and10. 53%,respectively,compared to the pre-improvement HBO algorithm and the comparative Hybrid Gray Wolf Optimizer with Particle Swarm Optimization(HGWOP).
[1]刘惠中,邓浩宗.智能选矿摇床巡检机器人的路径规划[J].有色金属(选矿部分),2023(2):133-141.
[2]王娜,石晨.智能草坪修剪机器人路径规划研究———基于模糊改进人工势场算法[J].农机化研究,2023,45(12):40-44.
[3]童枭军,陈洋,路浩,等.面向表计读数的变电站巡检机器人路径规划[J].电子测量与仪器学报,2022,36(8):167-177.
[4]宋宇,张浩,程超.基于改进蚁群算法的物流机器人路径规划[J].现代制造工程,2022(11):35-40.
[5]何启嘉,王启明,李佳璇,等.基于优势竞争网络的转运机器人路径规划[J].清华大学学报(自然科学版),2022,62(11):1751-1757.
[6]赵思沛,史成军,王浩亮,等.基于改进RRT算法的船舶机舱巡检机器人路径规划[J].船舶工程,2022,44(7):109-114.
[7]赵鹏程,宋保维,毛昭勇,等.基于改进的复合自适应遗传算法的UUV水下回收路径规划[J].兵工学报,2022,43(10):2598-2608.
[8]柯清派,史训涛,袁智勇,等.基于改进遗传算法的变电站巡检机器人路径规划[J].电测与仪表,2023,60(8):144-149.
[9]陈法法,蒋浩,李振,等.基于改进RRT的智能巡检机器人狭窄通道路径规划[J].组合机床与自动化加工技术,2022(10):40-45.
[10]邱硕涵,谭章禄,蔡晓梅.基于D_Star算法的巡检机器人路径规划优化研究[J].中国矿业大学学报,2021,50(5):1011-1018.
[11]王洪铃,谭功全,李静,等.改进麻雀搜索算法的AGV路径规划[J].无线电工程,2023,53(8):1917-1924.
[12]郑凯,裘君,童应楠,等.改进蛇优化算法在室内UWB定位的应用[J/OL].无线电工程:1-7(2023-05-18)[2023-09-20]. https://kns. cnki. net/kcms2/article/abstract?v=v-1aSqfKcSXEWSSbmp432UuJl38wyzY6G9h0PDsiJpdHSnJeK5Njo5JWoIDlQlqEbQKF1CYBsNiNcG2XbeB_olciqBBCWKSRfQ3-LkJBvdnyz6HfZvygCsfsylkFfA7 xKp5dE3WVljb-XLUWU13n_XVzPRG8beW1&uniplatfo rm=NZKPT&language=CHS&version=LYDG.
[13]ASKARI Q,SAEED M,YOUNAS I.Heap-based Optimizer Inspired by Corporate Rank Hierarchy for Global Optimization[J].Expert Systems with Applications,2020,161:113702.
[14]ZHANG X M.LIN Q Y,MAO W T,et al.Hybrid Particle Swarm and Grey Wolf Optimizer and Its Application to Clustering Optimization[J].Applied Soft Computing,2021,101:107061.
[15]张振,张华良,邓永胜,等.融合改进A*算法与DWA算法的机器人实时路径规划[J].无线电工程,2022,52(11):1984-1993.
[16]韩松岳,郭基联.5G MEC系统融合粒子群和教学算法的卸载策略优化[J].无线电工程,2022,52(10):1864-1878.
[17]王涛,喻韬.一种基于遗传模拟退火算法的通信卫星资源规划方法[J].无线电工程,2021,51(8):767-772.
[18]张泽华,张加友,张嘉凯,等.基于遗传禁忌算法的多星协同任务规划方法[J].无线电工程,2022,52(7):1127-1135.
基本信息:
中图分类号:TP18;TP242
引用信息:
[1]宋文清,赵奇,陈玉,等.基于差分扰动HBO算法的巡检机器人路径规划[J].无线电工程,2024,54(09):2249-2257.
基金信息:
国家自然科学基金(51877129)~~
2023-12-13
2023-12-13
2023-12-13