Journal of Computer Applications ›› 2024, Vol. 44 ›› Issue (3): 966-971.DOI: 10.11772/j.issn.1001-9081.2023030334

• Frontier and comprehensive applications • Previous Articles     Next Articles

Full coverage path planning of bridge inspection wall-climbing robot based on improved grey wolf optimization

Haixin HUANG1(), Guangwei YU1, Shoushan CHENG2, Chunming LI3   

  1. 1.School of Civil and Transportation Engineering,Hebei University of Technology,Tianjin 300401,China
    2.Research Institute of Highway,Ministry of Transport,Beijing 100080,China
    3.Tianjin Transportation Infrastructure Maintenance Group Corporation Limited,Tianjin 300401,China
  • Received:2023-03-29 Revised:2023-04-28 Accepted:2023-05-04 Online:2023-05-18 Published:2024-03-10
  • Contact: Haixin HUANG
  • About author:YU Guangwei, born in 1998, M. S. candidate. His research interests include intelligence of bridge detection.
    CHENG Shoushan, born in 1977, M. S., research fellow. His research interests include bridge safety assessment and performance improvement.
    LI Chunming, born in 1982, senior engineer. His research interests include bridge construction and maintenance.
  • Supported by:
    Transportation S & T Development Plan of Tianjin(2021-29)

基于改进灰狼优化的桥梁检测爬壁机器人全覆盖路径规划

黄海新1(), 于广威1, 程寿山2, 李春明3   

  1. 1.河北工业大学 土木与交通学院, 天津 300401
    2.交通运输部 公路科学研究所, 北京 100080
    3.天津市交通运输基础设施养护集团有限公司, 天津 300401
  • 通讯作者: 黄海新
  • 作者简介:于广威(1998—),男,河北沧州人,硕士研究生,主要研究方向:桥梁检测智能化
    程寿山(1977—),男,安徽黄山人,研究员,硕士,主要研究方向:桥梁安全评定和性能提升
    李春明(1982—),男,天津人,高级工程师,主要研究方向:桥梁建造和管养。
  • 基金资助:
    天津市交通运输科技发展计划(2021-29)

Abstract:

Automatic inspection of concrete bridge health based on wall-climbing robot is an effective way to promote intelligent bridge management and maintenance, moreover reasonable path planning is particularly important for the robot to obtain comprehensive detection data. Aiming at the engineering practical problem of weight limitation of the wall-climbing robot power supply and the difficulty of energy supplement during inspection, the inspection scenarios of bridge components such as main beams and high piers were fully considered, the energy consumption index was taken as the objective function of performance evaluation optimization and corresponding constraint conditions were established, and a full coverage path planning evaluation model was proposed. An Improved Grey Wolf Optimization (IGWO) algorithm was proposed to solve the problem that traditional Grey Wolf Optimization (GWO) algorithm is prone to fall into local optimum. The IGWO algorithm improved the characteristics of initial gray wolf population which was difficult to maintain relatively uniform distribution in the search space by K-Means clustering. The nonlinear convergence factor was used to improve the local development ability and global search performance of the algorithm. Combining with the idea of individual superiority of particle swarm optimization, the position updating formula was improved to enhance the model solving ability of the algorithm. Algorithm simulation and comparison experiment results show that IGWO has better stability compared with GWO, Different Evolution (DE) and Genetic Algorithm (GA), IGWO reduces energy consumption by 10.2% - 16.7%, decreases iterations by 19.3% - 36.9% and solving time by 12.8% - 32.3%, reduces path repetition rate by 0.23 - 1.91 percentage points, and reduces path length by 1.6% - 11.0%.

Key words: Grey Wolf Optimization (GWO), bridge inspection, wall-climbing robot, full coverage path planning, energy consumption model

摘要:

基于爬壁机器人对混凝土桥梁健康进行自动巡检是推动桥梁管养智能化的有效途径,而合理的路径规划对机器人全面获取检测数据尤为重要。针对爬壁机器人电源重量限制与巡检时能源补充困难这一工程实际问题,充分考虑主梁、高墩等桥梁构件巡检场景,将能量消耗指标作为性能评价优化目标函数并建立相应约束条件,进而提出全覆盖路径规划评价模型。针对传统灰狼优化(GWO)算法易陷入局部最优的不足,提出一种改进的灰狼优化(IGWO)算法。IGWO算法通过K-means聚类改善了灰狼初始种群在搜索空间难以保持相对均匀分布的特性;以非线性收敛因子提高算法局部开发能力和全局搜索性能;结合粒子群算法个体优越性的思想对位置更新公式进行改进,提升算法的模型求解能力。仿真对比实验结果表明,IGWO算法相较于GWO、差分进化(DE)与遗传算法(GA)等全局优化算法,稳定性更好,能耗降低了10.2%~16.7%,迭代次数与求解时间分别减少了19.3%~36.9%和12.8%~32.3%,路径重复率降低了0.23~1.91个百分点,同时路径长度缩短1.6%~11.0%。

关键词: 灰狼优化, 桥梁检测, 爬壁机器人, 全覆盖路径规划, 能耗模型

CLC Number: