{'fraction_non_alphanumeric': 0.01225114854517611, 'fraction_numerical': 0.0, 'mean_word_length': 4.589743589743589, '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}}
Learning cooperative assembly with the graph representation of a state-action space

In this paper, we present a method for two robot manipulators to learn cooperative assembly tasks. A learning algorithm based on trial end error is used to find a sequence for each robot to assemble the goal aggregate. It is shown that a distributed learning method based on a Markov decision process is able to learn the sequences for the involved robots. A novel state-action graph is used to store the reinforcement values of the learning process. The approach is designed in a way that not only exact matches but also similar aggregates are accepted by the system.