Skip to main content

HAC-based adaptive combined pick-up path optimization strategy for intelligent warehouse

  • Original Research Paper
  • Published:
Intelligent Service Robotics Aims and scope Submit manuscript

Abstract

Smart warehousing has been widely used due to its efficient storage and applications. However, the efficiency of transporting high-demand goods is still limited, because the existing methods lack path optimization strategies applicable to multiple scenarios and are unable to adapt conflict strategies to different warehouses. For solving these problems, this paper considers a multi-robot path planning method from three aspects: conflict-free scheduling, order picking and collision avoidance, which is adaptive to the picking needs of different warehouses by hierarchical agglomerative clustering algorithm, improved Reservation Table, and Dynamic Weighted Table. Firstly, the traditional A* algorithm is improved to better fit the actual warehouse operation mode. Secondly, the reservation table method is applied to solve the head-on collision problem of robots, and this paper improves the efficiency of the reservation table by changing the form of the reservation table. And the dynamic weighted table is added to solve the multi-robot problem about intersection conflict. Then, the HAC algorithm is applied to analyse the goods demand degree in current orders based on historical order data and rearrange the goods order in descending order, so that goods with a high-demand degree can be discharged from the warehouse in the first batch. Moreover, a complete outbound process is presented, which integrates HAC algorithm, improved reservation table and dynamic weighting table. Finally, the simulation is done to verify the validity of the proposed algorithm, which shows that the overall transit time of high-demand goods is reduced by 21.84% on average compared to the “A* + reservation table” algorithm, and the effectiveness of the solution is fully verified.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Code Availability

All research data supporting this paper are directly available within this paper.

References

  1. Li Z, Wang X, Bi S, Zhao Q (2022) Collaborative path optimization method for flood control material storage. In: IoT and big data technologies for health care: second EAI international conference, IoTCare 2021, Part II, pp. 440–450

  2. Garnier S, Gautrais J, Theraulaz G (2007) The biological principles of swarm intelligence. Swarm Intell 1:3–31

    Article  Google Scholar 

  3. Agrawal A, Sudheer A, Ashok S (2015) Ant colony based path planning for swarm robots. In: Proceedings of the 2015 conference on advances in robotics, pp. 1–5

  4. Li S, Weihua S, Guo P, Zhang S, Xie P (2020) Research on SAR drone global path planning based on improved A* algorithm. Chin. Med. Equip. J 41(12):16–20

    Article  Google Scholar 

  5. Hidalgo-Paniagua A, Vega-Rodríguez MA, Ferruz J, Pavón N (2017) Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach. Soft Comput 21:949–964

    Article  Google Scholar 

  6. Liu Y, Chen Z, Li Y, Lu M, Chen C, Zhang X (2022) Robot search path planning method based on prioritized deep reinforcement learning. Int J Control Autom Syst 20(8):2669–2680

    Article  Google Scholar 

  7. Lv X, Li W, Wang J (2022) Safety-field-based path planning algorithm of lane changing for autonomous vehicles. Int J Control Autom Syst 20(2):564–576

    Article  Google Scholar 

  8. Bi S, Wang Q, Xu Y, Zhang Y (2023) Multiple factors collaborative optimisation of intelligent storage system. Int J Adv Mech Syst 10(4):165–173

    Google Scholar 

  9. Boysen N, Briskorn D, Emde S (2017) Parts-to-picker based order processing in a rack-moving mobile robots environment. Eur J Oper Res 262(2):550–562

  10. Xie L, Thieme N, Krenzler R, Li H (2021) Introducing split orders and optimizing operational policies in robotic mobile fulfillment systems. Eur J Oper Res 288(1):80–97

    Article  MathSciNet  Google Scholar 

  11. Zou B (2018) Study on operational policies optimization in vehicle-based storage and retrieval systems. PhD thesis, Huazhong University of Science and Technology

  12. Bolu A, Korçak Ö (2021) Adaptive task planning for multi-robot smart warehouse. IEEE Access 9:27346–27358

    Article  Google Scholar 

  13. Zhang J, Yang F, Weng X (2019) A building-block-based genetic algorithm for solving the robots allocation problem in a robotic mobile fulfilment system. Math Probl Eng 25:1–15

    Google Scholar 

  14. Fan LWHLY (2019) The collaborative scheduling of multi-mobile robots in intelligentwarehouse based on the lmproved genetic algorithm. J Wuhan Univ Technol (Inf Manag Eng) 41(3):293–298

    Google Scholar 

  15. Vivaldini K, Rocha LF, Martarelli NJ, Becker M, Moreira AP (2016) Integrated tasks assignment and routing for the estimation of the optimal number of AGVs. Int J Adv Manuf Technol 82:719–736

    Article  Google Scholar 

  16. Li F (2020) Big data-based method and system for warehouse storage space allocation. CN111476413A

  17. Zou X (2018) A study on the efficiency optimization of AVS/RS and picking in B2C e-commerce distribution center. PhD thesis, Shandong University

  18. Li X, Liang Y, Young Y (2019) Apriori algorithm-based analysis of storage space optimization for split-zero shelves. China Mark 27:181–182

    Google Scholar 

  19. Xue F, Dong T (2018) Research on the logistics robot task allocation method based on improved ant colony algorithm. Int J Wirel Mob Comput 14(4):307–311

    Article  Google Scholar 

  20. Merschformann M, Lamballais T, De Koster M, Suhl L (2019) Decision rules for robotic mobile fulfillment systems. Oper Res Perspect 6:100128

  21. Bi S, Li Z, Wang L, Xu Y (2023) Dynamic weighted and heat-map integrated scalable information path-planning algorithm. EAI Endorsed Trans Scalable Inf Syst 10(2):e5

    Google Scholar 

  22. Pagnuco I, Pastore J, Abras G, Brun M, Ballarin V (2017) Analysis of genetic association using hierarchical clustering and cluster validation indices. Genomics 109(5–6):438–445

    Article  Google Scholar 

  23. Hu R, Dou W, Liu J (2014) A clustering-based collaborative filtering approach for big data application. IEEE Trans Emerg Top Comput 2(3):302–313

  24. Tan P-N, Steinbach M, Kumar V (2016) Introduction to data mining. Pearson India

  25. Lung C-H, Zhou C (2010) Using hierarchical agglomerative clustering in wireless sensor networks: an energy-efficient and flexible approach. Ad Hoc Netw 8(3):328–344

    Article  Google Scholar 

  26. Chim H, Deng X (2008) Efficient phrase-based document similarity for clustering. IEEE Trans Knowl Data Eng 20(9):1217–1229

    Article  Google Scholar 

  27. Han X, Zhu Y, Ting KM, Li G (2023) The impact of isolation kernel on agglomerative hierarchical clustering algorithms. Pattern Recogn 139:109517

    Article  Google Scholar 

  28. Xia D, Wu Y, Wang Y, Zou X (2019) Order sequence optimization for parts-to-picker intelligent robot system. J Shenzhen Univ Sci Eng 36(06):696–701

    Google Scholar 

  29. Ward JH Jr (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236–244

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work was supported by the Natural Science Foundation of Shandong Province (ZR2020KF027, ZR2023MF024, ZR2023MF121).

Author information

Authors and Affiliations

Authors

Contributions

All authors contributed to the study conception and design. Material preparation, data collection and analysis were performed by [SB], [ZL], [HL] and [YX]. The first draft of the manuscript was written by [SB], [ZL]. The second draft of the manuscript was finished by [SB] and [RS]. [YZ] participates partly the numerical simulation. All authors commented on previous versions of the manuscript. All authors read and approved the final manuscript.

Corresponding authors

Correspondence to Yuan Xu or Zhihao Li.

Ethics declarations

Conflict of interest

The authors declare that there is no competing financial interest or personal relationship that could have appeared to influence the work reported in this paper.

Consent for publication

All authors consent that this article is publicated in Intelligent Service Robotics.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary Information

Below is the link to the electronic supplementary material.

Supplementary file 1 (xlsx 87005 KB)

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bi, S., Shang, R., Luo, H. et al. HAC-based adaptive combined pick-up path optimization strategy for intelligent warehouse. Intel Serv Robotics 17, 1031–1043 (2024). https://doi.org/10.1007/s11370-024-00556-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11370-024-00556-z

Keywords