Skip to main content
Log in

Scheduling and routing of autonomous moving objects on a mesh topology

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

Autonomous moving objects (AMOs), such as automated guided vehicles (AGVs) and autonomous robots, have been widely used in industry for decades. In an intelligent transport system with a great number of AMOs involved, it is desirable to maintain a smooth traffic flow of AMOs without congestion or deadlocks. Continuing our previous study, in this paper we propose a new algorithm for concurrent scheduling and routing of a great number (i.e., 4n 2) of AMOs on an n × n mesh topology of path network. As a significant improvement compared with the previous algorithm, this new algorithm achieves 3n concurrent rectilinear steps of routing for all 4n 2 AMOs, while no congestion or deadlocks arise from them when all AMOs are moving around on the mesh topology. The theoretical analysis and calculations of the algorithm are verified by randomly generated data in our experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. Readers are referred to (Qiu and Hsu 2001) for further discussions about synchronization of scheduling for AGVs on a linear topology of path layout.

References

  • Bish EK, Chen FY, Leong T-Y, Nelson BL, Ng JW-C, Simchi-Levi D (2005) Dispatching vehicles in a mega container terminal. OR Spectr 27(4):491–506

    Article  Google Scholar 

  • Buyurgan N, Meyyappanand L, Saygin C, Dagli CH (2007) Real-time routing selection for automated guided vehicles in a flexible manufacturing system. J Manuf Technol Manag 18(2):169–181

    Article  Google Scholar 

  • Chiew K, Li Y (2009) Multistage off-line permutation packet routing on a mesh: an approach with elementary mathematics. J Comput Sci Technol 24(1):175–180

    Article  Google Scholar 

  • Chiew K, Qin S (2009) Scheduling and routing of AMOs in an intelligent transport system. IEEE Trans Intell Transport Syst 10(3):547–552

    Article  Google Scholar 

  • Corréa AI, Langevin A, Rousseau LM (2007) Scheduling and routing of automated guided vehicles: a hybrid approach. Comput Oper Res 34(6):1688–1707

    Article  Google Scholar 

  • Deroussi L, Gourgand M, Tchernev N (2008) A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int J Prod Res 46(8):2143–2164

    Article  Google Scholar 

  • Desaulniers G, Langevin A, Riopel D (2003) Dispatching and conflict-free routing of automated guided vehicles: an exact approach. Int J Flexible Manuf Syst 15(4):309–331

    Article  Google Scholar 

  • Ghasemzadeh H, Behrangi E, Azgomi MA (2009) Conflict-free scheduling and routing of automated guided vehicles in mesh topologies. Robot Auton Syst 57(6–7):738–748

    Article  Google Scholar 

  • Grunow M, Günther H-O, Lehmann M (2006) Strategies for dispatching AGVs at automated seaport container terminals. OR Spectr 28(4):587–610

    Article  Google Scholar 

  • Huang W, Chung PWH (2005) Integrating routing and scheduling for pipeless plants in different layouts. Comput Chem Eng 29(5):1069–1081

    Article  Google Scholar 

  • Kim CO, Kim SS (1997) An efficient real-time deadlock-free control algorithm for automated manufacturing systems. Int J Prod Res 35(6):1545–1560

    Article  Google Scholar 

  • Le-Anh T (2005) Intelligent control of vehicle-based internal transport systems. PhD thesis, Erasmus Research Institute of Management (ERIM), Erasmus University Rotterdam, The Netherlands

  • Lehmann M, Grunow M, Günther H-O (2006) Deadlock handling for real-time control of AGVs at automated container terminals. OR Spectr 28(4):631–657

    Article  Google Scholar 

  • Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, chapter 1. Morgan Kaufmann Publishers Inc, USA

    Google Scholar 

  • Liao D-Y, Fu H-S (2004) Speedy delivery—dynamic OHT allocation and dispatching in large-scale, 300-mm AMHS management. IEEE Robot Autom Mag 11(3):22–32

    Article  Google Scholar 

  • Lin L, Shinn SW, Gen M, Hwang H (2006) Network model and effective evolutionary approach for AGV dispatching in manufacturing system. J Intell Manuf 17(4):465–477

    Article  Google Scholar 

  • Maza S, Castagna P (2005) A performance-based structural policy for conflict-free routing of bi-directional automated guided vehicles. Comput Ind 56(7):719–733

    Article  Google Scholar 

  • Montoya-Torres JR (2006) A literature survey on the design approaches and operational issues of automated wafer-transport systems for wafer fabs. Prod Plan Control 17(7):648–663

    Article  Google Scholar 

  • Naso D, Turchiano B (2005) Multicriteria meta-heuristics for AGV dispatching control based on computational intelligence. IEEE Trans Syst Man Cybern Part B Cybern 35(2):208–226

    Article  Google Scholar 

  • Nishi T, Morinaka S, Konishi M (2007) A distributed routing method for AGVs under motion delay disturbance. Robot Comput Integr Manuf 23(5):517–532

    Article  Google Scholar 

  • Ota J (2006) Multi-agent robot systems as distributed autonomous systems. Adv Eng Inform 20(1):59–70

    Article  Google Scholar 

  • Preminger S (1995) Complexity analysis of movement in multi robot system. Master’s thesis, Department of Applied Mathematics, the Weizmann Institute of Science, Rehovot, Israel

  • Qiu L (2003) Scheduling and routing of automated guided vehicles. PhD thesis, School of Computer Engineering, Nanyang Technological University, Singapore

  • Qiu L, Hsu W-J (2001) A bi-directional path layout for conflict-free routing of AGVs. Int J Prod Res 39(10):2177–2195

    Article  Google Scholar 

  • Qiu L, Hsu W-J (2003) Continuous scheduling of AGVs in a mesh-like path topology. In Proceedings of the 2003 IEEE intelligent vehicles symposium (IV 2003), pp 62–67, Columbus, Ohio, USA, June 9–11

  • Qiu L, Hsu W-J, Huang S-Y, Wang H (2002) Scheduling and routing algorithms for AGVs: a survey. Int J Prod Res 40(3):745–760

    Article  Google Scholar 

  • Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research—a classification and literature review. OR Spectr 26(1):3–49

    Article  Google Scholar 

  • Zeng J, Hsu W-J (2003) Off-line AGV routing on the 2D mesh topology with partial permutation. In Proceedings of the IEEE 6th international conference on intelligent transportation systems (ITSC’03), pp 953–957, Shanghai, China, October 12–15

  • Zeng J, Hsu W-J (2008) Conflict-free container routing in mesh yard layouts. Robot Auton Syst 56(5):451–460

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kevin Chiew.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chiew, K. Scheduling and routing of autonomous moving objects on a mesh topology. Oper Res Int J 12, 385–397 (2012). https://doi.org/10.1007/s12351-010-0093-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-010-0093-z

Keywords

Navigation