OACRR-PSO algorithm for anti-ship missile path planning

被引：0

作者：

Liu, Gang ^{[1
]}

Lao, Song-Yang ^{[1
]}

Yuan, Can ^{[2
]}

Hou, Lv-Lin ^{[1
]}

Tan, Dong-Feng ^{[1
]}

机构：

[1] Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China

[2] Department of Nuclear Science and Engineering, Naval University of Engineering, Wuhan 430033, China

来源：

Zidonghua Xuebao/Acta Automatica Sinica | 2012年 / 38卷 / 09期

关键词：

Particle swarm optimization (PSO) - Mathematical transformations - Motion planning - Clustering algorithms - Ships;

D O I：

10.3724/SP.J.1004.2012.01528

中图分类号：

学科分类号：

摘要：

In order to improve the search efficiency of path planning algorithm for anti-ship missile, the planning space is researched based on geometric principle. The geometric gradual transformation rule of operational area is revealed when fusing the concept of operational area into the process of converse path planning, hereby, the operational area cluster is proposed to be its physical carrier. By introducing the operational area cluster into particle swarm optimization (PSO) algorithm, a PSO algorithm real-time restricted by operational area cluster (OACRR-PSO) is proposed. To express the operational area cluster expediently, the polar coordinates code mode is adopted in path coding. Considering the relationship between the adjoining vectors of particle, OACRR-PSO does not update all the velocity vectors of particle simultaneously in the course of optimization, which is different from conventional PSO, but updates sequentially by adopting the strategy of sequential recursion evolution. In the course of updating particle, the operational area cluster is used to restrict the position vectors of particle in exact updating area in real-time, which reduces the search space step by step to increase the convergence velocity. Simulation results indicate that the strategy of sequential recursion evolution could improve the algorithm's global search capabilities and the algorithm possesses a better convergence rate and robustness. Copyright © 2012 Acta Automatica Sinica. All rights reserved.

引用

页码：1528 / 1537