{'fraction_non_alphanumeric': 0.01951951951951952, 'fraction_numerical': 0.0045045045045045045, 'mean_word_length': 4.902654867256637, '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}}
Novel index for the best node selection problem and enhanced technique for the node's state estimation

The best node selection problem, that distinguishes a node with the best state among multiply connected nodes, is one of the fundamental problem in robotics. However, a systematic solution has not been proposed by its ambiguity characteristics. To make the problem tractable, we reduce the scope of the original problem. Then, we suggest a novel index that systematically judges a required time step needed for a node to be the best. Furthermore, we suggest a new estimation technique that outperforms than previous approaches by 4.94 times in its settling time.