{'fraction_non_alphanumeric': 0.017105263157894738, 'fraction_numerical': 0.0, 'mean_word_length': 5.289256198347108, '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}}
Robot Planning with Ant Colony Optimization Algorithms

Ant colony optimization algorithms are investigated in this paper for robot planning in configuration space. The robot planning problem is to find a feasible path from a beginning to a goal while avoiding obstacles in a clustered environment. Lots of attentions have been paid on such problems, but little is with the ant colony optimization algorithms. Originated from the max-min ant system (MMAS) algorithm for traveling salesman problem, a modified ant colony optimization algorithm for robot planning is proposed. The algorithm has some distinguished features, such as a path pruning mechanism, etc. The optimal solution can be achieved effectively in different environments with a high probability.