Automated guided vehicles (AGVs) are widely used in various industries, and scheduling and routing them in a conflict-free manner is crucial to their efficient operation. We propose a loop-based algorithm that solves the online, conflict-free scheduling and routing problem for AGVs. The proposed algorithm is compared against an exact method, a greedy heuristic and a metaheuristic. We experimentally show that this algorithm either outperforms the other algorithms or gets an equally good solution in less computing time.

翻译：自动导引车（AGV）广泛应用于各工业领域，实现其无冲突的调度与路径规划对其高效运行至关重要。我们提出一种基于循环的算法，用于解决AGV的在线无冲突调度与路径规划问题。将该算法与精确方法、贪婪启发式算法及元启发式算法进行比较。实验表明，该算法在更短的计算时间内要么优于其他算法，要么获得同等质量的解。