摘要
A*算法是当前静态路由网络中求解最短路径最有效的启发式算法,但是在实际的工厂应用中,A*算法的求解路径可能并非是最优路径,在A*算法的基础上加入贪心思想,选择最优路径。在当前工业系统中单个AGV不能适用于比较复杂的任务,这时便需要多路AGV协同处理,多路AGV需要解决冲突问题,针对自动导引小车(AGV)系统,提出了一种基于时间窗的A*改进算法,解决多路AGV的冲突问题。
This paper is based on the A＊algorithm.Join greedy ideas and choose the best path.In the current industrial system,a single AGV can not be applied to more complex tasks.At this time,multiple AGVs need to be co-processed,and multiple AGVs need to solve the conflict problem.This paper proposes a time-based approach for automatic guided vehicle（AGV） systems.The A＊improved algorithm of the window solves the conflict problem of multiple AGVs.
出处
《工业控制计算机》
2018年第8期100-101,共2页
Industrial Control Computer
关键词
A＊算法
无冲突路由
多路AGV
冲突检测
A＊ algorithm
collision-free routing
multi-channel AGV
collision detection
