{'fraction_non_alphanumeric': 0.01619047619047619, 'fraction_numerical': 0.0, 'mean_word_length': 5.182352941176471, '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}}
Obstacle Avoidance Path Planning Based on Improved APF and RRT

In recent years, collaborative robots have been widely used in the field of intelligent manufacturing. Obstacle avoidance path planning, as a key technology of collaborative robots in motion planning, is becoming more and more important. In order to solve the shortcomings of APF easily falling into local minimums and the shortcomings of RRT's strong randomness, this paper improves and combines these two algorithms. Firstly, artificial potential field algorithm is used in local obstacle avoidance path planning. When falling into local minimum, the improved RRT algorithm can adaptively select the temporary target point and make the search process jump out of the local minimum point. In addition, artificial potential field algorithm will be applied when the robot arm leaves the local minimum. Finally, we use a greedy algorithm to remove redundant nodes in the path. Experiments show that this algorithm can greatly improve the success rate of planning and reduce planning time.