{'fraction_non_alphanumeric': 0.012488849241748439, 'fraction_numerical': 0.007136485280999108, 'mean_word_length': 5.032258064516129, '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}}
Computationally Efficient Visibility Graph-Based Generation Of 3D Shortest Collision-Free Path Among Polyhedral Obstacles For Unmanned Aerial Vehicles

Autonomous unmanned aerial vehicles (UAVs) need to dynamically re-plan paths online to avoid newly detected obstacles and no-fly zones. Existing 3D path planning methods are either too computationally intensive for online use or have practical limitations for actual applications. We propose a new method based on visibility graphs that is both computationally efficient for online use and is suitable for actual applications. We consider the 3D space to be composed of many 2D planes that all pass through the current position of the UAV and the destination point. Finding the shortest collision-free path in each plane is a 2D path planning problem which can be solved by using existing visibility graph algorithms. We then collect all the shortest paths generated from each 2D plane and find the shortest path in the whole 3D space. We present the results of the proposed 3D path planning algorithm for two cases to demonstrate that the proposed method is effective.