{'fraction_non_alphanumeric': 0.018363939899833055, 'fraction_numerical': 0.0, 'mean_word_length': 5.735955056179775, '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}}
Dynamic assembly sequence selection using reinforcement learning

Determining the most appropriate sequence for assembling products requires assessment of the process, product, and the technology applied. Most production engineers apply constraint based evaluation and history to identify the solution sequence. What if their solution is sub-optimal? In this paper a self-learning technique for selecting a sequence and dynamically changing the sequence is presented, selection is based on the history of assemblies. The evaluation is dependent on part properties rather than parts and their relationships, thus no previous knowledge of parts and their interaction is required in the decision making process. The method assumes assembly is without constraint, for example, a highly flexible robotic assembly cell. This maximises the ability of the algorithm to select sequences for new products and optimise them. The heart of the algorithm is a reinforcement-learning model, which punishes failed assembly steps, this facilitates feedback sequence selection, when: current methods are merely feedforward. This feedback approach addresses combinatorial explosion that can cripple assembly planners.