Anti-ship missile coordinated attack mission planning is a complex multi-objective optimization problem with multiple combinations of platforms, strong decision-making constraints, and tightly coupled links. To avoid the coupling disorder between path planning and firepower distribution and improve the efficiency of coordinated attack mission planning, a firepower distribution model under the conditions of path planning is established from the perspective of decoupling optimization and the algorithm is implemented. First, we establish reference coordinate system of firepower distribution to clarify the reference direction of firepower distribution and divide the area of firepower distribution; then, we construct an index table of membership of firepower distribution to obtain alternative firepower distribution plans; finally, the fitness function of firepower distribution is established based on damage income, missile loss, ratio of efficiency and cost of firepower distribution, and the mean square deviation of the number of missiles used, and the alternatives are sorted to obtain the optimal firepower distribution plan. According to two simulation experiments, the method in this paper can effectively solve the many-to-many firepower distribution problem of coupled path planning. Under the premise of ensuring that no path crossing occurs, the optimal global solution can be obtained, and the operability and timeliness are good.

To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper proposed multi-operator real-time constraints particle swarm optimization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and integrates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evolution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection optimization of paths, gradually reducing algorithmic space, accelerating convergence, and enhances path cooperativity. Simulation experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demonstrate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. Moreover it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collaborative path planning. The experiments are conducted in three collaborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality.