{'fraction_non_alphanumeric': 0.01917255297679112, 'fraction_numerical': 0.0020181634712411706, 'mean_word_length': 5.7482993197278915, '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}}
MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY

To correctly model certain real‐world planning problems, it is essential to take into account time. This is the case for problems requiring the concurrent execution of actions (known as temporally expressive problems). In this paper, we define and study the notion of temporally cyclic problems, that is problems involving sets of cyclically dependent actions. We characterize those temporal planning languages, which can express temporally cyclic problems. We also present a polynomial‐time algorithm, which transforms a temporally cyclic problem into an equivalent acyclic problem. Applying our transformation allows any temporal planner to solve temporally cyclic problems without explicitly managing cyclicity. We first present our results for temporal PDDL (Planning Domain Description Language) 2.1 and then extend them to a language that allows conditions over arbitrary intervals and effects at arbitrary instants.