{'fraction_non_alphanumeric': 0.02631578947368421, 'fraction_numerical': 0.0, 'mean_word_length': 5.3375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reconnaissance and Confirmation Task Planning of Multiple Fixed-Wing UAVs with Specific Payloads: A Comparison Study

In this study, the reconnaissance and confirmation task planning of multiple fixed-wing unmanned aerial vehicles (UAV) with specific payloads, which is an NP-hard problem with strong constraints and mixed variables, is decomposed into two subproblems, task allocation with “payload-target” matching constraints, and fast path planning of the UAV group, for which two mathematical models are respectively established. A bi-layer collaborative solution framework is also proposed. The outer layer optimizes the allocation scheme between the UAVs and targets, whereas the inner layer generates the UAV path and evaluates the outer scheme. In the outer layer, a unified encoding based on the grouping and pairing relationship between UAVs and targets is proposed. The corresponding combinatorial mutation operators are then designed for the representative NSGA-II, MOEA/D-AWA, and DMOEA-ϵC algorithms. In the inner layer, an efficient heuristic algorithm is used to solve the path planning of each UAV group. The simulation results verify the effectiveness of the cooperative bi-layer solution scheme and the combined mutation operators. At the same time, compared with the NSGA-II and MOEA/D-AWA, DMOEA-ϵC can obtain a significantly better Pareto front and can weigh the assigned number of UAVs and the total task completion time to generate more diversified reconnaissance confirmation execution schemes.