模拟退火
计算机科学
工作量
运动规划
数学优化
自适应模拟退火
机器人
遗传算法
人工智能
分布式计算
任务(项目管理)
趋同(经济学)
最优化问题
匹配(统计)
渲染(计算机图形)
物料搬运
路径(计算)
进化算法
机器人学
机器学习
计算复杂性理论
计算
作者
Taizi Huang,Yang Chen,Zhihuan Chen
标识
DOI:10.1177/01423312261446679
摘要
Complex infrastructure environments impose distinct mobility constraints on inspection robots, rendering single-type systems inefficient. To address the challenge where aerial vehicles struggle indoors and ground vehicles cannot reach high altitudes, this study investigates an air-ground collaborative path planning problem characterized by strict task heterogeneity. A mathematical model is constructed to minimize the system’s maximum inspection time by strictly matching task types with specific robotic capabilities. To solve this complex combinatorial optimization problem efficiently, a hybrid evolutionary algorithm is proposed that integrates the local search advantage of simulated annealing into the gray wolf optimizer framework. Comparative experiments demonstrate that this hybrid approach outperforms existing simulated annealing genetic algorithms, bi-trajectory search methods, and standard gray wolf optimizers in terms of solution accuracy, convergence speed, and stability. The findings confirm that the proposed strategy effectively balances workload among heterogeneous robots, offering a robust solution for intelligent automated inspection.
科研通智能强力驱动
Strongly Powered by AbleSci AI