In the process of path planning of unmanned vehicles in complex environments, the traditional RRT* algorithm (Rapidly-Exploring Random Tree, RRT) has problems such as blind search, slow convergence, so on. To address this issue, this paper proposed a kind of fusion RRT*-APF algorithm (Artificial Potential Field, APF). It incorporates the attractive force from the goal and the repulsive force from obstacles into the node expansion, which guides node to rapidly expand toward the target point. Moreover, the Analytic Hierarchy Process (AHP) is adopted to determine the most appropriate factors influencing node expansion, as well as the coefficients affecting the attractive force and the repulsive force. By combining relevant performance metrics to establish an evaluation function, the algorithm with the highest score is selected for path planning based on various scenarios and maps. Ultimately, a robot experiment platform is built to evaluate the feasibility and stability of the improved algorithm by applying it to a real mobile robot scenario. Results demonstrate that the improved RRT*-APF algorithm, compared to the RRT algorithm, and the enhanced RRT-APF algorithm, produces smoother paths with reduced length and faster search speeds during the exploration process.
FinnASchedingS.Developments and challenges for autonomous unmanned vehicles. Intell Syst Ref Lib2010; 3: 128–154.
2.
KorobeevAChuchaevA.Unmanned vehicles: new challenges to public security. Lex Russica2019; 2(147): 9–28.
3.
BissellDBirtchnellTElliottA, et al. Autonomous automobilities: the social impacts of driverless vehicles. Curr Sociol2020; 68(1): 116–134.
4.
FethiDNemraALouadjK, et al. Simultaneous localization, mapping, and path planning for unmanned vehicle using optimal control. Adv Mech Eng2018; 10(1): 1687814017736653.
5.
DingYZhuangWWangL, et al. Safe and optimal lane-change path planning for automated driving. Proc Inst Mech Eng Part D: J Automobile Eng2020; 235(4): 1070–1083.
6.
GanYZhangBKeC, et al. Research on robot motion planning based on RRT algorithm with nonholonomic constraints. Neural Process Lett2021; 53(4): 3011–3029.
7.
WangJLiBMengMQH. Kinematic constrained bi-directional RRT with efficient branch pruning for robot path planning. Expert Syst Appl2021; 170: 114541.
8.
YiDGoodrichMASeppiKD, et al. Homotopy-aware RRT*: toward human-robot topological path-planning. In: 2016 11th ACM/IEEE international conference on human-robot interaction (HRI), Christchurch, New Zealand, 7–10 March 2016, pp. 279–286. New York, NY: IEEE.
9.
ChenYHuCQinY, et al. Path planning and robust fuzzy output-feedback control for unmanned ground vehicles with obstacle avoidance. Proc Inst Mech Eng Part D: J Automobile Eng2020; 235(4): 933–944.
10.
HartPENilssonNJRaphaelB.A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cyber1968; 4(2): 100–107.
MinHXiongXWangP, et al. Autonomous driving path planning algorithm based on improved A* algorithm in unstructured environment. Proc Inst Mech Eng Part D: J Automobile Eng2020; 235(2–3): 513–526.
13.
ChenZWangHChenK, et al. Improved coverage path planning for indoor robots based on BIM and robotic configurations. Autom Constr2024; 158: 105160.
14.
MachavaramR.Intelligent path planning for autonomous ground vehicles in dynamic environments utilizing adaptive Neuro-Fuzzy control. Eng Appl Artif Intell2025; 144: 110–119.
15.
WangNLiXZhangK, et al. A survey on path planning for autonomous ground vehicles in unstructured environments. Machines2024; 12(1): 31.
16.
LaValleS.Rapidly-exploring random trees: a new tool for path planning. Res Rep1998; 14: 98–11.
17.
LaValleSMKuffnerJJ.Randomized kinodynamic planning. Int J Robot Res2001; 20(5): 378–400.
18.
LinYZhangL.An improved Quick Informed-RRT* algorithm based on hybrid bidirectional search and adaptive adjustment strategies. Int Serv Robot2024; 17(4): 847–870.
19.
NasirJIslamFMalikU, et al. RRT*-SMART: a rapid convergence implementation of RRT. Int J Adv Robot Syst2013; 10(7): 299.
20.
GammellJDBarfootTDSrinivasaSS.Batch informed trees (bit*): informed asymptotically optimal anytime search. Int J Robot Res2020; 39(5): 543–567.
21.
ZhaoPChangYWuW, et al. Dynamic RRT: fast feasible path planning in randomly distributed obstacle environments. J Intell Robot Syst2023; 107(4): 48.
22.
OtteMFrazzoliE.RRTX: asymptotically optimal single-query sampling-based motion planning with quick replanning. Int J Robot Res2016; 35(7): 797–822.
23.
LiuZLiMZhangR, et al. Preoperative path planning of craniotomy surgical robot based on improved MDP-LQR-RRT* algorithm. Biomed Signal Process Control2025; 105: 107647.
24.
XuJTianZHeW, et al. A fast path planning algorithm fusing PRM and P-BI-RRT. In: 2020 11th International conference on prognostics and system health management, Jinan, China, 23–25 October 2020, pp. 503–508. New York, NY: IEEE.
25.
FanJChenXLiangX.UAV trajectory planning based on bi-directional APF-RRT* algorithm with goal-biased. Expert Syst Appl2023; 213: 119137.
26.
KhatibO.The potential field approach and operational space formulation in robot control. In: NarendraKS (ed.) Adaptive and learning systems: theory and applications. Boston, MA: Springer US, 1986, pp. 367–377.
27.
TangZChenBLanR, et al. Vector field guided RRT* based on motion primitives for quadrotor kinodynamic planning. J Intell Robot Syst2020; 100(3): 1325–1339.
28.
AzzabiANouriK.An advanced potential field method proposed for mobile robot path planning. Trans Inst Meas Control2019; 41(11): 3132–3144.
29.
LinZYueMChenG, et al. Path planning of mobile robot with PSO-based APF and fuzzy-based DWA subject to moving obstacles. Trans Inst Meas Contr2022; 44(1): 121–132.
30.
LuanTTanZYouB, et al. Path planning of unmanned surface vehicle based on artificial potential field approach considering virtual target points. Trans Inst Meas Contr2023; 46(6): 01423312231190208.
31.
LiRKangMSWangG. Evaluation of statistic probability distribution functions: II. chi-squared probability function and the inverse functions of z, t, F, and chi-squared distributions. In: 2016 International conference on computational science and computational intelligence (CSCI), Las Vegas, NV, USA, 15–17 December 2016, pp. 1253–1260. New York, NY: IEEE.
32.
SoltaniARTawfikHGoulermasJY, et al. Path planning in construction sites: performance evaluation of the Dijkstra, A∗, and GA search algorithms. Adv Eng Inform2002; 16(4): 291–303.
33.
ZhangHLiSDingM, et al. Research on linear evaluation function based on LMS algorithm. In: 2017 29th Chinese control and decision conference (CCDC), Chonqing, China, 28–30 May 2017, pp. 7632–7634. New York, NY: IEEE.
34.
WangQLiuQZhangX, et al. The study of subjective evaluation method of ADAS function based on driver simulator. In: 2021 International conference on machine learning and intelligent systems engineering (MLISE), Chongqing, China, 9–11 July 2021, pp. 494–498. New York, NY: IEEE.
