运动规划
启发式
计算机科学
时间轴
任务(项目管理)
钥匙(锁)
路径(计算)
集合(抽象数据类型)
过程(计算)
运筹学
人工智能
工程类
系统工程
计算机安全
考古
机器人
历史
程序设计语言
操作系统
作者
Wei Xie,Xiongfeng Peng,Liu Yan-ru,Junhai Zeng,Lili Li,Toshio Eisaka
标识
DOI:10.1016/j.simpat.2024.102945
摘要
With the rapid development of intelligent manufacturing, the application of automated guided vehicles (AGVs) in intelligent warehousing systems has become increasingly common. Efficiently planning the conflict-free paths of multiple AGVs while minimizing the total task completion time is crucial for evaluating the performance of the system. Distinguishing itself from recent approaches where conflict avoidance strategy and path planning algorithm are executed independently or separately, this paper proposes an improved conflict-free A* algorithm by integrating the conflict avoidance strategy into initial the path planning process. Based on the heuristic A* algorithm, we use the instruction time consumption as the key evaluation indicator of the cost function and add the turning consumption in the future path cost evaluation. Moreover, the expansion mode of child nodes is optimized where a five-element search set containing the "zero movement" is proposed to implement proactive an pause-wait strategy. Then the prediction rules are designed to add constraints to three types of instructions based on the timeline map, guiding the heuristic planning to search for conflict-free child nodes. Extensive simulations show that the coordination planning based on the improved conflict A* algorithm not only effectively achieves advanced conflict avoidance at the algorithmic level, but also exhibits lower computational complexity and higher task completion efficiency compared to other coordination planning methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI