Gong Yuehong, Zhang Shaojun, Luo Min, Ma Sainan
School of Navigation and Shipping, Shandong Jiaotong University, Weihai, China.
School of Information Science and Engineering, Harbin Institute of Technology at Weihai, Weihai, China.
Front Neurorobot. 2022 Dec 6;16:1076455. doi: 10.3389/fnbot.2022.1076455. eCollection 2022.
To keep the global search capability and robustness for unmanned surface vessel (USV) path planning, an improved differential evolution particle swarm optimization algorithm (DePSO) is proposed in this paper. In the optimization process, approach to optimal value in particle swarm optimization algorithm (PSO) and mutation, hybridization, selection operation in differential evolution algorithm (DE) are combined, and the mutation factor is self-adjusted. First, the particle population is initialized and the optimization objective is determined, the individual and global optimal values are updated. Then differential variation is conducted to produces new variables and cross over with the current individual, the scaling factor is adjusted adaptively with the number of iterations in the mutation process, particle population is updated according to the hybridization results. Finally, the convergence of the algorithm is determined according to the decision standard. Numerical simulation results show that, compared with conventional PSO and DE, the proposed algorithm can effectively reduce the path intersection points, and thus greatly shorten the overall path length.
为保持无人水面舰艇(USV)路径规划的全局搜索能力和鲁棒性,本文提出了一种改进的差分进化粒子群优化算法(DePSO)。在优化过程中,将粒子群优化算法(PSO)中趋近最优值的方式与差分进化算法(DE)中的变异、杂交、选择操作相结合,并对变异因子进行自适应调整。首先,初始化粒子种群并确定优化目标,更新个体最优值和全局最优值。然后进行差分变异以产生新变量并与当前个体进行杂交,在变异过程中根据迭代次数自适应调整缩放因子,根据杂交结果更新粒子种群。最后,根据决策标准判断算法的收敛性。数值模拟结果表明,与传统的PSO和DE相比,该算法能有效减少路径交叉点,从而大大缩短整体路径长度。