{'fraction_non_alphanumeric': 0.02390438247011952, 'fraction_numerical': 0.0, 'mean_word_length': 4.844961240310077, '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}}
Adaptable mission planning for kino-dynamic systems

Autonomous systems can perform tasks that are dangerous, monotonous, or even impossible for humans. To approach the problem of planning for Unmanned Aerial Vehicles (UAVs) we present a hierarchical method that combines a high-level planner with a low-level planner. We pose the problem of high-level planning as a Selective Traveling Salesman Problem (STSP) and select the order in which to visit our science sites. We then use a kino-dynamic path planner to create a large number of intermediate waypoints. This is a complete system that combines high and low level planning to achieve a goal. This paper demonstrates the benefits gained by adaptable high-level plans versus static and greedy plans.