文章摘要
基于改进NSGA-Ⅲ算法的多AGV任务分配
Multi-AGV Path Planning Based on an Improved NSGA-Ⅲ Algorithm
投稿时间:2025-09-24  
DOI:10.16018/j.cnki.cn32-1650/n.202504009
中文关键词: AGV调度  NSGA-Ⅲ  路径规划  自适应交叉变异  分段交叉  多目标优化
英文关键词: AGV scheduling  NSGA-III  path planning  adaptive crossover  segment crossover  multi-objective optimization
基金项目:安徽省重点实验室开放基金项目(QCKJJ202505),芜湖市重点研发计划项目(2023ly05)
作者单位
陈永祥 安徽工程大学机械与汽车工程学院,安徽芜湖 241000 
王建平 安徽工程大学机械与汽车工程学院,安徽芜湖 241000 
邱子麒 安徽工程大学机械与汽车工程学院,安徽芜湖 241000 
代周杰 安徽工程大学机械与汽车工程学院,安徽芜湖 241000 
孙杰 安徽工程大学机械与汽车工程学院,安徽芜湖 241000 
摘要点击次数: 38
全文下载次数: 30
中文摘要:
      针对仓库多AGV协同调度的拓扑图法无法考虑行驶冲突,栅格图法需对各AGV行驶路径单独规划,从而浪费算力的问题,提出了一种在栅格地图中采用双通道的建模方法和以冲突路口建立拓扑点映射的方法进行路径规划,无需使用单车寻路算法。在算法方面,针对迭代算法过程中广度和深度不能在前后期合理地兼顾,优化目标单一的问题,提出了一种基于NSGA-Ⅲ的多目标优化算法;将算法中的遗传和交叉概率调整为自适应,交叉改为分段交叉,并保留优秀父代片段,从而提高算法的收敛速度;设置考虑AGV系统的能耗、运行时间、负载标准差3个目标函数,并在栅格地图中多AGV调度问题上进行了仿真实验。结果表明,提出的NSGA-Ⅲ改进算法具有更好的优化结果,收敛代数分布更小;3个目标函数平均收敛速度相比改进前分别提升了26.7%、33.3%、23.5%。
英文摘要:
      To address the limitations of conventional topological mapping methods for multi-AGV collaborative scheduling in warehouses—particularly the inability to resolve travel conflicts and the computational overhead of separate path planning for each AGV in grid-based approaches—we propose an innovative solution. This method employs dual-channel modeling in grid maps and establishes topological point mappings at conflict intersections for path planning, eliminating the need for single-agent routing algorithms. Algorithmically, we overcome the challenges of balancing breadth and depth during iterative processes and single-objective optimization by introducing a NSGA-III-based multi-objective optimization algorithm. The algorithm incorporates adaptive genetic and crossover probabilities,adopts a segmented crossover scheme, and retains superior parent segments to enhance the algorithm's convergence speed. Three objective functions were defined: energy consumption, operational time, and load standard deviation. Simulation experiments on multi-AGV scheduling in grid maps demonstrated that the improved NSGA-III algorithm achieves better optimization results with smaller convergence algebra distributions. The average convergence speeds of the three objective functions improved by 26.7%,33.3%, and 23.5% respectively compared to pre-improvement benchmarks.
查看全文   查看/发表评论  下载PDF阅读器
关闭