{'fraction_non_alphanumeric': 0.01818181818181818, 'fraction_numerical': 0.0, 'mean_word_length': 5.067796610169491, '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}}
Application of Improved A* algorithm in Mobile Robot Path Planning

A* algorithm has lots of extended nodes, which will raises the amount of calculation. This paper presents Improved A* algorithm, which can reduces the amount of calculation by reducing the number of extended nodes. Improved A* algorithm adds one parameter which is the cost from the previous point to the final point in the valuation function, which will greatly reduces the number of nodes and improved algorithm efficiency. For the sake of proving the effectiveness of improved algorithm, simulation software and wheeled mobile robot are used for experiment. The experiments result show that our algorithm can greatly reduce the number of nodes.