{'fraction_non_alphanumeric': 0.01288936627282492, 'fraction_numerical': 0.0, 'mean_word_length': 4.936305732484076, '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}}
Research on path planning method of multi mobile robot in dynamic environment

A path planning structure based on hierarchical idea was adopted in this paper. In this structure, the global path planning is done firstly by the robot and the local online adjusting is done afterward. This kind of structure can debase the calculation complexity of path planning. Then, aiming at the problem of local motion planning, a conflict-resolution strategy based on forecast was presented. It can decompose the restrictions of obstacle avoidance problem by establishing rules so as to debase the complexity of the problem. The reasoning process of this local path planning method is simple and practical. The experiments show that the robots can avoid the obstacles which are not only static ones but also moving ones accurately and effectively and the local path planning method is suitable to the conflict-resolution of multi mobile robots.