An Efficient Evolution-Based Technique for Moving Target Search with Unmanned Aircraft Vehicle: Analysis and Validation

Recent advances in technology have led to a surge in interest in unmanned aerial vehicles (UAVs), which are remote-controlled aircraft that rely on cameras or sensors to gather information about their surroundings during flight. A UAV requires a path-planning technique that can swiftly recalculate a viable and quasi-optimal path in flight if a new obstacle or hazard is recognized or if the target is moved during the mission. In brief, the planning of UAV routes might optimize a specific problem determined by the application, such as the moving target problem (MTP), flight time and threats, or multiobjective navigation. The complexity of MTP ranges from NP-hard to NEXP-complete because there are so many probabilistic variables involved. Therefore, it is hard to detect a high-quality solution for this problem using traditional techniques such as differential calculus. Therefore, this paper hybridizes differential evolution (DE) with two newly proposed updating schemes to present a new evolution-based technique named hybrid differential evolution (HDE) for accurately tackling the MTP in a reasonable amount of time. Using Bayesian theory, the MTP can be transformed into an optimization problem by employing the target detection probability as the fitness function. The proposed HDE encodes the search trajectory as a sequence of UAV motion pathways that evolve with increasing the current iteration for finding the near-optimal solution, which could maximize this fitness function. The HDE is extensively compared to the classical DE and several rival optimizers in terms of several performance metrics across four different scenarios with varying degrees of difficulty. This comparison demonstrates the proposal’s superiority in terms of the majority of used performance metrics.