Abstract
AbstractIn this paper, we address algorithms for path planning and scheduling of automated guided vehicles (AGV) iteratively carrying objects. Since the manpower shortage advances, there is a growing need for technology that can transport objects unattended. Indeed, AGVs are generally used in warehouses for transporting objects. Algorithms for path planning and scheduling of AGVs have been investigated so far; however, the purpose of many of them is the path planning and scheduling of essentially one AGV. It is difficult to design an algorithm for moving many AGVs simultaneously without collision because of the intersection of the paths of AGVs. Especially, when small number of AGVs carry objects iteratively for moving many objects in a limited area such as transport at a port, it is difficult to find the optimum path planning and scheduling. We formulate the path planning and scheduling problem of AGVs for this situation as an optimization problem, design a heuristic algorithm, and evaluate the algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
