A path planning algorithm for mobile robots combining bidirectional scanning and sampling with virtual obstacles (original) (raw)

Abstract

To address the issue that path planning algorithms in common indoor/outdoor obstacle environments fail to simultaneously maintain higher efficiency, shorter paths, and fewer turning points, a bidirectional scanning and sampling algorithm with virtual obstacles (BSS-VO) is proposed by integrating grid-based and sampling-based methods in this study. First, a bidirectional scanning and sampling method combining with virtual obstacles (BSS-VO) is proposed, which reduces computational load compared to grid-based algorithms while avoiding massive random and useless sampling typical of sampling-based approaches. Second, reverse search-based path optimization shortens generated path lengths and decreases turning points, thereby reducing motion time and enhancing trajectory smoothness for mobile robots. Third, simulation experiments were conducted in five typical simulation environments, with comparisons made against the Dijkstra, A*, D*, Jump Point Search (JPS), RRT, and RRT* algorithms. The simulation experiment results demonstrated that although the BSS-VO algorithm is slightly longer than the JPS algorithm in terms of planning time, the gap is within 0.1 s. However, the BSS-VO algorithm has significant improvements compared with other algorithms in terms of path length and the number of turning points. Finally, physical experiments were conducted using mobile robots in a real-world environment comprising three classrooms connected by a shared corridor, with comparative analysis performed against the Dijkstra, A*, D*, Jump Point Search (JPS), RRT, and RRT* algorithms. The physical experimental results in real-world environments confirmed that the BSS-VO algorithm significantly outperforms the Dijkstra, A*, and D* algorithms in efficiency metrics. Path planning time was reduced by over 89%, while the number of turning points decreased by more than 40%. Compared to the Jump Point Search (JPS) algorithm, planning time increased by approximately 0.1s, but turning points were reduced by over 23%, which is more conducive to path planning and execution for mobile robots in physical settings. Additionally, dynamic environment experiments demonstrated that the BSS-VO algorithm exhibits enhanced adaptability to dynamic scenarios when integrated with local path planning methods.

Access this article

Log in via an institution

Subscribe and save

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Rubio F, Valero F, Llopis-Albert C (2019) A review of mobile robots: concepts, methods, theoretical framework, and applications. Int J Adv Rob Syst 16(2):1729881419839596
    Article Google Scholar
  2. Chae H-W, Choi J-H, Song J-B (2020) Robust and autonomous stereo visual-inertial navigation for non-holonomic mobile robots. IEEE Trans Veh Technol 69(9):9613–9623
    Article Google Scholar
  3. Ali MA, Shanono IH et al (2020) Path planning methods for mobile robots: a systematic and bibliometric review. ELEKTRIKA-J Electr Eng 19(3):14–34
    Google Scholar
  4. Kazemi M, Gupta KK, Mehrandezh M (2013) Randomized kinodynamic planning for robust visual servoing. IEEE Trans Rob 29(5):1197–1211
    Article Google Scholar
  5. Goretkin G, Perez A, Platt R, Konidaris G (2013) Optimal sampling-based planning for linear-quadratic kinodynamic systems. In: 2013 IEEE international conference on robotics and automation, IEEE, pp 2429–2436
  6. Johnson DB (1973) A note on dijkstra’s shortest path algorithm. J ACM 20(3):385–388. https://doi.org/10.1145/321765.321768
    Article MathSciNet Google Scholar
  7. Zhu D-D, Sun J-Q (2021) A new algorithm based on dijkstra for vehicle path planning considering intersection attribute. IEEE Access 9:19761–19775
    Article Google Scholar
  8. Alshammrei S, Boubaker S, Kolsi L (2022) Improved dijkstra algorithm for mobile robot path planning and obstacle avoidance. Comput Mater Contin 72:5939–5954
    Google Scholar
  9. Duraklı Z, Nabiyev V (2022) A new approach based on bezier curves to solve path planning problems for mobile robots. J Comput Sci 58:101540
    Article Google Scholar
  10. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybernet 4(2):100–107
    Article Google Scholar
  11. Min H, Xiong X, Wang P, Yu Y (2021) Autonomous driving path planning algorithm based on improved a* algorithm in unstructured environment. Proc Inst Mech Eng Part D J Automob Eng 235(2–3):513–526
    Article Google Scholar
  12. Li C, Huang X, Ding J, Song K, Lu S (2022) Global path planning based on a bidirectional alternating search a* algorithm for mobile robots. Comput Ind Eng 168:108123
    Article Google Scholar
  13. Lin M, Yuan K, Shi C, Wang Y (2017) Path planning of mobile robot based on improved a* algorithm. In: 2017 29th Chinese control and decision conference (CCDC), pp 3570–3576. https://doi.org/10.1109/CCDC.2017.7979125
  14. 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 Rob Syst 18(5):17298814211042730
    Article Google Scholar
  15. Wang H, Yin P, Zheng W, Wang H, Zuo J (2020) Mobile robot path planning based on improved a* algorithm and dynamic window method. Robot 42(03):346–353
    Google Scholar
  16. Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proceedings of the 1994 IEEE international conference on robotics and automation, IEEE, pp 3310–3317
  17. Heo S-N, Chen J, Liao Y-C, Lee H-h (2022) Auto-splitting d* lite path planning for large disaster area. Intell Serv Robot 15(3):289–306
    Article Google Scholar
  18. Yu J, Yang M, Zhao Z, Wang X, Bai Y, Wu J, Xu J (2022) Path planning of unmanned surface vessel in an unknown environment based on improved d* lite algorithm. Ocean Eng 266:112873
    Article Google Scholar
  19. Sun B, Zhang W, Li S, Zhu X (2022) Energy optimised d* auv path planning with obstacle avoidance and ocean current environment. J Navig 75(3):685–703
    Article Google Scholar
  20. Harabor D, Grastien A (2011) Online graph pruning for pathfinding on grid maps 25(1):1114–1119
  21. Harabor D, Grastien A (2014) Improving jump point search 24:128–135
  22. Liu L, Yao J, He D, Chen J, Huang J, Xu H, Wang B, Guo J (2021) Global dynamic path planning fusion algorithm combining jump-a* algorithm and dynamic window approach. IEEE Access 9:19632–19638
    Article Google Scholar
  23. LaValle SM, Kuffner JJ (2001) Rapidly-exploring random trees: progress and prospects. Algorithmic and computational robotics, 303–307
  24. Kuffner J, RRT-Connect SL (2000) An efficient approach to single-query path planning. In: IEEE international conference on robotics and automation. San Francisco, pp 473–479
  25. Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 30(7):846–894
    Article Google Scholar
  26. Jordan M, Perez A (2013) Optimal bidirectional rapidly-exploring random trees
  27. Islam F, Nasir J, Malik U, Ayaz Y, Hasan O (2012) Rrt*-smart: rapid convergence implementation of rrt* towards optimal solution. In: 2012 IEEE international conference on mechatronics and automation, pp 1651–1656. https://doi.org/10.1109/ICMA.2012.6284384
  28. Gammell JD, Srinivasa SS, Barfoot TD (2014) Informed rrt*: optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: 2014 IEEE/RSJ international conference on intelligent robots and systems, IEEE, pp 2997–3004
  29. Gammell JD, Srinivasa SS, Barfoot TD (2015) Batch informed trees (bit*): sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs. In: 2015 IEEE international conference on robotics and automation (ICRA), IEEE, pp 3067–3074
  30. Strub MP, Gammell JD (2015) Adaptively informed trees (ait*): fast asymptotically optimal path planning through adaptive heuristics. In: 2020 IEEE international conference on robotics and automation (ICRA), IEEE, pp 3191–3198 (2020)
  31. Li B, Chen B (2021) An adaptive rapidly-exploring random tree. IEEE/CAA J Automat Sinica 9(2):283–294
    Article Google Scholar
  32. Kang J-G, Lim D-W, Choi Y-S, Jang W-J, Jung J-W (2021) Improved rrt-connect algorithm based on triangular inequality for robot path planning. Sensors 21(2):333
    Article Google Scholar
  33. Jeong I-B, Lee S-J, Kim J-H (2019) Quick-rrt*: Triangular inequality-based implementation of rrt* with improved initial solution and convergence rate. Expert Syst Appl 123:82–90
    Article Google Scholar
  34. Liao B, Wan F, Hua Y, Ma R, Zhu S, Qing X (2021) F-rrt*: An improved path planning algorithm with improved initial solution and convergence rate. Expert Syst Appl 184:115457
    Article Google Scholar
  35. Colorni A, Dorigo M, Maniezzo V et al (1991) Distributed optimization by ant colonies. Proceedings of the First European Conference on Artificial Life 142:134–142 (Paris, France)
  36. Sangeetha V, Ravichandran K, Shekhar S, Tapas AM (2019) An intelligent gain-based ant colony optimisation method for path planning of unmanned ground vehicles. Def Sci J 69(2):167–172
    Article Google Scholar
  37. Bremermann HJ (1958) The Evolution of Intelligence: The Nervous System as a Model of Its Environment. University of Washington, Department of Mathematics, ???
  38. Qu H, Xing K, Alexander T (2013) An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots. Neurocomputing 120:509–517
    Article Google Scholar
  39. Nazarahari M, Khanmirza E, Doostie S (2019) Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm. Expert Syst Appl 115:106–120
    Article Google Scholar
  40. Chan H, Tam K, Leung N (1993) A neural network approach for solving the path planning problem. In: 1993 IEEE international symposium on circuits and systems (ISCAS), IEEE, pp 2454–2457
  41. Liu L, Wang Y-N, Kuang F, Zhang H (2007) Path planning of mobile robot based on neural network and genetic algorithm. Jisuanji Yingyong Yanjiu/ Appl Res Comput 24(2):264–265
    Google Scholar
  42. Huang Y (2012) Intelligent technique for robot path planning using artificial neural network and adaptive ant colony optimization. J Converg Inf Technol 7(9):246–252
    Google Scholar
  43. Pandey KK, Mohanty PK, Parhi DR (2014) Real time navigation strategies for webots using fuzzy controller. In: 2014 IEEE 8th international conference on intelligent systems and control (ISCO), IEEE, pp 10–16
  44. Rath AK, Parhi DR, Das HC, Muni MK, Kumar PB (2018) Analysis and use of fuzzy intelligent technique for navigation of humanoid robot in obstacle prone zone. Defence Technol 14(6):677–682
    Article Google Scholar
  45. Kumar PB, Sahu C, Parhi DR (2018) A hybridized regression-adaptive ant colony optimization approach for navigation of humanoids in a cluttered environment. Appl Soft Comput 68:565–585
    Article Google Scholar
  46. Mohanty PK (2020) An intelligent navigational strategy for mobile robots in uncertain environments using smart cuckoo search algorithm. J Ambient Intell Humaniz Comput 11(12):6387–6402
    Article Google Scholar
  47. Mohanty PK, Parhi DR (2014) A new efficient optimal path planner for mobile robot based on invasive weed optimization algorithm. Front Mech Eng 9:317–330
  48. Biswal P, Mohanty PK (2021) Modeling and effective foot force distribution for the legs of a quadruped robot. Robotica 39(8):1504–1517
  49. Shan E, Dai B, Song J, Sun Z (2009) A dynamic rrt path planning algorithm based on b-spline. In: 2009 second international symposium on computational intelligence and design, vol 2. IEEE, pp 25–29
  50. Rösmann C, Feiten W, Wösch T, Hoffmann F, Bertram T (2012) Trajectory modification considering dynamic constraints of autonomous robots. In: ROBOTIK 2012; 7th German conference on robotics, pp 1–6. VDE

Download references

Acknowledgements

This work was financially supported by the Science and Technology Research Program of Chongqing Municipal Education Commission (Grant No. KJZD-K202201104), China, and Ningbo Key Research and Development Plan and “Open Bidding for Selecting the Best Candidates” project (2023Z135), China.

Author information

Authors and Affiliations

  1. College of Mechanical Engineering, Chongqing University of Technology, Chongqing, China
    Yi Wang, Junyao Gao, Weimeng Song, Zihan Zhou, Hongmei Zhao, Juan Li & Yufei Xu

Authors

  1. Yi Wang
  2. Junyao Gao
  3. Weimeng Song
  4. Zihan Zhou
  5. Hongmei Zhao
  6. Juan Li
  7. Yufei Xu

Corresponding author

Correspondence toYi Wang.

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

Cite this article

Wang, Y., Gao, J., Song, W. et al. A path planning algorithm for mobile robots combining bidirectional scanning and sampling with virtual obstacles.Intel Serv Robotics 19, 11 (2026). https://doi.org/10.1007/s11370-025-00658-2

Download citation

Keywords