{'fraction_non_alphanumeric': 0.018819503849443968, 'fraction_numerical': 0.001710863986313088, 'mean_word_length': 4.909090909090909, '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}}
New method for UAV online path planning

The task of on-line planning paths for unmanned aerial vehicle (UAVs) across a 3D terrain has been paid considerable attention in academia. This paper presents a new tactical path planning algorithm, called List Expanding Algorithm (LEA), which aims at generating a safe path from initial position to destination without any collision with forbidden regions such as threats and obstacles. The input of the task is a digital elevation map and the information of threats. Based on the algorithms in computer graphics, we fuse the two sources of data and then reflect the 3D information into a flight plane which comprises of forbidden regions. In order to generate a collision-free path, the process of region expansion is performed. Finally, the efficient recursive subroutine, the core of LEA, is designed to insert new nodes into a path list to find the path. Experimental results of the proposed algorithm are provided and compared with the Visibility Graph method. The results show that our algorithm has a superior performance in computational time and can plan a path in three-dimensional space effectively and efficiently.