Affiliation:
1. College of Information Science and Technology Beijing University of Chemical Technology Beijing China
2. R&D center Goldwind Science & Technology Co., Ltd. Beijing China
3. Department of Electrical Engineering and Computer Science Cleveland State University Cleveland Ohio USA
Abstract
AbstractRoute planning for automated guided vehicles (AGVs) is one of the key factors that affects work efficiency of automated storage and retrieval systems (AS/RSes). Route planning plays an important role in the operation of AGVs. Since the characteristic of AS/RSes is chessboard‐like, the environment is more complex than traditional route planning environments because the number of nodes is large, more than one shortest route exists between two nodes, and the routes with the shortest distance may not be the most energy‐saving routes. Although the traditional route planning algorithms such as the classical Q‐learning algorithm can work well in AGV route planning, it also has some limitations. This paper proposes a novel multi‐AGV route planning approach to solving the AGV route planning problem in the chessboard‐like warehouse, which can improve the route planning efficiency greatly. First, by combining adjacency matrix and reward matrix, we propose a low‐dimensional adjacency‐reward matrix for route planning. This algorithm improves the efficiency of classical Q‐learning algorithms and accelerates dynamic route planning significantly. We further improve the algorithm by considering the travel directions to minimize the number of turns in the route and additionally by considering whether the AGV is loaded or not and plan routes accordingly. Finally, we propose a multi‐AGV online collision‐free route planning algorithm based on these considerations for dynamic route planning for multi‐AGVs operating in a large‐scale warehouse. The proposed algorithms are validated with several case studies.
Subject
Control and Systems Engineering,Electrical and Electronic Engineering,Mathematics (miscellaneous)
Reference34 articles.
1. A note on two problems in connexion with graphs
2. Optimized tracking control using reinforcement learning strategy for a class of nonlinear systems;Yang X.;Asian J. Control,2022
3. J. J.KuffnerandS. M.LaValle RRT‐connect: an efficient approach to single‐query path planning Proc. of 2000 IEEE Int. Conf. on Robotics and Automation 2000 pp.1–7.
4. P.Isto Constructing probabilistic roadmaps with powerful local planning and path optimization Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems Lausanne Switzerland 2002 pp.2323–2328.
5. Adaptive reinforcement learning in control design for cooperating manipulator systems