Heuristic robot dynamic path planning based on SPG hybrid algorithm

被引：0
|
作者：
Wu Q. [1 ]
Yuan J. [1 ]
Ma S. [1 ]
Guo Z. [1 ]
机构：
[1] School of Electrical Engineering, Xinjiang University, Urumqi
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2023年 / 29卷 / 10期
关键词：
dynamic environment; hybrid path planning algorithm; robots; safe-point guide;
D O I：
10.13196/j.cims.2023.10.006
中图分类号：
学科分类号：
摘要：
To solve the problem on global optimization and real-time obstacle avoidance for a mobile robot's path planning in complex environment, the Safe-point Guide (SPG) hybrid algorithm with heuristic dynamic path planning was proposed by combining the improved A algorithm with the artificial potential field. The end-point approximation strategy was designed to solve the problem of too many redundant turning points in the traditional A" algorithm. The plane vector product method was adopted to avoid the path oscillation of the conventional artificial potential field. A heuristic strategy guided by safe points was designed for combining the two improved algorithms to ensure a safe path and escape from the local minimum point. The SPG hybrid algorithm was simulated in the static and dynamic environments. Compared with the traditional hybrid algorithms in the static environment, the path length and running time were shortened by 10% and 25.6% respectively. In the dynamic environment, the path length and running time were shortened by 9.5% and 30.9% respectively. The results showed that the SPG hybrid algorithm had good global path-planning and dynamic obstacle-avoidance abilities. The effectiveness of the proposed algorithm was verified in real scenes. © 2023 CIMS. All rights reserved.
引用
收藏
页码：3284 / 3295
页数：11
相关论文
共 25 条
  • [1] ZHU Daqi, YAN Mingzhong, Survey on technology of mobile robot path planning [J], Control and Decision, 25, 7, pp. 961-967, (2010)
  • [2] YU L, WEI Z, WANG H, Et al., Path planning for mobile robot based on fast convergence ant colony algorithm, Proceed-ings of IEEE International Conference on Mecbatronics and Automation, pp. 1493-1497, (2017)
  • [3] DUDEJA C, KUMAR P., An improved weighted sum-fuzzy Di-jkstra7s algorithm for shortest path problem CIWSFDA)[J], Soft Computing, 26, 7, pp. 3217-3226, (2022)
  • [4] AKKA K, KHABER F., Mobile robot path planning using an improved ant colony optimization, International Journal of Advanced Robotic Systems, 15, 3, (2018)
  • [5] Xin LI, LIAO Kaiwen, CHEN Wei, Et al., Space-time confict-constrained A* algorithim for path planning of multiple AGVS [J], Computer Integrated Manufacturing Systems, 27, 11, pp. 3219-3226, (2021)
  • [6] CHEN Jiabao, WEN Jiayan, XIE Guangming, Path planning of mobile robot based on improved A* algorithm[J], Journal of Guangxi University of Science and Technology, 33, 1, pp. 78-84, (2022)
  • [7] SONG Jinze, DAI Bin, SHAN Enzhong, Et al., An improved RRT path planning algorithm [ J ], Acta Electronica Sinica, 38, pp. 225-228, (2010)
  • [8] WU Qu, ZHANG Yi, GUO Kun, Et al., LSTM combined with reinforcement learning dynamic environment path planning algorithm, Journal of Chinese Computer Systems, 42, 2, pp. 334-339, (2021)
  • [9] Jiao CHEN, XU Ling, CHEN Jia, Et al., Path planning based on improved A* and dynamic window approach for mobile robot [J], Computer Integrated Manufacturing Systems, 28, 6, pp. 1650-1658, (2022)
  • [10] PANDEY A, KUMAR S, PANDEY K K, Et al., Mobilerobot navigation in unknown static environments using ANFIS con-troller[J], Perspectives in Science, 8, pp. 421-423, (2016)
123