{'fraction_non_alphanumeric': 0.021963824289405683, 'fraction_numerical': 0.0, 'mean_word_length': 5.0546875, '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}}
Tractable Correct Planning for an Assembly Line

The industry asks for formal, efficient methods for tackling dynamic systems of combinatorial nature, eg. error recovery in industrial processes. As an application example, we have used a minituare assembly line that assembles toy cars---a process that has many similarities with real industrial processes. We have tried to apply one of our provably correct, polynomial-time planning algorithms to plan for this assembly line. Analysing why this did not work provided insight into the inherent structure of the process. This was used as feedback for modifying the theory and extending the previous theoretical results. This resulted in a new provably correct, polynomial-time planner which is sufficient for this application.