{'fraction_non_alphanumeric': 0.012711864406779662, 'fraction_numerical': 0.002824858757062147, 'mean_word_length': 5.445454545454545, '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}}
Optimal Flight Paths over Essential Visibility Graphs

This paper deals with the problem of generating optimal 2D flight paths compliant with mission constraints resulting from no-fly zones and/or obstacles, and from flight mechanics limitations as minimum coordinate turn radius and maximum climb and descent angles. The optimization problem is converted into a minimum cost path search within a so called Essential Visibility Graph whose arcs and corresponding weights are obtained via an efficient branching algorithm in view of possible real-time implementations. A possible extension to 3D paths is also presented. Finally, numerical examples are reported with a discussion on the computational aspects.