id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
fcis-31242	Wang, Guogang; Sun, Hongwei; Xie, Shouliang; Chen, Xu; Feng, Zichao	Multi-Strategy Improved Petal Kingfisher Algorithm for Robot Path Planning	2025	7	.pdf	application/pdf	3738	161	47	Analysis of Experimental Results From Figure 1, it can be seen that the improved algorithm in this paper in the single-peak function, multi-peak function and composite function under the convergence speed and are faster than other algorithms, in the single-peak function test, IPKO algorithm convergence speed is faster than the other optimization algorithms, can be in the early iteration to quickly find the location of the optimal solution, in the multi- peak function test, the IPKO algorithm has a stronger convergence accuracy and the ability to jump out of the local optimal solution, composite function In the multi-peak function test, IPKO algorithm has stronger convergence accuracy and ability to jump out of the local optimal solution, and the convergence curve of IPKO algorithm is significantly higher than PKO algorithm in the middle and late stages of the test, which indicates that IPKO algorithm is better than other optimization algorithms in terms of convergence speed, convergence accuracy, and optimization searching ability, and it is more suitable for the ability of complex optimization problems and better robustness. At the same time calculated the number of turns in the path planning algorithm, path length and convergence time as the key indicators of the 67 performance of each algorithm, these indicators not only take into account the speed of the algorithm to reach the optimal position, but also measures the degree of optimization of the algorithm and the practicality of the planning, in order to ensure that the algorithm in the path planning of the fairness, the maximum number of iterations are set to 500, the number of populations are 30.	cache/fcis-31242.pdf	txt/fcis-31242.txt