{'fraction_non_alphanumeric': 0.018698060941828253, 'fraction_numerical': 0.0, 'mean_word_length': 5.365638766519824, '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}}
Mission planning for multiple UAVs based on ant colony optimization and improved Dubins path

This paper presents a mission planning method for multiple unmanned aircraft vehicles (UAVs) attacking multiple ground targets. The mission planning method includes mission allocation based on ant colony optimization (ACO) and path planning based on improved Dubins path. First, the multiple targets attacking problem is transformed to an optimization problem. Second, to make the method more applicative for real battlefield, several common constraints are considered in the optimization problem. The constraints of mission allocation mainly include the UAVs' executive ability, flight range, targets' threat degree and attack profit, etc. The constraints of path planning mainly include the minimum turning radius and length of path. To meet the goal of optimization of multiple performance indexes, comprehensive performance index is designed. Moreover, the Dubins path is adopted to generate flight paths for every UAV. And some improvement of Dubins path is made to fit the path planning problem. The improved Dubins path is easier to be calculated and shorter than the original Dubins path. Finally, an example of multiple UAVs attacking multiple ground targets is carried out to verify the feasibility of strategies for mission planning. Results of MATLAB simulations indicate that the strategy is feasible to the problems of mission planning.