竞争粒子群算法及其在UUV航迹规划中的应用

Competition Particle Swarm Optimization and Its Application in UUV Path Planning

  • 摘要: 提出一种竞争粒子群算法. 在粒子进化过程中,每个粒子每次进化都会向两个速度方向进化,其中一个速度方向侧重于全局搜索,另一个速度方向侧重于局部搜索,然后对得到的两个同源子粒子进行比较,保留较优的子粒子,淘汰较差的子粒子,最终得到下一代子粒子种群. 利用几个测试函数对算法性能进行分析验证,并与BPSO、LWPSO、EPSO、TVAC算法进行比较,结果表明所提算法在搜索精度、稳定性以及搜索速度上均优于BPSO、LWPSO、EPSO、TVAC算法. 最后,将竞争粒子群算法应用于UUV航迹规划中,得到了较优的规划航迹.

     

    Abstract: A novel PSO named competition particle swarm optimization has been proposed. Firstly, every particle swarm changes its velocity toward to global best and local best at each time step. Secondly, the optimal generation was updated by comparing the two homologous particles. Thirdly,compared with other algorithms such as the BPSO, LWPSO, EPSO,TVAC and used several test functions to analyze, it is demonstrated that CPSO gets better results in an accurate, stable way. Finally, competition particle swarm algorithm is applied to the path planning for UUV path-planning and it gets the better planning track.

     

/

返回文章
返回
Baidu
map