{'fraction_non_alphanumeric': 0.018867924528301886, 'fraction_numerical': 0.0030188679245283017, 'mean_word_length': 5.564356435643564, '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}}
Local Path Planning Algorithm for Blind-guiding Robot Based on Improved DWA Algorithm

When Dynamic Window Approach (DWA) is used in obstacle avoidance of blind-guiding robots, the contradiction which between the heading and velocity evaluation factors is not considered, resulting in, selecting the trajectory under certain road conditions, the not-timely collision avoidance, frequently direction changing, time-consuming planning and other issues in the planned path. To balance the relationship between the original three evaluation factors, the evaluation factor about the change of orientation is introduced into the function of path evaluation, which will suppress the excessive influence of a particular factor on the evaluation function under some specific circumstances, and to reduce unnecessary steering frequency of the robot. Experiments reveal that the actual required runtime of the planning path with the improved algorithm is reduced at average of 45.37% compared with that with the DWA algorithm, path planned with the improved algorithm can be planned advance to avoid obstacles with a smaller and continuous curvature. It can be obtained that the improved algorithm has a smoother trajectory and more timely collision avoidance, which can meet the comfort requirements of the blind-guiding robot’s users.