{'fraction_non_alphanumeric': 0.021517553793884484, 'fraction_numerical': 0.0, 'mean_word_length': 5.01360544217687, '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}}
Fireworks Algorithm with New Feasibility-Rules in Solving UAV Path Planning

Unmanned Aerial Vehicle (UAV) path planning is a high dimensional NP-hard problem. It is related to optimizing the flight route subject to various constraints inside the battlefield environments. Since the number of control points is high as well as the number of radars, the traditional methods could not produce acceptable results when tackling this problem. In this paper, we have converted the UAV path planning problem to the constrained one based on new feasibility-rules and then we have implemented the Fireworks algorithm (FWA) and applied it later in solving this issue. For experimental purposes, we used the parameters of the battlefield environments from the literature to verify the proposed FWA. The simulation results show that the proposed FWA in all cases outperforms PSO, DE, BA, and CS.