Algorithms for Path Planning and Scheduling of Automated Guided Vehicles Iteratively Carrying Objects

Sumihiro Yoneyama,Hiroyoshi Miwa

doi:10.1007/978-3-031-14627-5_44

Sumihiro Yoneyama, Hiroyoshi Miwa

https://doi.org/10.1007/978-3-031-14627-5_44

Copy DOI

Export

Save

Cite

Publication Date: Jan 1, 2022

Affiliation: Kwansei Gakuin University

Abstract
Full-Text
Similar Papers

Abstract

Listen

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.

Full Text