{'fraction_non_alphanumeric': 0.013333333333333334, 'fraction_numerical': 0.0, 'mean_word_length': 5.639455782312925, '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}}
Mobile robot path planning in environments cluttered with non-convex obstacles using particle swarm optimization

Generally workspaces of mobile robots are cluttered with obstacles of different sizes and shapes. Majority of the path planning algorithms get stuck in non-convex obstacles pertaining to local minima. Particle Swarm Optimization (PSO) is by comparison simple and readily intelligible yet a very powerful optimization technique which makes it an apt choice for path finding problems in complex environments. This paper presents a particle swarm optimization based path planning algorithm developed for finding a shortest collision-free path for a mobile robot in an environment strewed with non-convex obstacles. The proposed method uses random sampling and finds the optimal path while avoiding non-convex obstacles without exhaustive search. Detailed simulation results show the functionality and effectiveness of the proposed algorithm in different scenarios.