Skip to main content

Multi-AGV Collision Avoidance Path Optimization for Unmanned Warehouse Based on Improved Ant Colony Algorithm

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1159))

Abstract

In this paper, the problem of collision avoidance path optimization for multi-AGV systems in unmanned warehouses is studied. A multi-AGV collision avoidance path optimization strategy based on elastic time window and improved ant colony algorithm is proposed. In this paper, the traditional ant colony algorithm is improved by heuristic information and pheromone update strategy to improve the execution speed and optimization ability of the algorithm. The priority scheduling of AGV tasks and the improvement of conflict resolution strategies are proposed to solve the different path conflicts between multiple AGVs. Based on the environment of the e-commerce logistics unmanned warehouse, the MATLAB simulation software is used to model and analyze the multi-AGV collision avoidance path planning. The experimental results show that the multi-AGV collision avoidance path planning can be realized based on the elastic time window and the improved ant colony algorithm, and the optimal collision avoidance path can be found in a short time.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    E represents the end grid; P represents the grid where the ants are located.

References

  1. http://it.people.com.cn/n1/2018/0530/c1009-30022080.html

  2. Guo, X., Ji, M., Liu, S.: AGV path planning in unmanned warehouse combining multi-objective and energy consumption control. Comput. Integr. Manuf. Syst. 1–15 (2019). http://kns.cnki.net/kcms/detail/11.5946.tp.20190315.0932.012.html

  3. Gu, B.: Research on path optimization of automatic guided vehicle system based on time window. Lanzhou Traffic Science (2015)

    Google Scholar 

  4. Tai, Y., Xing, K., Lin, Y., Zhang, W.: Research on multi-AGV path planning method. Comput. Sci. 44(S2), 84–87 (2017)

    Google Scholar 

  5. He, C., Mao, J.: Research on the path of AGV based on improved ant colony algorithm. Logistics Sci. Technol. 42(03), 60–65 (2019)

    Google Scholar 

  6. Meng, C., Ren, Y.: Multi-AGV scheduling based on multiple population genetic algorithm. Electron. Technol. 31(11), 47–50+68 (2018)

    Google Scholar 

  7. Yuan, R., Wang, H., Sun, L., Li, J.: Research on Task scheduling of order picking system based on Logistics AGV. Oper. Res. Manage. 27(10), 133–138 (2018)

    Google Scholar 

  8. Tang, S., Hong, Z.: Research on robot path planning based on ant colony algorithm. Electromech. Inf. (08), 46–47 (2019)

    Google Scholar 

  9. Zhao, Y., Zhang, S.: Intelligent traffic path planning based on improved ant colony algorithm. Industr. Instrum. Autom. Device (02), 30–32 (2019)

    Google Scholar 

  10. Wei, Y., Jin, W.: Intelligent vehicle path planning based on neural network Q-learning algorithm. Firepower Command Control 44(02), 46–49 (2019)

    Google Scholar 

  11. Li, J., Xu, B., Yang, Y., Wu, H.: Induced ant swarm particle swarm optimization algorithm for multi-automatic guided vehicle path planning. Comput. Integr. Manuf. Syst. 23(12), 2758–2767 (2017)

    Google Scholar 

  12. Pu, X., Su, H., Zou, W., Wang, P., Zhou, H.: Smooth path planning based on non-uniform environment modeling and third-order Bezier curve. J. Autom. 43(05), 710–724 (2017)

    Google Scholar 

  13. Xia, Y., Fu, Z., Xie, J.: Multi-automatic guided vehicle material distribution path planning according to order resolution. Comput. Integr. Manuf. Syst. 23(07), 1520–1528 (2017)

    Google Scholar 

  14. Hu, Q., Wang, T., Zhang, R.: Research on improved ant colony algorithm in AGV global path planning. Inf. Technol. Informatization (03), 116–118 (2019)

    Google Scholar 

  15. Fisher, M.L., Rnsten, J., et al.: Vehicle routing with time windows. Two Optim. Algorithms Oper. Res. 45(3), 488–492 (1997)

    Google Scholar 

  16. Wang, S., Mao, Y., Yuan, X.: Multi-AGV path optimization strategy for finite state machines. J. Overseas Chin. Univ. (Natural Science Edition) 40(02), 239–244 (2019)

    Google Scholar 

  17. Chen, G., Liu, J., Zhang, C.: Ant colony optimization with potential field based on grid map for mobile robot path planning. J. Donghua Univ. (English Edition) 33(05), 764–767 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Yang Yang , Jianmin Zhang or Yilin Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yang, Y., Zhang, J., Liu, Y., Song, X. (2020). Multi-AGV Collision Avoidance Path Optimization for Unmanned Warehouse Based on Improved Ant Colony Algorithm. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1159. Springer, Singapore. https://doi.org/10.1007/978-981-15-3425-6_41

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3425-6_41

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3424-9

  • Online ISBN: 978-981-15-3425-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics