基于ISO-TW算法的多仓储机器人路径规划研究*

doi:10.16731/j.cnki.1671-3133.2024.09.008

现代制造工程 ›› 2024, Vol. 528 ›› Issue (9): 54-59.doi: 10.16731/j.cnki.1671-3133.2024.09.008

基于ISO-TW算法的多仓储机器人路径规划研究^*

周小青¹, 童一飞², 周开俊^1,3

1 南通职业大学机械工程学院,南通 226007;
2 南京理工大学机械工程学院,南京 210094;
3 南通职业大学汽车与交通工程学院,南通 226007

收稿日期:2024-03-22 出版日期:2024-09-18 发布日期:2024-09-27
作者简介:周小青,通信作者,博士,副教授,主要研究方向为智能机械设计与制造、信息制造技术等。 E-mail:zhaoyangmin123@sina.com
基金资助:
^*江苏省高等学校自然科学研究项目(21KJB580005)

Research on path planning of multi-warehouse robots based on ISO-TW algorithm

ZHOU Xiaoqing¹, TONG Yifei², ZHOU Kaijun^1,3

1 School of Mechanical Engineering,Nantong Vocational University,Nantong 226007,China;
2 School of Mechanical Engineering,Nanjing University of Science and Technology,Nanjing 210094,China;
3 School of Automotive and Transportation Engineering,Nantong Vocational University,Nantong 226007,China

Received:2024-03-22 Online:2024-09-18 Published:2024-09-27

摘要/Abstract

摘要： 针对当前智能仓库中多仓储机器人协同规划效率低下、动态性不足等问题,提出了一种融合改进蛇优化(Improved Snake Optimizer,ISO)算法和时间窗(Time Window,TW)模型的路径规划方法。首先,在静态规划阶段,利用考虑阻塞因素的改进蛇优化算法为多仓储机器人规划出全局最优路径,同时计算出各机器人的时间窗,从而提升仓储机器人的规划效率;其次,在动态规划阶段,通过建立的多仓储机器人时间窗模型并引入动态调节策略,以消解冲突提升算法的动态性能;最后,进行仿真及实验。仿真结果表明,ISO-TW算法相较其他算法在阻塞点数量上最多可减少27~43个,减少幅度达22.50 %~31.62 %(机器人规模为80个);重规划路径比重可降低39.82 %~41.05 %(机器人规模为40个);平均运行时长最多可缩短38~40 s,缩短幅度约为18.27 %~19.05 %(机器人规模为60个)。实验结果表明,ISO-TW算法较其他算法平均运行时长减少8.53 %~9.23 %,冲突次数减少11.63 %~15.56 %,能够在真实场景中实现多仓储机器人的高效协同规划。

关键词: 蛇优化算法, 时间窗, 仓储机器人, 路径规划

Abstract: To solve the low efficiency and insufficient dynamics of cooperative planning of multi-warehouse robots in current intelligent warehouses,a path planning method combining Improved Snake Optimizer(ISO) and Time Window(TW) model was proposed. Firstly,in the static planning stage,the improved snake optimizer considering the blocking factor was used to plan the global optimal path for multi-warehouse robots,and the time window of each robot was calculated,so as to improve the planning efficiency of warehouse robots. Secondly,in the dynamic planning stage,the time window model of multi-warehouse robots was established and dynamic adjustment strategy was introduced to resolve conflicts and improve the dynamic performance of the algorithm. Finally,simulation and experiments were conducted,the simulation results showed that the ISO-TW algorithm could reduce the number of blocking points by up to 27~43 compared to other algorithms with a reduction of 22.50 %~31.62 % (with a robot size of 80). The proportion of replanned paths could be reduced by 39.82 %~41.05 % (with a robot scale of 40). The average running time could be shortened by up to 38~40 s with a reduction of approximately 18.27 %~19.05 % (with a scale of 60 robots). Experimental results showed that the ISO-TW algorithm reduces the average running time by 8.53 %~9.23 % and the number of conflicts by 11.63 %~15.56 % compared to other algorithms. It could achieve efficient collaborative planning of multi-warehouse robots in real scenarios.

Key words: Snake Optimizer(SO), Time Window(TW), warehouse robot, path planning

中图分类号:

TP242

周小青, 童一飞, 周开俊. 基于ISO-TW算法的多仓储机器人路径规划研究^*[J]. 现代制造工程, 2024, 528(9): 54-59.

ZHOU Xiaoqing, TONG Yifei, ZHOU Kaijun. Research on path planning of multi-warehouse robots based on ISO-TW algorithm[J]. Modern Manufacturing Engineering, 2024, 528(9): 54-59.

参考文献

[1] CHEN Y,WU J,HE C,et al.Intelligent Warehouse Robot Path Planning Based on Improved Ant Colony Algorithm[J].IEEE Access,2023,11:12360-12367.
[2] 雷斌,金彦彤,王致诚,等.仓储物流机器人技术现状与发展[J].现代制造工程,2021(12):143-153.
[3] 雷旭,陈静夷,陈潇阳.改进哈里斯鹰算法的仓储机器人路径规划研究[J].系统仿真学报,2024,36(5):1081-1092.
[4] 贺志刚,李大焱,王妮娅,等.一种含链式工作方式的多机器人协作路径规划算法[J].系统仿真学报,2024,3:1-15.
[5] 黄训爱,杨光永,樊康生,等.改进海洋捕食者算法的机器人路径规划研究[J].重庆理工大学学报(自然科学版),2024,38(1):355-3675.
[6] LIANG D,LIU Z Y,BHAMARA R.Collaborative Multi-Robot Formation Control and Global Path Optimization[J].Applied Sciences,2022,12(14):7076-7088.
[7] 李艳生,万勇,张毅,等.基于人工蜂群-自适应遗传算法的仓储机器人路径规划[J].仪器仪表学报,2022,43(4):282-290.
[8] 岳春擂,黄俊,邓乐乐.改进蚁群算法在AGV路径规划上的研究[J].计算机工程与设计,2022,43(9):2533-2541.
[9] HAO G,LV Q,HUANG Z,et al.UAV Path Planning Based on Improved Artificial Potential Field Method[J].Aerospace,2023,10(6):117-135.
[10] HAO K,YANG Y,LI Z,et al.CERRT:A Mobile Robot Path Planning Algorithm Based on RRT in Complex Environments[J].Applied Sciences,2023,13(17):64-74.
[11] 王志辉,陈息坤.融合场景理解与A^*算法的巡检机器人避障设计[J].无线电工程,2022,52(11):2000-2008.
[12] 杨瑞刚,耿明伟,郝成林,等.基于改进速度调节法的AGV群调度决策[J].机械设计与研究,2023,39(4):173-177.
[13] MORTEZA K,ENOL G,JOSE V,et al.A^*-Based Co-Evolutionary Approach for Multi-Robot Path Planning with Collision Avoidance[J].Cybernetics and Systems,2023,54(3):339-354.
[14] HASHIM F A,HUSSIEN A G.Snake Optimizer:a novel meta-heuristic optimization algorithm[J].Knowledge-Based Systems,2022,242(11):108320-108354.
[15] 张涛,王楚楚.考虑软时间窗的同时送取货随机旅行时间车辆路径问题[J].同济大学学报(自然科学版),2023,51(8):1278-1287.

基于ISO-TW算法的多仓储机器人路径规划研究^*

Research on path planning of multi-warehouse robots based on ISO-TW algorithm

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	李丹丹, 朱石磊, 李仲康, 介百坤, 王宏. 基于改进变色龙群算法的移动机器人路径规划^*[J]. 现代制造工程, 2024, 528(9): 40-45.
[2]	邱雯, 张帆, 谭跃刚, 张俊, 涂一文. 基于主应力轨迹线的连续碳纤维复合材料3D打印路径规划方法[J]. 现代制造工程, 2024, 525(6): 22-27.
[3]	段方正, 徐武彬, 孙金泉, 李冰, 王己林, 唐俊豪, 刘世航, 王秀杰. 无人驾驶单钢轮碾压机最优换道路径规划研究^*[J]. 现代制造工程, 2024, 525(6): 135-144.
[4]	吴明宇, 雷璐, 黄慧萍, 刘贡平, 乔晓利. 基于关节点寻路算法的航空线缆路径规划^*[J]. 现代制造工程, 2024, 523(4): 43-48.
[5]	刘尚俊男, 刘书海, 肖华平. 改进灰狼算法的移动充电机器人路径规划^*[J]. 现代制造工程, 2024, 523(4): 49-56.
[6]	朱敏, 胡若海, 卞京. 基于改进蚁群算法的移动机器人路径规划[J]. 现代制造工程, 2024, 522(3): 38-44.
[7]	唐宏伟, 高方坤, 邓嘉鑫, 丁祥, 罗佳强, 王军权. 基于蚁群算法的物资运送小车路径规划研究^*[J]. 现代制造工程, 2024, 521(2): 24-30.
[8]	徐胜, 沙鑫美, 苏铭. 移动机器人沿墙算法研究综述[J]. 现代制造工程, 2024, 521(2): 150-158.
[9]	黄广伟, 陈军杰. 受限空间机械臂避障路径与能耗最优研究^*[J]. 现代制造工程, 2024, 520(1): 39-44.
[10]	邵琪，时维国. 基于改进蚁群算法的机器人路径规划研究[J]. 现代制造工程, 2023, 513(6): 46-51.
[11]	韩朝，游有鹏，王栎，何健. 七轴机器人折弯仿真的路径规划[J]. 现代制造工程, 2023, 513(6): 52-56.
[12]	何心;李志恒;李冰;惠翔禹;顾同成;徐武彬. 一种改进蚁群算法的移动机器人路径规划研究[J]. 现代制造工程, 2023, 509(2): 36-43.
[13]	周伟，潘金宝，王林琳，陈汉成. 基于改进鲸鱼算法和A*算法的地面放线机器人路径规划[J]. 现代制造工程, 2023, 519(12): 68-75.
[14]	张晓倩;黄磊;石雨婷;汪建华;祁良剑. 基于多目标优化的改进蚁群路径规划算法[J]. 现代制造工程, 2023, 518(11): 40-46.
[15]	曾钰桔;陈波;瞿睿;李民. 基于改进蚁群算法的移动机器人路径规划研究[J]. 现代制造工程, 2023, 517(10): 57-63.