A bi-directional path layout for conflict-free routing of AGVs

摘要

Automated Guided Vehicles (or AGVs for short) are now widely used in auto- mated material handling systems. Much research has been done on developing path layout and algorithms for the optimal routing and scheduling of AGVs. However, with the drastically increased number of AGVs in some recent applica- Tions (e.g. in the order of a hundred in container terminals), algorithms that can Achieve a high degree of concurrency of AGV moves are urgently needed.