{'fraction_non_alphanumeric': 0.016152716593245228, 'fraction_numerical': 0.0, 'mean_word_length': 5.089285714285714, '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}}
Distributed Path Planning of Mobile Robots with LTL Specifications

This paper studies the path planning problem of mobile robots with high-level specifications, given as co-safe Linear Temporal Logic (LTL) formulas. Based on some results in literature that are allowing to distribute the specification among the robots, the first contribution of this paper is an algorithm that is allowing a decomposition of the formula in tasks that can be achieved only by one robot. Once the formula is decomposed, we adapt our previous results from centralized planning and we propose a mathematical program to assign the tasks to robots. A supporting example accompanies the proposed method.