Abstract
With the continuous development of intelligent logistics, the application of Automated Guided Vehicles (AGVs) increasingly becomes popular in many industrial fields. However, there are a series of problems in multi-AGV systems, such as resource allocation, conflict and deadlock. It is difficult to plan the shortest path for each AGV without conflict and collision in multi-AGV systems. In this paper, a multi-AGV scheduling system in workshop is established by using the unidirectional directed graph method and the A∗ algorithm for path planning of AGVs. In addition, the system is realized by programming and a simulation experiment of 20 AGVs is set up. Finally, the simulation results show that the system can effectively solve the conflict problem of AGVs, and is stable and high real-time. The system is easily extended to their similar multi-AGV scheduling systems, and has a great application value.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call