Skip to content
2000
  1. Home
  2. A-Z Publications
  3. Recent Patents on Engineering
  4. Fast Track Articles
  5. Fast Track Article
image of A Review of Research on Shortest Path Planning Algorithms for Mobile Robots
file format pdf download PDF

Abstract

Background

Path planning technology has a wide range of applications in many fields. Applications in the field of high technology include: autonomous and touchless action of robots; obstacle avoidance and defense flight of drones; cruise missiles to avoid radar search, anti-bouncing attacks, and to complete the task of sudden defense and demolition. Applications in daily life include: GPS navigation; road planning based on GIS system; urban road network planning and navigation. Applications in the field of decision-making management include: vehicle problem (VRP) in logistics management and similar resource allocation problems in resource management. Routing problems in the field of communication technology. Any planning problem that can be topologized as a point and line network can basically be solved by the method of path planning. Different intelligent algorithms have different characteristics, and their application scope and fields are also different, so it is of great significance for the development of path planning technology to study the path planning intelligent algorithms from the characteristics of the algorithms themselves and their applications.

Objective

Analyze the advantages and disadvantages of various types of planning algorithms, look forward to the future development trend of mobile robot path planning, and provide certain ideas for the research of mobile robot path planning.

Method

Search journals, patents, conferences, and papers related to mobile robot path planning, and summarize and analyze the advantages and disadvantages of various planning algorithms.

Results

Based on the research results of many scholars, this study summarizes different mobile robot path planning methods. It is divided into four categories: traditional planning, intelligent search, artificial intelligence and local obstacle avoidance. This paper introduces and analyzes the latest research results of these types, including their design ideas, advantages and disadvantages, and improvement measures. The research methods adopted are analyzed in order to maximize the advantages of each algorithm and expand the application field of robot path planning to provide ideas and references.

Conclusion

This paper provides guidance for the design and optimization of robot path planning. Finally, this paper summarizes the future development trend of robot path planning, and looks forward to the future development trend and key areas of robot path planning.

© 2024 The Author(s). Published by Bentham Science Publishers
© 2024 The Author(s). Published by Bentham Science Publishers. This is an open access article published under CC BY 4.0 https://creativecommons.org/licenses/by/4.0/legalcode
Loading

Article metrics loading...

/content/journals/eng/10.2174/0118722121322545241015160200
2024-12-09
2025-01-15

  • From This Site

    /content/journals/eng/10.2174/0118722121322545241015160200
    dcterms_title,dcterms_subject,pub_keyword
    -contentType:Contributor -contentType:Concept -contentType:Institution
    10
    5
Loading full text...

Full text loading...

/deliver/fulltext/eng/10.2174/0118722121322545241015160200/BMS-ENG-2024-77.html?itemId=/content/journals/eng/10.2174/0118722121322545241015160200&mimeType=html&fmt=ahah

References

  1. Zhu Daqi Yan Mingzhong Overview of mobile robot path planning technology. Control and Decision 2010 25 07 961 967 10.13195/j.cd.2010.07.4.zhudq.014
    [Google Scholar]
  2. Lin Han Xi Dan Xiang Jian Ouyang A survey of mobile robot path planning algorithms. Comput. Eng. Appl. 2021 57 18 38 48
    [Google Scholar]
  3. Li X. Ma X. Wang X. Survey of mobile robot path planning algorithms. Jisuanji Celiang Yu Kongzhi 2022 30 07 9 19 10.16526/j.cnki.11‑4762/tp.2022.07.002
    [Google Scholar]
  4. Lumelsky V Stepanov P Dynamic path planning for a mobile automaton with limited information on the environment(J]. IEEE Trans. Automat. Contr. 1986 11 1058 1063
    [Google Scholar]
  5. Lumelsky V J Stepanov A A Path-planning strategies for a point mobile automation moving amidst obstacles of arbitrary shape. Algorithmica 1987 2 4 403 430
    [Google Scholar]
  6. Kamon I Rivlin E Sensory-based motion planning with global proofs. IEEE Trans. Robot. Autom. 1997 13 6 814 822
    [Google Scholar]
  7. Kamon I. Rivlin E. Rimon E. A new range-sensor based globally convergent navigation algorithm for mobile robots. Proceedings of IEEE International Conference on Robotics and Automation, Minneapolis, MN, USA, 22-28 April 1996, pp. 429-435.
    [Google Scholar]
  8. Liang K. Zhao C. Guo J. Path planning of mobile robot based on improved BUG algorithm in unknown environment. Xitong Fangzhen Xuebao 2009 21 17 5414 5422
    [Google Scholar]
  9. Xiuying L. Research on Multi-Bug global path planning algorithm. Trans. Chin. Soc. Agric. Mach. 2020 51 6 375 384
    [Google Scholar]
  10. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1959 1 1 269 271 10.1007/BF01386390
    [Google Scholar]
  11. Bobanac V. Bogdan S. Routing and scheduling in Multi-AGV systems based on dynamic banker algorithm. 2008 16th Mediterranean Conference on Control and Automation, Ajaccio, France, 25-27 June 2008, pp. 1168-1173.
    [Google Scholar]
  12. ldwan S. Dijkstra algorithm heuristic approach for large graph. JAppl Sci 2011 12 2255 2259
    [Google Scholar]
  13. Tintor V. Radunović J. Distributed Dijkstra sparse placement routing algorithm for translucent optical networks. Photonic Netw. Commun. 2009 18 1 55 64 10.1007/s11107‑008‑0170‑x
    [Google Scholar]
  14. Lei Zhao Hou Lili An optimized implementation algorithm for dijkstra algorithm. Academic Research 2014
    [Google Scholar]
  15. Tang Hongjie Ding Wang Huang Panling Research on optimizing Dijkstra algorithm for logistics AGV path planning in factories. Mech. Des. Manuf. 2018 S1 117 120 10.19356/j.cnki.1001‑3997.20180626.010
    [Google Scholar]
  16. Khadr M. Beaber S.I. Said E.M. Elmayyah W.M. Hussein W.M. Indoor path-planning for a tracked mobile robot using Dijkstra’s algorithm and Ros”, Proc. SPIE 11758. Unmanned Systems Technology 2021 XXIII 31 10.1117/12.2596461
    [Google Scholar]
  17. Peter E. Hart N.J.N.A. A formal basis for the heuristicdetermination. IEEE Access 1968
    [Google Scholar]
  18. Min H Xiong X Wang P Autonomous driving path planning algorithm based on improved A* algorithm in unstructured environment. Proc. Inst. Mech. Eng., Part D: J. Automobile Eng. 2020 235 1 095440702095974
    [Google Scholar]
  19. Jiao C. Ling X. Jia C. Mobile robot path planning based on improved A* and dynamic window method. Jisuanji Jicheng Zhizao Xitong 2022 1 17
    [Google Scholar]
  20. Chen Z. Xiong G. Liu S. Shen Z. Li Y. Mobile robot path planning based on improved A ~ * algorithm. J. Guangxi Univ. Sci. Technol. 2022 33 1 1 6 10.1109/DTPI55838.2022.9998894
    [Google Scholar]
  21. Zhang X. Zou Y. Collision-free path planning for automated guided vehicles based on improved A * algorithm. Syst. Eng. Theory Pract. 2021 41 1 240 246
    [Google Scholar]
  22. Xiao Z. Zheng W. Huang C. Mobile robot path planning based on improved A* algorithm. Robot 2018 40 06 903 910 10.13973/j.cnki.robot.170591
    [Google Scholar]
  23. Ou O. Complex path planning method of mobile robot based on A-Star algorithm. Patent CN202310668448
  24. Zhao J. A path planning method and path planning controller. Patent CN202311744300
  25. Yong L. A conflict-free and deadlock-free path planning method for multi-load AGV method. Patent CN202310823539
  26. Stentz A. Optimal and efficient path planning for partially-known environments. Proceedings of the 1994 IEEE International Conference on Robotics and Automation, San Diego, CA, USA, 08-13 May 1994, pp. 3310-3317.
    [Google Scholar]
  27. Zhu X. Bing S. Zhu D. Three-dimensional dynamic path planning of AUV based on improved D ~ * algorithm. Control Eng. 2021 28 4 736 743
    [Google Scholar]
  28. Jun L. Shuo F. Ren J. Directed D ~ * algorithm for dynamic path planning of mobile robots. J. Zhejiang Univ. 2020 54 2 291 300
    [Google Scholar]
  29. Zhang X. Xiao B. Improved D ~ * algorithm for mobile robot path planning. Sensors and Microsystems 2018 37 12 52 54
    [Google Scholar]
  30. Wang S. Hu L. Wang Y. Path planning for indoor mobile robots based on improved D ~ * algorithm. Comput. Eng. Des. 2020 41 4 1118 1124
    [Google Scholar]
  31. Wang X. A path planning method, device, equipment and medium for flight area quality. Patent CN202310829515.1
  32. Yang End A multi-objective three-dimensional dynamic path planning method and device. Patent CN202310363577.8
  33. Borenstein J Koren Y The vector field histogram—fast obstacle avoidance for mobile robots. IEEE Trans. Robot. Autom. 1991 7 3 278 288
    [Google Scholar]
  34. Jing Xu Zheng Yuan Liang Yinbo Research on the application of UAV dynamic obstacle avoidance algorithm based on vector field histogram. Comput. Knowl. Technol. 2023 19 12 95 99 10.14004/j.cnki.ckt.2023.0577
    [Google Scholar]
  35. Ulrich I. Borenstein J. VFH+:Reliable obstacleavoidance for fast mobile robots. Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146), Leuven, Belgium, 20-20 May 1998, pp. 1572-1577.
    [Google Scholar]
  36. Ulrich I. Borenstein J. VFH/sup */: Local obstacle avoidance with look-ahead verification. Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), San Francisco, CA, USA, 24-28 April 2000, pp. 2505-2511.
    [Google Scholar]
  37. Zhu S. Motion planning method for robot to avoid obstacles. Patent CN202110550658.X
  38. Fei Z.H.A.N.G. Wei B.A.I. Yaohua Q.I.A.O. UAV indoor path planning based on improved D* algorithm. Zhineng Xitong Xuebao 2019 14 4 662 669
    [Google Scholar]
  39. Ayawli B.B.K. Mei X. Shen M. Appiah A.Y. Kyeremeh F. Mobile robot pathplanning in dynamic environment using voronoi diagram and computation geometry technique. IEEE Access 2019 7 86026 86040 10.1109/ACCESS.2019.2925623
    [Google Scholar]
  40. Hu J Niu H Carrasco J Voronoi-based multi-robot autonomous exploration in unknown environments via deep reinforcement learning. IEEE Trans. Veh. Technol. 2020 69 12 14413 14423
    [Google Scholar]
  41. Li ZHU Fu Xiaowei A multi-UAV cooperative region search algorithm based on the centroid of Voronoi diagram. Unmanned Syst. Technol. 2019 2 39 51
    [Google Scholar]
  42. Lin J. A Voronoi path planning algorithm for new skeleton extraction of mobile robot. Patent CN202010131142.7
  43. DORIGO M Positive feedback as a search strategy. Tech. Rep. 91-016, 1991 Department of Electronics, Politecnico di Milano Italy 1999
    [Google Scholar]
  44. Duan Haibin Wang Daobo Zhu Jiaqiang Advances in the theory and application of ant colony algorithm. Control Decis. 2004 12 1321 1326 10.13195/j.cd.2004.12.1.duanhb.001
    [Google Scholar]
  45. Shi E. Chen M. Jun L. Research on global path planning method of mobile robot based on ant colony algorithm. Mashin/Ha-Yi Kishavarzi 2014 45 06 53 57
    [Google Scholar]
  46. Zhang S. Pu J. An overview of the application of ant colony algorithm in mobile robot path planning. Comput. Eng. Appl. 2020 56 08 10 19
    [Google Scholar]
  47. Dorigo M. Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1997 1 1 53 66 10.1109/4235.585892
    [Google Scholar]
  48. Dorigo M. Di Caro G. Ant colony optimization: A newmeta- heuristic. Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), Washington, DC, USA, 1999, pp. 1470-1477.
    [Google Scholar]
  49. Jiao Z. Ma K. Rong Y. Wang P. Zhang H. Wang S. A path planning method using adaptive polymorphic ant colony algorithm for smart wheelchairs. J. Comput. Sci. 2018 25 50 57 10.1016/j.jocs.2018.02.004
    [Google Scholar]
  50. Mahi M. Baykan Ö.K. Kodaz H. A new hybrid methodbased on particle swarm optimization, ant colony opti-mization and 3-opt algorithms for traveling salesmanproblem. Appl. Soft Comput. 2015 30 484 490 10.1016/j.asoc.2015.01.068
    [Google Scholar]
  51. Saenphon T. Phimoltares S. Lursinsap C. Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem. Eng. Appl. Artif. Intell. 2014 35 324 334 10.1016/j.engappai.2014.06.026
    [Google Scholar]
  52. Wenyong Z. Robot based on multi-objective path planning and intelligent pickup Control method. Patent CN202210458421.3
  53. Dongdong L. A multi-robot path planning method based on K-Means ant colony algorithm. Patent CN202211120826.2
  54. BREMERMANN H J The evolution of intelligence: Thenervous system as a model of its environment. University of Washington, Department of Mathematics 1958
    [Google Scholar]
  55. Tu J. Yang S. Genetic algorithm based path planning for a mobilerobot. 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), Taipei, Taiwan, 14-19 September 2003, pp. 1221-1226.
    [Google Scholar]
  56. Li X. Liu Y. Wang Q. Application of adaptive genetic algorithm in robot path planning. Comput. Eng. Appl. 2020 56 18 36 41
    [Google Scholar]
  57. Li S. Song Q. Li Zhiang and so on. Review of genetic algorithms in robot path planning. Kexue Jishu Yu Gongcheng 2020 20 02 423 431
    [Google Scholar]
  58. Hao Wang Zhao Xuejun Yuan Xiujiu Robot path planning based on improved adaptive genetic algorithm. Electro-optics Control 2022 1 7
    [Google Scholar]
  59. Nazarahari M. Khanmirza E. Doostie S. Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm. Expert Syst. Appl. 2019 115 106 120 10.1016/j.eswa.2018.08.008
    [Google Scholar]
  60. Qu H. Xing K. Alexander T. QU H An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots. Neurocomputing 2013 120 509 517 10.1016/j.neucom.2013.04.020
    [Google Scholar]
  61. Lei W. Ming L. Research on the application of improved genetic algorithm in mobile robot path planning. Mach. Sci. Technol. 2017 36 05 711 716 10.13433/j.cnki.1003‑8728.2017.0509
    [Google Scholar]
  62. Meng H. A ship path planning method and device. Patent CN202211526824. 3 2017
  63. China Telecom Co Dongxu X. Path planning method, device, storage medium and electronic equipment. Patent CN202210918666.X. 2022
  64. EBERHART R. A new optimizer using particle swarm theory. MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 04-06 October 1995, pp. 39-43.
    [Google Scholar]
  65. Angeline P.J. Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences. Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 10 December 2005, pp 601–610.
    [Google Scholar]
  66. Ao Y. Shi Y. Wei Z. Improved particle swarm optimization algorithm with adaptive inertia weight. J. Univ. Electron. Sci. Technol. China. 2014 43 6 874 880
    [Google Scholar]
  67. Clerc M. Kennedy J. The particle swarm-explosion,stability,and convergence in a multidimensionalcomplex space[J].IEEE TransactionsonEvolutionary. Computation 2002 6 1 58 73
    [Google Scholar]
  68. Zhang W. Zhang X. Ying L. Intelligent robot pathplanning based on improved particle sw arm optimization algorithm. Comput. Appl. 2014 34 2 510 513
    [Google Scholar]
  69. Jia H. Wei Z. Xin H. Path planning based on improved particle swarm optimization. Mashin/Ha-Yi Kishavarzi 2018 49 12 371 377
    [Google Scholar]
  70. Ding Chengjun Xin Wang AGV path planning based on particle swarm optimization algorithm. Sens. Microsyst. 2020 39 08 123 126
    [Google Scholar]
  71. Chen Q. Zheng Y. Jiang H. Dynamic path planning based on neural network improved particle swarm optimization. J. Huazhong Univ. Sci. Technol. 2021 49 02 51 55 10.13245/j.hust.210207
    [Google Scholar]
  72. Hongli G. Cutting path optimization method based on improved adaptive hybrid annealing particle swarm-dynamic programming. Patent CN202210340048.1
  73. Qingni Y. A dynamic path planning method based on improved particle swarm optimization algorithm. Patent N202210058540.X
  74. Yiguang G. A vehicle path planning method based on hybrid grey wolf particle swarm optimization algorithm. Patent CN202310149985.3
  75. Kavraki L.E. Svestka P. Latombe J.C. Overmars M.H. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 1996 12 4 566 580 10.1109/70.508439
    [Google Scholar]
  76. ELBANHAWI M SAMPLING-based robot motionplanning: A review. IEEE Access 2014 2 56477
    [Google Scholar]
  77. Zou Shanxi Wang Pin Han Xu Improved path planning algorithm based on PRM. Comb. Mach. Tool Autom. Mach. Technol. 2019 01 1 3
    [Google Scholar]
  78. Ravankar A.A. Ravankar A. Emaru T. Kobayashi Y. HPPRM: hybrid potential based probabilistic roadmapalgorithm for improved dynamic path planning of mobilerobots. IEEE Access 2020 8 221743 221766 10.1109/ACCESS.2020.3043333
    [Google Scholar]
  79. Yang Liu Zhang Weiguo Li Guangwen Research on path planning based on improved PRM algorithm. Res. Comput. Appl. 2012 29 1 104 106
    [Google Scholar]
  80. Min Li Yuan Zhou Lu Huang PRM path planning algorithm based on distance transform. Inf. Technol. Network Secur. 2018 37 03 74 79 10.19358/j.issn.2096‑5133.2018.03.018
    [Google Scholar]
  81. Qian Cheng Song Gao Kai Cao Mobile robot path planning based on PRM optimization algorithm. Comput. Appl. Softw. 2020 37 12 254 259
    [Google Scholar]
  82. Jinhan X. A method and system for path planning and trajectory control of property indoor robot. Patent CN202311002069.3
  83. Liang Q. An unmanned driving path planning based on improved PRM algorithm methods. Patent CN202311363688.5 2023
  84. Pengfei Z. A global path planning method. Patent CN202210076985.0
  85. Yang A. A method of roadless area path planning algorithm for DEM. Patent CN202110302692.5
  86. Mohanta J.C. Keshari A. A knowledge based fuzzy-probabilistic roadmap method for mobile robot navigation. Appl. Soft Comput. 2019 79 391 409 10.1016/j.asoc.2019.03.055
    [Google Scholar]
  87. LaValle S M Rapidly-exploring random trees: A new tool forpath planning. Research Report 9811. 1998
    [Google Scholar]
  88. Chen Q. Jiang H. Zheng Y. A survey of rapidly expanded random tree algorithms for robot path planning. Computer Engineering and Applications 2019 55 16 10 17
    [Google Scholar]
  89. Karaman S. Frazzoli E. Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 2011 30 7 846 894 10.1177/0278364911406761
    [Google Scholar]
  90. Nasir J Islam F Malik U l.RRT*-smart: A rapidconvergence implementation of RRT*. Int. J. Adv. Robot. Syst. 2013 10 4
    [Google Scholar]
  91. Liu C. Han J. Dynamic path planning of RoboCup robot based on improved RRT algorithm. Robot 2017 39 1 8 15
    [Google Scholar]
  92. Hongjie Y. Methods, devices, electronic devices and storage media of bidirectional RRT path planning. Patent CN202310249471. 5
  93. Qureshi A.H. Ayaz Y. Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Robot. Auton. Syst. 2015 68 1 11 10.1016/j.robot.2015.02.007
    [Google Scholar]
  94. Burget F. Bennewitz M. Burgard W. BI2RRT*: An efficient sampling-based path planning framework for task-constrained mobile manipulation. 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Daejeon, Korea (South), 09-14 October 2016, pp. 3714-3721.
    [Google Scholar]
  95. Lihong J.I.A. Research on 'Two-Way Search Path Based on CPS. Huainan: College of Computer Science and Engineering，Anhui University of Science & Technology 2017
    [Google Scholar]
  96. Perez-Higueras N. Caballero F. Merino L. Learning human-aware path planning with fully convolutional networks. 2018 IEEE International Conference on Robotics and Automation (ICRA), Brisbane, QLD, Australia, 21-25 May 2018, pp. 5897-5902.
    [Google Scholar]
  97. Ichter B. Harrison J. Pavone M. Learning sampling distributions for robot motion planning. 2018 IEEE Interna-tional Conference on Robotics and Automation, 2018, pp. 7087-7094.
    [Google Scholar]
  98. Jie Meng A robot trajectory planning method and device considering the uncertainty of pose estimation. Patent CN202310112220.2
  99. WATKINS C J C H Learning from delayed rewards. Robot. Auton. Syst. 1989 15 4 233 235
    [Google Scholar]
  100. Wang Dingxin Health anxiety in women with early-stage breast cancer: What is the relationship to social support? Can. J. Behav. Sci. 2012 44 2 108 116 10.14022/j.issn1674‑6236.2021.04.002
    [Google Scholar]
  101. LIU ZR Review of mobile robot path planning basedon reinforcement learning L. Manufacturing Automation 2019 41 3 90 92
    [Google Scholar]
  102. KLIDBARY S H Path planning of modular robots on various terrainsusing Q-Learning versus optimization algorithms. Intell. Serv. Robot. 2017 10 2 121 136 10.1007/s11370‑017‑0217‑x
    [Google Scholar]
  103. FRAMLING K Guiding exploration by pre-existing knowledge without modifying reward. Neural Netw. 2007 20 6 736747
    [Google Scholar]
  104. LILLICRAP T P Continu-ous control with deep reinforcement learning L. Comput. Sci. 2015 8 6 1 14
    [Google Scholar]
  105. Duan Jianmin Chen Qianglong Research on Q-learning path planning algorithm using prior knowledge. Electro-optics and Control 2019 26 09 29 33
    [Google Scholar]
  106. Low E.S. Ong P. Cheah K.C. Solving the optimal path planning of a mobile robot using improved Q-learning. Robot. Auton. Syst. 2019 115 143 161 10.1016/j.robot.2019.02.013
    [Google Scholar]
  107. Mao K. Gu S. Improved Q-Learning algorithm and its application in path planning. J. Taiyuan Univ. Technol. 2021 52 01 91 97 10.16355/j.cnki.issn1007‑9432tyut.2021.01.012
    [Google Scholar]
  108. Bae H. Kim G. Kim J. Qian D. Lee S. Multi-robot path planningmethod using reinforcement learning. Appl. Sci. 2019 9 15 3057 10.3390/app9153057
    [Google Scholar]
  109. A key node identification method based on path planning task. Patent CN202310848313.1 2023
  110. Robot complex temporal logic tasks based on reinforcement learning path planning method. Patent CN202210028141.9.
  111. Zhang R. Wu C. Sun T. Deep reinforcement learning and its research progress in path planning. Computer Engineering and Application 2021 57 19 44 56
    [Google Scholar]
  112. MNIH V Playingatari with deep reinforcement learning arXiv:1312.5602, 2013
    [Google Scholar]
  113. Hessel M Rainbow: Combining improvements in deep reinforcement learning. arXiv: 1710.02298, 2017
    [Google Scholar]
  114. SCHULMAN J Trust regionpoliey optimization. arXiv:1502.05477 2015
    [Google Scholar]
  115. Mnih V Asynchronousmethods for deep reinforcement learning. Proceedingsof the 33rd International Conference on International Conference on Machine Learning, 2016, pp. 1928-1937.
    [Google Scholar]
  116. Liu Junlan Zhang Wenbo Ji Hongbing Research summary of UAV swarm path planning algorithm. Aerospace Electronic Countermeasures 2022 38 01 9 12 10.16328/j.htdz8511.2022.01.004
    [Google Scholar]
  117. KULKARNI T D. Hierarchical deep reinforcement learning : Integratingtemporal abstraction and intrinsic motivation. 30th Conference on Neural Information Processing Systems (NIPS 2016), Barcelona, Spain, 2016, pp. 3675-3683.
    [Google Scholar]
  118. Zhu Y. Mottaghi R. Kolve E. Target-driven visualnavigation in indoor scenes using deep reinforcement learning. 2017 IEEE International Conference onRobotics and Automation (ICRA), Singapore, 29 May 2017 - 03 June 2017, pp. 3357-3364.
    [Google Scholar]
  119. Ke W. Bu X. Li R. Deep reinforcement learning robot path planning under depth-of-field constraints. J. Huazhong Univ. Sci. Technol. 2018 46 12 77 82 10.13245/j.hust.181214
    [Google Scholar]
  120. Gao J. Ye W. Guo J. Li Z. Deep reinforcement learmning for indoor mobile robot path planning. Sensors 2020 20 19 5493 10.3390/s20195493 32992750
    [Google Scholar]
  121. FOERSTER J. Counter factual multi-agent policy gradients. arXiv:1705.08926, 2017
    [Google Scholar]
  122. Qiming Z. Path planning method, device, system and storage medium of endoscope. Patent CN202310732429.9
  123. Xuan S. A multi-agent path planning method and terminal. Patent CN202310452118.7
  124. Khatib O. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res. 1986 5 1 90 98 10.1177/027836498600500106
    [Google Scholar]
  125. Qiang L. Wang H. Cui X. Improved artificial potential field method for autonomous mobile robot path planning. Control Eng. 2019 26 06 1091 1098 10.14107/j.cnki.kzgc.170907
    [Google Scholar]
  126. Azzabi A Nouri K An advanced potential field method proposed for mobile robot path planning. Trans. Inst. Meas. Control 2019 41 4
    [Google Scholar]
  127. Yu Z. Yan J. Zhao Jie and so on. Mobile robot path planning based on improved artificial potential field method. J. Harbin Inst. Technol. 2011 43 01 50 55
    [Google Scholar]
  128. Yang X. Yang W. Zhang H. A new method for robotpath planning based artificial potential field. 2016 IEEE 11th Conference on Industrial Electronics and Applications (ICIEA), Hefei, China, 05-07 June 2016, pp. 1294-1299.
    [Google Scholar]
  129. Geva Y. Shapiro A. A combined potential function andgraph search approach for free gait generation of quad-ruped robots. 2012 IEEE International Conference on Robotics and Automation, Saint Paul, MN, USA, 14-18 May 2012, pp. 5371-5376.
    [Google Scholar]
  130. Shan C. Wang P. Zong X. Research on dynamic obstacle avoidance based on improved artificial potential field method. Electronic World 2017 22 17 19
    [Google Scholar]
  131. Carlucho I. De Paula M. Wang S. Petillot Y. Acosta G.G. Adaptive low-level control of autonomous underwater vehicles using deep reinforcement learning. Robot. Auton. Syst. 2018 107 71 86 10.1016/j.robot.2018.05.016
    [Google Scholar]
  132. Liang X. X. Liu C. Y. Song X. L. Research on improved artificial potential field approach in local path planning for mobile robot. Computer Simulation 2018 35 4 291 294
    [Google Scholar]
  133. Duan Jianmin Chen Qianglong Research on path planning algorithm based on improved artificial potential field-genetic algorithm. Foreign Electron. Meas. Technol. 2019 38 3 19 24
    [Google Scholar]
  134. Yuhua C. The artificial potential field path planning method of mixed gradient descent and beetle whisker search. Patent CN202310043230.5
  135. Abdalla T.Y. Abed A.A. Ahmed A.A. Mobile robot navigation using PSO-optimized fuzzy artificial potential field with fuzzy control. J. Intell. Fuzzy Syst. 2017 32 6 3893 3908 10.3233/IFS‑162205
    [Google Scholar]
  136. Kangjun L. Ship anti-collision method and system based on laser point cloud and video image fusion perception. Patent CN202311810960.X
  137. Fox D. Burgard W. Thrun S. The dynamic window approach to collision avoidance. IEEE Robot. Autom. Mag. 1997 4 1 23 33 10.1109/100.580977
    [Google Scholar]
  138. Zhang X. Research on port AGV path planning method combining dynamic window method and A* algorithm. Beijing Jiaotong University 2019
    [Google Scholar]
  139. Wang H. Yin P. Wei Z. Mobile robot path planning based on improved A ~ * algorithm and dynamic window method. Robot 2020 42 03 346 353 10.13973/j.cnki.robot.190305
    [Google Scholar]
  140. Wuyi Ou Mingmin Duan Liwei Research on robot path planning based on improved A* algorithm and dynamic window method. Ind. Control Comput. 2020 33 10 4
    [Google Scholar]
  141. Li X. Y. Liu F. Liu J. Obstacle avoidance for mobilerobot based on improved dynamic window approach. Turk. J. Electr. Eng. Comput. Sci. 2017 25 2 666 676
    [Google Scholar]
  142. Molinos E. J. Llamazares A. Ocaña M. Dynamic window based approaches for avoiding obstacles in moving. Robot. Auton. Syst. 2019 118 1 112 130
    [Google Scholar]
  143. Missura M. Bennewitz M. Predictive collision avoidance for the dynamic window approach. Proceedings of the 2019 International Conference on Robotics and Automation, Montreal, QC, Canada, 20-24 May 2019, pp. 8620-8626.
    [Google Scholar]
  144. Chang L. Shan L. Jiang C. Reinforcement basedmobile robot path planning with improved dynamic window approach in unknown environment. Auton. Robots 2020 45 51 76
    [Google Scholar]
  145. Roesmann C. Feiten W. Woesch T. Trajectory modification considering dynamic constraints of autonomous robots. ROBOTIK 2012; 7th German Conference on Robotics, Munich, Germany, 21-22 May 2012, pp. 1-6.
    [Google Scholar]
  146. Quinlan S. Khatib O. Elastic bands: Connecting path planning and control. Proceedings of the IEEE International Conference on Robotics and Automation, Atlanta, 1993, pp. 802-807.
    [Google Scholar]
  147. Yonggang L. The road path planning method of intelligent automobile park. Patent CN202211145226.1 2022
  148. Rosmann C. Efficient trajectory optimization using asparse model. 2013 European Conference on Mobile Robots, Barcelona, Spain, 25-27 September 2013, pp. 138-143.
    [Google Scholar]
  149. Magyar B. Tsiogkas N. Deray J. Pfeiffer S. Lane D. Timed-elastic bands for manipulation motion planning. IEEE Robot. Autom. Lett. 2019 4 4 3513 3520 10.1109/LRA.2019.2927956
    [Google Scholar]
  150. Chen Yimei Shen Jianfeng Li Bingqi Research on multi-robot dynamic obstacle avoidance strategy based on improved TEB algorithm. Electro-optics and Control 2022 2022 029-005
    [Google Scholar]
  151. Zheng Kailin Han Baoling Wang Xinda Ackerman robot motion planning system based on improved TEB algorithm. Sci. Technol. Eng. 2020 20 10 7
    [Google Scholar]
  152. Yu Wen Huang Jiangshuai Safe and smooth improved time elastic band trajectory planning algorithm. Control and Decision 2022 37 08 2008 10.13195/j.kzyjc.2021.0068
    [Google Scholar]
  153. Xie C. Liu F. Research on dynamic obstacle avoidance trajectory planning system with improved time elastic zone. Chongqing Jiaotong Daxue Xuebao. Shehui Kexue Ban 2023 42 03 143 150
    [Google Scholar]
  154. Lie G. Qi G. Zhao Y. Research on robot multi-task navigation scheduling based on A ~ * and TEB algorithms. J. Huazhong Univ. Sci. Technol. 2023 51 02 82 88 10.13245/j.hust.230206
    [Google Scholar]
  155. Shen S. Xin T. Yuan Q. A mobile robot path planning algorithm based on improved A ~ * and time elastic band. Intell. Comput. Appl. 2022 12 11 96 102
    [Google Scholar]
  156. Pengfei C. Planning method, device and electronic equipment of intersection trajectory Patent CN202210014675.6
  157. Lingyan R. An intelligent wheelchair autonomous navigation method. Patent CN202210828562.X
/content/journals/eng/10.2174/0118722121322545241015160200
Loading
A Review of Research on Shortest Path Planning Algorithms for Mobile Robots
Bentham Science Publishers ; https://doi.org/10.2174/0118722121322545241015160200
/content/journals/eng/10.2174/0118722121322545241015160200
/content/journals/eng/10.2174/0118722121322545241015160200
Loading

Data & Media loading...


  • Article Type:     Review Article
Keywords: algorithm classification and summarization ; local planning ; Path planning ; mobile robots ; global planning

Most Cited Most Cited RSS feed

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test