{'fraction_non_alphanumeric': 0.01932367149758454, 'fraction_numerical': 0.0, 'mean_word_length': 5.095588235294118, '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}}
An Improved Multi-objective Evolutionary Algorithm for A Robot Detect Path Planning Problem

In this paper, we study the path planning problem of the detection robot after the coal mine disaster, and arrange a robot to detect multiple target points. The objective is to minimize the path length and the degree of danger simultaneously. First, the A-Star algorithm is used to obtain the path matrix of any two target points. Then an improved multi-objective optimization algorithm is proposed to find paths with Pareto optimal or near-optimal solutions. Finally, the multi-objective optimization algorithm is compared with other multi-objective optimization algorithms. The experimental results demonstrate that the algorithm can effectively obtain the detection path and minimize the length of the path and the degree of danger.