{'fraction_non_alphanumeric': 0.017220172201722016, 'fraction_numerical': 0.0, 'mean_word_length': 5.310077519379845, '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}}
Accelerated A* path planning

The paper addresses the area of path planning for non-holonomic vehicles operating in a large-scale dynamic continuous three-dimensional space where the vehicle has to avoid given obstacles and restricted areas. For vehicles, motion dynamics is defined by means of constraints on the driving manoeuvres and restrictions on smoothness of the trajectory. The paper addresses only the basic spatial path planning problem -- a process searching for a spatial arrangement of the trajectory from the given start position and orientation to the given target position and orientation. Extended problems like incremental planning are not considered by this paper. The dynamic environment means that obstacles' and restricted areas' definitions are altered almost after each particular search.