移动机器人
运动规划
机器人
任务(项目管理)
计算机科学
启发式
路径(计算)
遗传算法
作业车间调度
人工智能
数学优化
分布式计算
实时计算
工程类
布线(电子设计自动化)
嵌入式系统
数学
计算机网络
机器学习
系统工程
作者
Zecheng Wang,Quan-Ke Pan
标识
DOI:10.23919/ccc58697.2023.10240912
摘要
With the popularization and application of Robotic Mobile Fulfillment System (RMFS), more and more problems related to it have attracted attention from researchers. This paper considers a multi-robot task allocation and path planning problem in RMFS and proposes a hybrid method by combining a Genetic algorithm (GA) with a Hierarchical Cooperative A * (HCA*) algorithm. The GA generates several task sequences as targets for path planning, and the HCA* successfully finds a collision-free path for several mobile robots while considering the optimization of the makespan and flowtime of the entire order. For the narrow aisle in storge areas, we allow the mobile robots to wait in place and provide a simple heuristic method for HCA* to arrange priorities for mobile robots. The results of the simulation experiments confirm the effectiveness of the proposed method.
科研通智能强力驱动
Strongly Powered by AbleSci AI