Skip to main content

Advertisement

Springer Nature Link
Log in

A self-adaptive safe A* algorithm for AGV in large-scale storage environment

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

Abstract

This paper presents a safe A* algorithm for the path planning of automated guided vehicles (AGVs) operating in storage environments. Firstly, to overcome the problems of great collision risk and low search efficiency in the path produced by traditional A* algorithm, a new evaluation function is designed by introducing repulsive term and assigning dynamic adjustment weights to heuristic items. Secondly, a Floyd deletion algorithm based on the safe distance is proposed to remove redundant path points for reducing the path length. Moreover, the algorithm replaces the broken line segments at the turns with a cubic B-spline to ensure the smoothness of turning points. The simulation applied to different scenarios and different specifications showed that, compared with other three typical path planning algorithms, the path planned by the proposed safe A* algorithm always keeps a safe distance from the obstacle and the path length is reduced by 1.95\(\%\), while the planning time is reduced by 25.03\(\%\) and the number of turning point is reduced by 78.07\(\%\) on average.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

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

Similar content being viewed by others

Explore related subjects

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

Data availability

Not applicable.

Code Availability

Not applicable.

References

  1. Xue F, Tang H, Su Q, Li T (2019) Task allocation of intelligent warehouse picking system based on multi-robot coalition. KSII Trans Internet Inform Syst 13:3566–3582

    Google Scholar 

  2. Vivaldini KC, Galdames JP, Bueno TS, Araujo RC, Sobral RM, Becker M, Caurin GA (2010) Robotic forklifts for intelligent warehouses: routing, path planning, and auto-localization. In: 2010 IEEE international conference on industrial technology, Via del Mar, Chile, pp 1463–1468

  3. Yu J, Li R, Feng Z, Zhao A, Yu Z, Ye Z, Wang J (2020) A novel parallel ant colony optimization algorithm for warehouse path planning. J Control Sci Eng 2020:5287189

    Article  Google Scholar 

  4. Xiang D, Lin H, Ouyang J, Huang D (2022) Combined improved A* and greedy algorithm for path planning of multi-objective mobile robot. Sci Rep 12:13273

    Article  Google Scholar 

  5. Karur K, Sharma N, Dharmatti C, Siegel JE (2021) A survey of path planning algorithms for mobile robots. Vehicles 3:448–468

    Article  Google Scholar 

  6. Wang H, Yu Y, Yuan Q (2011) Application of Dijkstra algorithm in robot path-planning. In: 2011 second international conference on mechanic automation and control engineering, Hohhot, pp 1067-1069. https://doi.org/10.1109/MACE.2011.5987118

  7. Tang XR, Zhu Y, Jiang XX (2021) Improved A-star algorithm for robot path planning in static environment. J Phys 1792:12067–12075

    Google Scholar 

  8. Xin P, Wang X, Liu X, Wang Y, Zhai Z, Ma X (2023) Improved bidirectional RRT* algorithm for robot path planning. Sensors 23:1041

    Article  Google Scholar 

  9. Cao K, Cheng Q, Gao S, Chen Y, Chen C (2019) Improved PRM for path planning in narrow passages. In: 2019 IEEE international conference on mechatronics and automation, Tianjin, China, pp 45–50

  10. Cheng J, Miao Z. Li B. Xu W (2016) An improved ACO algorithm for mobile robot path planning. In 2016 IEEE international conference on information and automation, Ningbo, China, pp 963–968

  11. Guo X, Ji M, Zhao Z, Wen D, Zhang W (2020) Global path planning and multi-objective path control for unmanned surface vehicle based on modified particle swarm optimization (PSO) algorithm. Ocean Eng 216:107693

    Article  Google Scholar 

  12. Li Z, Xiong L, Zeng D, Fu Z, Leng B, Shan F (2021) Real-time local path planning for intelligent vehicle combining tentacle algorithm and B-spline curve. IFAC-PapersOnLine 54:51–58

    Article  Google Scholar 

  13. Tuncer A, Yildirim M (2012) Dynamic path planning of mobile robots with improved genetic algorithm. Comput Electr Eng 38:1564–1572

    Article  Google Scholar 

  14. Harabor DD, Grastien A (2011) Online graph pruning for pathfinding on grid maps. In: AAAI conference on artificial intelligence, San Francisco California, vol 07, pp 1114–1119

  15. Li Y, Zhang H, Zhu H, Li J, Yan W, Wu YIBAS (2018) Index based A-star. IEEE Access 6:11707–11715

    Article  Google Scholar 

  16. Lin M, Yuan K, Shi C (2017) Path planning of mobile robot based on improved A* algorithm. In: 2017 29th Chinese control and decision conference, Chongqing, China, pp 3570–3576

  17. Shang E, Dai B, Nie Y, Zhu Q, Xiao L, Zhao D (2020) A guide-line and key-point based A-star path planning algorithm for autonomous land vehicles. In: 2020 IEEE 23rd international conference on intelligent transportation systems, Rhodes, Greece, pp 1–7

  18. Fransen K, van Eekelen J (2023) Efficient path planning for automated guided vehicles using A* (Astar) algorithm incorporating turning costs in search heuristic. Int J Prod Res 61:707–725

    Article  Google Scholar 

  19. Gao H, Ma Z, Zhao Y (2021) A fusion approach for mobile robot path planning based on improved a algorithm and adaptive dynamic window approach. In: 2021 IEEE 4th international conference on electronics technology, Chengdu, China, pp 882–886

  20. Raheem FA, Abdulkareem MI (2020) Development of A* algorithm for robot path planning based on modified probabilistic roadmap and artificial potential field. J Eng Sci Technol 15:3034–3054

    Google Scholar 

  21. Zhang J, Wu J, Shen X, Li Y (2021) Autonomous land vehicle path planning algorithm based on improved heuristic function of A-Star. Int J Adv Robot Syst 18:1–10

    Article  Google Scholar 

  22. Tang G, Tang C, Claramunt C, Hu X, Zhou P (2021) Geometric A-star algorithm: an improved A-star algorithm for AGV path planning in a port environment. IEEE Access 9:59196–59210

    Article  Google Scholar 

  23. Song R, Liu Y, Bucknall R (2019) Smoothed A* algorithm for practical unmanned surface vehicle path planning. Appl Ocean Res 83:9–20

    Article  Google Scholar 

  24. Saeed RA, Recupero DR, Remagnino P (2020) A boundary node method for path planning of mobile robots. Robot Auton Syst 123:103320

    Article  Google Scholar 

  25. Wang HB, Hao C, Zhang P (2019) Path planning for mobile robots based on A* algorithm and artificial potential field method. China Mech Eng 30:2489–2496

  26. Ou Y, Fan Y, Zhang X, Lin Y, Yang W (2022) Improved A* path planning method based on the grid map. Sensors 22:6198

    Article  Google Scholar 

  27. Xu X, Fu L, Zhang Y (2020) Path planning based on diagonal obstacle detection and optimized ant colony optimization. J Yunnan Univ 42:648–655

    Google Scholar 

  28. Li C, Huang X, Ding J et al (2022) Global path planning based on a bidirectional alternating search A* algorithm for mobile robots. Comput Ind Eng 168:108123

Download references

Funding

This research mainly supported by Natural Science Foundation of Shaanxi Province of China (NO. 2021JM-363). In addition, this paper is partly supported by Local Projects Guided by the Central Government (NO. XZ202301YD0003C) and Key Laboratory Project of Shaanxi Provincial Department of Education (NO.20JS065).

Author information

Author notes

  1. Qiyu Zhang, Zhifeng Bai and Guifang Guo have contributed equally to this work.

Authors and Affiliations

  1. School of Mechanical and Electrical Engineering, Xi’an University of Architecture and Technology, Xian, 710311, Shanxi, China

    Xiaolan Wu, Qiyu Zhang & Zhifeng Bai

  2. School of Information Engineering, Xizang Minzu University, Xianyang, 712082, Shanxi, China

    Guifang Guo

Authors
  1. Xiaolan Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Qiyu Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Zhifeng Bai
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Guifang Guo
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

All authors contributed to the study conception and design. Zhifeng Bai contributed to the conception of the study; Xiaolan Wu contributed significantly to analysis and manuscript preparation; Qiyu Zhang performed the data analyses and wrote the manuscript; Guifang Guo helped perform the analysis with constructive discussions.

Corresponding author

Correspondence to Zhifeng Bai.

Ethics declarations

Conflict of interest

The authors have no relevant financial or non-financial interests to disclose.

Ethics approval

The study does not involve humans and animals.

Consent to participate

The study does not involve human subjects.

Consent for publication

The study does not involve human subjects.

Additional information

Publisher's Note

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

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

Wu, X., Zhang, Q., Bai, Z. et al. A self-adaptive safe A* algorithm for AGV in large-scale storage environment. Intel Serv Robotics 17, 221–235 (2024). https://doi.org/10.1007/s11370-023-00494-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11370-023-00494-2

Keywords