{'fraction_non_alphanumeric': 0.016551724137931035, 'fraction_numerical': 0.0, 'mean_word_length': 4.854838709677419, '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}}
A novel path planning method based on path network

Traditional path planning methods are too slow to meet the real-time requirement in practical applications. In order to solve this problem, an idea of path net was proposed in this paper. The path planning procedure is divided into two steps: network segment planning and segment assembling. The first step was done with Fast Marching Method, including port selection of segment and network segment planning. Second step, the A* searching method was chosen to select segments for assembling. Experiments demonstrated that our method can obtain an optimal route in a few of seconds after the start and goal are given while several minutes are needed for traditional methods.