{'fraction_non_alphanumeric': 0.013568521031207599, 'fraction_numerical': 0.0, 'mean_word_length': 5.254237288135593, '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 for circular shaped obstacles using simulated annealing

Many heuristic methods are used for path planning by researchers in the past and contemporary work but due to easy implementation, convergence properties, capability of escaping local optima and the use of hill-climbing moves have made simulated annealing (SA) a good choice for path planning. In this research the simulated annealing algorithm is used to obtain a collision-free optimal path among fixed circular shaped obstacles for a mobile robot. A feasible path is computed by series of points in cells generated between start to goal point. The effectiveness of the proposed algorithm in different environments is shown through simulation results.