Advertisement

Simultaneous Planning and Scheduling for Multi-Autonomous Vehicles

  • D. K. Liu
  • A. K. Kulatunga
Part of the Studies in Computational Intelligence book series (SCI, volume 49)

Keywords

Path Planning Collision Avoidance Task Allocation Container Terminal Autonomous Vehicle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Asef-Vaziri A, Laporte G (2005) Loop based facility planning and material handling. European Journal of Operational Research, 164: 1-11zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Baker B, Ayechew M (2003) A genetic algorithm for the vehicle routing problem. Computers and Operations Research, 30: 787-800zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    Bertsekas DP, Castanon DA (1989) The Auction Algorithm for Transportation Problems. Annals of Operations Research, 20: 67-96zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Bish EK, Leong TY, Li CL, Cheong Ng JW, Simchi-Levi D (2001) Analysis of a new vehicle scheduling and location problem. Naval Research Logistics 48: 363-385zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Bish EK, Chen FY, Leong YT, Nelson BL, Ng WC, Simchi-Levi D (2005) Dispatching vehicles in a mega container terminal. OR Spectrum 27: 491-506zbMATHCrossRefGoogle Scholar
  6. [6]
    Boddy MS, Bennett BH, Isle BA, Isle RA (2004) NASA Planning and Scheduling Applications: Emerging Technologies and Mission Trends. Final Report, 28/03/2004, Adventium Labs, USAGoogle Scholar
  7. [7]
    Botelho SC, Alami R (1999) M+: A scheme for multi-robot cooperation through negotiated task allocation and achievement. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA’99) Detroit, Michigan, pp1234-1239Google Scholar
  8. [8]
    Buriol LS, Ressende MGC, Thorup, M (2003) Speeding up Dynamic Shortest Path Algorithms. At&T Labs Research Technical Report TD-5RJ8BGoogle Scholar
  9. [9]
    Chiba R, Ota J, Arai T (2004) Integrated design for AGV systems using cooperative co-evolution. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, September 28-October 2, 2004, Sendai, Japan, pp3791-3796Google Scholar
  10. [10]
    Colorni A, Dorigo M, Maniezzo V (1991) Distributed Optimization by Ant Colonies. Proceedings of the First European Conference on Artificial Life (ECAL 91), pp134-142Google Scholar
  11. [11]
    De Koster RBM, Le-Anh T, Van der Meer JR (2004) Testing and classifying vehicle dispatching rules in three real-world settings. Journal of Operations Management 22:369-386CrossRefGoogle Scholar
  12. [12]
    Ebben M, Van der Heijden M, Hurink J, Schutten M (2004) Modeling of capacitated transportation systems for integral scheduling. OR Spectrum 26: 263-282.zbMATHCrossRefGoogle Scholar
  13. [13]
    Egbelu PJ, Tanchoco JMA (1984) Characterization of automatic guided vehicle dispatching rules. International Journal of Production Research 22: 359-374.CrossRefGoogle Scholar
  14. [14]
    Farling BE, Mosier CT, Mahmoodi F (2001) Analysis of automated guided vehicle configurations in flexible manufacturing systems. International Journal of Production Research, 39: 4222-4239Google Scholar
  15. [15]
    Ferguson D, Stentz A (2005) The Delayed D* algorithm for efficient path replanning. Proceedings of the 2005 IEEE International Conference on Robotics and Automation Barcelona, Spain, pp2057-2062Google Scholar
  16. [16]
    Fu L, Rilett LR (1996) Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research, Part B: Methodological 32: 499-516CrossRefGoogle Scholar
  17. [17]
    Gerkey BP, Mataric MJ (2001) Sold! Auction methods for multi-robot coordination. IEEE Transactions on Robotics and Automation, 18: 758-768CrossRefGoogle Scholar
  18. [18]
    Grunow M, Gunther HO, Lehmann M (2004) Dispatching multi-load AGVs in highly automated seaport container terminals. OR Spectrum 26: 211-235zbMATHCrossRefGoogle Scholar
  19. [19]
    Horn MET, Efficient modelling of travel in networks with time-varying link speeds. CSIRO Mathematical and Information Sciences Technical Report CMIS 99/97 http://www.cmis.csiro.au/Mark.Horn/
  20. [20]
    Hsieh S, Kang TP (1998) Developing AGVs Petri Net Control Models from Flowpath Nets. Journal of Manufacturing Systems, 17: 237-250CrossRefGoogle Scholar
  21. [21]
    Husdal J (2000) Fastest path problems in dynamic transportation networks. University of Leicester, UK http://www.husdal.com/mscgis/research.htm
  22. [22]
    Hussain T, Montana D, Vidaver G (2004) Evolution-based deliberative planning for cooperating unmanned ground vehicles in a dynamic environment. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)Google Scholar
  23. [23]
    Kirkpatrick S, Vecchi MP (1983) Optimization by Simulated Annealing. Science, 2204598: 671-680CrossRefMathSciNetGoogle Scholar
  24. [24]
    Koo PH, Lee WS, Jang DW (2004) Fleet sizing and vehicle routing for container transportation in a static environment. OR Spectrum 26: 193-209zbMATHCrossRefGoogle Scholar
  25. [25]
    Kulatunga AK, Liu DK, Dissanayake G (2004) Simulated Annealing Algorithm based Multi-Robot Coordination. Proceedings of the 3rd IFAC Symposium on Mechatronic Systems, Sydney, Australia, September, 2004, pp411-416Google Scholar
  26. [26]
    Kulatunga AK, Liu DK, Dissanayake G, Siyambalapitiya SB (2006) Ant colony optimization technique for simultaneous task allocation and path planning of autonomous vehicles. Proceedings of the IEEE International Conference on Cybernetics and Intelligent Systems (CIS), 7-9 June, 2006, Bankok, Thailand, pp823-828Google Scholar
  27. [27]
    Leong C Y (2001) Simulation study of dynamic AGV-container job deployment scheme. Master of science, National University of SingaporeGoogle Scholar
  28. [28]
    Lim JK, Kim KH, Yoshimoto K, Lee JH (2003) A dispatching method for automated guided vehicles by using a bidding concept. OR Spectrum 25: 25-44zbMATHCrossRefMathSciNetGoogle Scholar
  29. [29]
    Liu DK, Wu X, Kulatunga AK, Dissanayake G (2006) Motion Coordination of Multi-Autonomous Vehicles in Dynamic and Strictly Constrained Environments. Proceedings of the IEEE International Conference on Cybernetics and Intelligent Systems, 7-9 June 2006, Thailand, pp204-209Google Scholar
  30. [30]
    Meersmans PJM, Wagelmans APM (2001) Dynamic Scheduling of Handling Equipment at Automated Container Terminals https://ep.eur.nl/handle/1765/137
  31. [31]
    Moorthy RL, Hock-Guan W (2000) Deadlock prediction and avoidance in an AGV system. Master of science, Sri Ramakrishna Engineering College, National University of SingaporeGoogle Scholar
  32. [32]
    Moorthy RL, Hock-Guan W, Ng WC, Chung-Piaw T (2003) Cyclic deadlock prediction and avoidance for zone-controlled AGV system. International Journal of Production Economics, 83: 309-324CrossRefGoogle Scholar
  33. [33]
    Müller T (1983) Automated Guided Vehicles. IFS (Publications) Ltd. Springer-Verlag, K/BerlinGoogle Scholar
  34. [34]
    Oboth CB, Karwan MR (1999) Dynamic conflict-free routing of automated guided vehicles. International Journal of Production Research, 37: 20032028Google Scholar
  35. [35]
    Philippsen R, Siegwart R (2005) An interpolated dynamic navigation function. Proceedings of the 2005 IEEE International Conference on Robotics and Automation Barcelona, Spain, April 2005, pp3793-3800Google Scholar
  36. [36]
    Powell WB, Carvalho TA (1998) Real-time optimization of containers and flatcars for intermodal operations. Transportation Science 32:110-126zbMATHCrossRefGoogle Scholar
  37. [37]
    Qin Y, Sun D, Li N, Cen Y (2004) Path planning for mobile robot using the particle swarm optimization with mutation Operator. Proceedings of the 2004 International Conference on Machine Learning and Cybernetics, Aug. 2004, pp2473-2478Google Scholar
  38. [38]
    Qiu L, HsuW-J (2001) Scheduling of AGVs in a mesh-like path topology: a case study in a container terminal, Technical Report CAIS-TR-01-35, School of Computer Engineering, Nanyang Technological UniversityGoogle Scholar
  39. [39]
    Qiu L, Hsu WJ, Huang SY, Wang H (2002) Scheduling and Routing Algorithms for AGVs: a survey. International Journal of Production research 40: 745-760zbMATHCrossRefGoogle Scholar
  40. [40]
    Seifert RW, Kay MG, Wilson JR (1998) Evaluation of AGV routeing strategies using hierarchical simulation. International Journal of Production Research 36: 1961-1976zbMATHCrossRefGoogle Scholar
  41. [41]
    Srinivasan MM, Bozer YA, Cho M (1994) Trip-based material handling systems: Throughput capacity analysis. IIE Transactions 26: 70-89.CrossRefGoogle Scholar
  42. [42]
    Stentz A (1994) Optimal and efficient path planning for partially-known environments. Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, CA, USA, May 1994Google Scholar
  43. [43]
    Taghaboni-Dutta F, Tanchoco JM (1995) Comparison of dynamic routing techniques for automated guided vehicle system. International Journal of Production Research, 33: 2653-2617zbMATHCrossRefGoogle Scholar
  44. [44]
    Ulusoy GU, Bilge U (1993) Simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Research 31: 2857-2873CrossRefGoogle Scholar
  45. [45]
    Ulusoy GU, Sivrikaya SF, Bilge U (1997) A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. Computers & Operations Research, 24: 335-351zbMATHCrossRefMathSciNetGoogle Scholar
  46. [46]
    Vis IFA (2006) Survey of research in the design and control of automated guided vehicle systems. European Journal of Operational Research 170: 677-709zbMATHCrossRefGoogle Scholar
  47. [47]
    Wagner D, Willhalm T, Zaroliagis C (2003) Dynamic Shortest Paths Containers. Theoretical Computer Science, 92 http://www.elsevier.nl/locate/entcs/volume92. html
  48. [48]
    Yamashita H (2001) Analysis of dispatching rules of AGV systems with multiple vehicles. IIE Transactions 33: 889-895 Google Scholar
  49. [49]
    Zhan FB, Noon CE (1996) Shortest Path Algorithms: An Evaluation using Real Road. Transportation Science, 32: 65-73CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • D. K. Liu
    • 1
  • A. K. Kulatunga
    • 2
  1. 1.ARC Centre of Excellence for Autonomous SystemsUniversity of TechnologySydneyAustralia
  2. 2.ARC Centre of Excellence for Autonomous SystemsUniversity of TechnologySydneyAustralia

Personalised recommendations