In this paper, a novel swarm‐based metaheuristic algorithm is proposed, which is called tuna swarm optimization (TSO). The main inspiration for TSO is based on the cooperative foraging behavior of tuna swarm. The work mimics two foraging behaviors of tuna swarm, including spiral foraging and parabolic foraging, for developing an effective metaheuristic algorithm. The performance of TSO is evaluated by comparison with other metaheuristics on a set of benchmark functions and several real engineering problems. Sensitivity, scalability, robustness, and convergence analyses were used and combined with the Wilcoxon rank‐sum test and Friedman test. The simulation results show that TSO performs better compared to other comparative algorithms.

The Manta ray foraging optimization (MRFO) is a novel swarm-based metaheuristic optimizer. It is mainly modeled by simulating three foraging behaviors of the Manta rays, which has a good performance. However, several drawbacks of MRFO have been noticed by analyzing its mathematical model. Random selection of reference points in the early iterations weakens the exploitation capability of MRFO. Chain foraging tends to lead the algorithm into local optimum. In addition, the algorithm suffers from the deficiency of decreasing population diversity in the late iteration. To address these shortcomings, a modified MRFO using three strategies, called m-MRFO, is proposed in this paper. An elite search pool (ESP) is established in this paper to enhance exploitation capability. By using adaptive control parameter strategies (ACP), we expand the range of MRFO’s exploration in the early iterations and enhance the accuracy of exploitation in the later iterations, balancing exploiting and exploring capabilities. Furthermore, we use a distribution estimation strategy (DES) to adjust the evolutionary direction using the dominant population information to promote convergence. The m-MRFO performance was verified by selecting 23 classical test functions and CEC2017 test suite. The significance of the results was also verified by Friedman test, Wilcoxon test and Iman-Davenport test. Moreover, we have confirmed the potential of m-MRFO to solve real-world problems by solving three engineering design problems. The simulation results show that the improvement strategy proposed in this paper can effectively improve the performance of MRFO. m-MRFO is highly competitive.

The unmanned aerial vehicle (UAV) path planning problem is a type of complex multi-constraint optimization problem that requires a reasonable mathematical model and an efficient path planning algorithm. In this paper, the fitness function including fuel consumption cost, altitude cost, and threat cost is established. There are also four set constraints including maximum flight distance, minimum flight altitude, maximum turn angle, and maximum climb angle. The constrained optimization problem is transformed into an unconstrained optimization problem by using the penalty function introduced. To solve the model, a multiple population hybrid equilibrium optimizer (MHEO) is proposed. Firstly, the population is divided into three subpopulations based on fitness and different strategies are executed separately. Secondly, a Gaussian distribution estimation strategy is introduced to enhance the performance of MHEO by using the dominant information of the populations to guide the population evolution. The equilibrium pool is adjusted to enhance population diversity. Furthermore, the Lévy flight strategy and the inferior solution shift strategy are used to help the algorithm get rid of stagnation. The CEC2017 test suite was used to evaluate the performance of MHEO, and the results show that MHEO has a faster convergence speed and better convergence accuracy compared to the comparison algorithms. The path planning simulation experiments show that MHEO can steadily and efficiently plan flight paths that satisfy the constraints, proving the superiority of the MHEO algorithm while verifying the feasibility of the path planning model.

Slime mould algorithm (SMA) is a population‐based metaheuristic algorithm inspired by the phenomenon of slime mould oscillation. The SMA is competitive compared to other algorithms but still suffers from the disadvantages of unbalanced exploitation and exploration and is easy to fall into local optima. To address these shortcomings, an improved variant of SMA named MSMA is proposed in this paper. Firstly, a chaotic opposition‐based learning strategy is used to enhance population diversity. Secondly, two adaptive parameter control strategies are proposed to balance exploitation and exploration. Finally, a spiral search strategy is used to help SMA get rid of local optimum. The superiority of MSMA is verified in 13 multidimensional test functions and 10 fixed‐dimensional test functions. In addition, two engineering optimization problems are used to verify the potential of MSMA to solve real‐world optimization problems. The simulation results show that the proposed MSMA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability.

In order to improve filtering precision and restrain divergence caused by sensor faults or model mismatches for target tracking, a new adaptive unscented Kalman filter (N-AUKF) algorithm is proposed. First of all, the unscented Kalman filter (UKF) problem to be solved for systems involving model mismatches is described, after that, the necessary and sufficient condition with third order accuracy of the standard UKF is given and proven by using the matrix theory. In the filtering process of N-AUKF, an adaptive matrix gene is introduced to the standard UKF to adjust the covariance matrixes of the state vector and innovation vector in real time, which makes full use of normal innovations. Then, a covariance matching criterion is designed to judge the filtering divergence. On this basis, an adaptive weighted coefficient is applied to restrain the divergence. Compared with the standard UKF and existing adaptive UKF, the proposed UKF algorithm improves the filtering accuracy, rapidity and numerical stability remarkably, moreover, it has a good adaptive capability to deal with sensor faults or model mismatches. The performance and effectiveness of the proposed UKF is verified in a target tracking mission.