References
- Hwang YK, Ahuja N. A potential field approach to path planning. IEEE Trans Robot Autom. 1992;8(1):23–32.
- Fox D, Burgard W, Thrun S. The dynamic window approach to collision avoidance. IEEE Robot Autom Mag. 2002;4(1):23–33.
- Zadeh LA. Fuzzy algorithms. Inf Control. 1968;12(2):94–102.
- Dijkstra EW. A note on two problems in connexion with graphs. Numer Math. 1959;1:259–271.
- Hart PE, Nilsson NJ, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern. 1968;4(2):100–107.
- Kavraki LE, Svestka P, Latombe JC, et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Robot Autom. 1996;12(4):566–580.
- Lavalle SM. Rapidly-exploring random trees: a new tool for path planning. Ames: Iowa State University; 1998.
- Kennedy J, Eberhart R. Particle swarm optimization. Proceedings of ICNN'95 – International Conference on Neural Networks; 1995 Nov 27–30; Perth, Australia. p. 1942–1948.
- Mirjalili S, Mirjalili SM, Lewis A. Grey wolf optimizer. Adv Eng Softw. 2014;69:46–61.
- Dorigo M, Gambardella LM. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput. 1997;1(1):53–66.
- Kuffner JJ, LaValle SM. RRT-connect: an efficient approach to single-query path planning. Proceedings of IEEE International Conference on Robotics and Automation. 2000 Apr 24–28; San Francisco, USA. p. 1–7.
- Perez AT, Karaman S, Shkolnik AC, et al. Asymptotically-optimal path planning for manipulation using incremental sampling-based algorithms. IEEE/RSJ International Conference on Intelligent Robots & Systems. 2011 Sep 25-30; San Francisco, USA; p. 4307–4313.
- Jeong IB, Lee SJ, Kim JH. Quick-RRT*: triangular inequality-based implementation of RRT* with improved initial solution and convergence rate. Expert Syst Appl. 2019;123:82–90.
- Qureshi AH, Ayaz Y. Potential functions based sampling heuristic for optimal path planning. Auton Robot. 2015;40(6):1079–1093.
- Li Y, Wei W, Gao Y, et al. PQ-RRT*: an improved path planning algorithm for mobile robots. Expert Syst Appl. 2020;152:113425–113436.
- Liao B, Wan F, Hua Y, et al. F-RRT*: an improved path planning algorithm with improved initial solution and convergence rate. Expert Syst Appl. 2021;184:115457–115473.
- Gammell JD, Srinivasa SS, Barfoot TD, et al. Informed RRT*: optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. IEEE RSJ International Conference on Intelligent Robots and Systems. 2014 Sep 14–18; Chicago, USA; p. 2997–3004.