本平台为互联网非涉密平台,严禁处理、传输国家秘密或工作秘密

基于改进天鹰优化算法的烟叶醇化仓库巡检机器人路径规划

Route planning for inspection robot in tobacco leaf aging warehouse based on an Improved Aquila Optimizer

  • 摘要: 为解决烟叶醇化仓库机器人巡检过程中路径搜索时间长、效率低等问题,采用格栅地图构建烟叶醇化仓库仿真环境模型,并在天鹰优化算法(Aquila Optimizer,AO)基础上引入动态可调整权重,结合随机因子、最小权重以及最大权重等因素建立改进天鹰优化算法(Improved Aquila Optimizer,IAO),实现对机器人巡检路径的快速规划。利用基准函数对比分析了IAO、AO、哈里斯鹰优化算法(Harris Hawks Optimization,HHO)、遗传算法(Genetic Algorithm,GA)以及蚁群算法(Ant Colony Algorithm,ACA)的性能,并对比5种算法在烟叶醇化仓库仿真模型中的应用效果,结果表明:IAO具有较高收敛精度和鲁棒性;与AO、HHO、GA、ACA相比,IAO巡检距离分别减少1.8%、5.3%、3.2%、6.2%,巡检时间分别缩短17.3%、22.5%、19.6%、27.1%。该方法可为提高烟叶醇化仓库管理效率提供支持。

     

    Abstract: In order to reduce time and improve efficiency of route search for inspection robots in a tobacco aging warehouse, a simulation model was constructed using the grid map. Based on Aquila Optimizer (AO), an Improved Aquila Optimizer (IAO) was developed by introducing dynamically adjustable weights and combining the random factor, minimum weight and maximum weight to realize the fast route planning for the inspection robot. The performance of IAO, AO, Harris Hawks Optimization (HHO), Genetic Algorithm (GA) and Ant Colony Algorithm (ACA) was comparatively analyzed with the baseline function, and their performance in the simulation model of tobacco aging warehouse was also compared. The results showed that compared with the other four algorithms, IAO had higher convergence accuracy and robustness, the inspection distance of the robot was reduced by 1.8%, 5.3%, 3.2% and 6.2%, and the inspection time was reduced by 17.3%, 22.5%, 19.6% and 27.1%, respectively. This method supports the improvement of the management efficiency of the tobacco aging warehouse.

     

/

返回文章
返回