Automatic Routing System for Intelligent Warehouses

Automation of logistic processes is essential to improve productivity and reduce costs. In this context, intelligent warehouses are becoming a key to logistic systems thanks to their ability of optimizing transportation tasks and, consequently, reducing costs. This paper initially presents briefly routing systems applied on intelligent warehouses. Then, we present the approach used to develop our router system. This router system is able to solve traffic jams and collisions, generate conflict-free and optimized paths before sending the final paths to the robotic forklifts. It also verifies the progress of all tasks. When a problem occurs, the router system can change the tasks priorities, routes, etc. in order to avoid new conflicts. In the routing simulations each vehicle executes its tasks starting from a predefined initial pose, moving to the desired position. Our algorithm is based on Dijkstra's shortestpath and the time window approaches and it was implemented in C language. Computer simulation tests were used to validate the algorithm efficiency under different working conditions. Several simulations were carried out using the Player/Stage Simulator to test the algorithms. Thanks to the simulations, we could solve many faults and refine the algorithms before embedding them in real robots.

[1]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[2]  Rolf H. Möhring,et al.  Conflict-free Real-time AGV Routing , 2004, OR.

[3]  F. Taghaboni-Dutta,et al.  Comparison of dynamic routeing techniques for automated guided vehicle system , 1995 .

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[6]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

[7]  Pierre Castagna,et al.  Conflict-free AGV routing in bi-directional network , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[8]  Rajan Batta,et al.  Developing Conflict-Free Routes for Automated Guided Vehicles , 1993, Oper. Res..

[9]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[10]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[11]  Iris F. A. Vis,et al.  Survey of research in the design and control of automated guided vehicle systems , 2006, Eur. J. Oper. Res..

[12]  Ekkehard Köhler,et al.  Dynamic Routing of Automated Guided Vehicles in Real-time , 2008 .

[13]  R. Möhring,et al.  Conflict-free Vehicle Routing : Load Balancing and Deadlock Prevention , 2008 .

[14]  Marcelo Becker,et al.  Robotic forklifts for intelligent warehouses: Routing, path planning, and auto-localization , 2010, 2010 IEEE International Conference on Industrial Technology.

[15]  Marcelo Becker,et al.  Intelligent Warehouses: Focus on the Automatic Routing and Path Planning of Robotic Forklifts Able to Work Autonomously , 2011 .

[16]  Paolo Serafini,et al.  Dynamic programming and minimum risk paths , 2006, Eur. J. Oper. Res..

[17]  Wen-Jing Hsu,et al.  Conflict-free container routing in mesh yard layouts , 2008, Robotics Auton. Syst..

[18]  L. Bodin ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[19]  J. M. A. Tanchoco,et al.  Conflict-free shortest-time bidirectional AGV routeing , 1991 .

[20]  Ling Qiu,et al.  A bi-directional path layout for conflict-free routing of AGVs , 2001 .

[21]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[22]  Shiv Gopal Kapoor,et al.  A labeling algorithm for the navigation of automated guided vehicles , 1993 .

[23]  P. Castagna,et al.  Robust conflict-free routing of bi-directional automated guided vehicles , 2002, IEEE International Conference on Systems, Man and Cybernetics.