Open AccessA real-time dynamic path planning method combining artificial potential field method and biased target RRT algorithm
Author(s) -
Xi Yingqi,
Wei Shen,
Zhang Wen,
Liu Jingqiao,
Qinhui Liu,
Songjun Han
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1905/1/012015
Subject(s) - motion planning , random tree , computer science , algorithm , potential field , mobile robot , path (computing) , process (computing) , mathematical optimization , robot , artificial intelligence , mathematics , geophysics , programming language , geology , operating system
In order to improve the efficiency and effectiveness of path planning for mobile robots in dynamic environment, based on the comprehensive analysis of multiple path planning algorithms, an improved algorithm based on fast-spreading random tree algorithm is proposed. The proposed algorithm effectively combines the artificial potential field(APF) method with the biased target RRT algorithm, and judges the local minimum point in the process of solving the APF method to complete the switching with the biased target RRT algorithm. The motion environment simulation model is established in the Python environment, and the path planning simulation case of the mobile robot in the dynamic environment is completed. The simulation results show that the combined algorithm can avoid the phenomenon that the APF method falls into the local minimum point while taking the global and real-time performance into account, reduce the planning time of the biased target RRT algorithm, and improve the quality of path generation.