In recent years, unmanned aerial vehicles (UAVs) have shown substantial application value in continuous target tracking tasks in complex environments. Due to the target’s movement behavior and the complexities of the surrounding environment, the UAV is prone to losing track of the target. To tackle this issue, this paper presents a reinforcement learning (RL) approach that combines UAV target search and tracking. During the target search phase, spatial information entropy is employed to guide the UAV in avoiding redundant searches, thus enhancing information acquisition efficiency. In the event of target loss, Gaussian process regression (GPR) is employed to predict the target trajectory, thereby reducing the time needed for target re-localization. In addition, to address sample efficiency limitations in conventional RL, a Kolmogorov–Arnold networks-based deep deterministic policy gradient (KbDDPG) algorithm with prior policy embedding is proposed for controller training.Simulation results demonstrate that the proposed method outperforms traditional methods in target search and tracking tasks within complex environments. It improves the UAV’s ability to re-locate the target after loss. The proposed KbDDPG efficiently leverages prior policy, leading to accelerated convergence and enhanced performance.
Three-dimensional UAV path planning is crucial in practical applications. However, existing metaheuristic algorithms often suffer from slow convergence and susceptibility to becoming trapped in local optima. To address these limitations, this paper proposes a multi-strategy integrated artificial protozoa optimization (IAPO) algorithm for UAV 3D path planning. First, the tent map and refractive opposition-based learning (ROBL) are employed to enhance the diversity and quality of the initial population. Second, in the algorithm’s autotrophic foraging stage, we design a dynamic optimal leadership mechanism, which accelerates the convergence speed while ensuring robust exploration capability. Additionally, during the reproduction phase of the algorithm, we update positions using a Cauchy mutation strategy. Thanks to the heavy-tailed nature of the Cauchy distribution, the algorithm is less likely to become trapped in local optima during exploration, thereby increasing the probability of finding the global optimum. Finally, we incorporate the simulated annealing algorithm into the heterotrophic foraging and reproduction stages, effectively preventing the algorithm from getting trapped in local optima and reducing the impact of inferior solutions on the convergence efficiency. The proposed algorithm is validated through comparative experiments using 12 benchmark functions from the 2022 IEEE Congress on Evolutionary Computation (CEC), outperforming nine common algorithms in terms of convergence speed and optimization accuracy. The experimental results also demonstrate IAPO’s superior performance in generating collision-free and energy-efficient UAV paths across diverse 3D environments.