{'fraction_non_alphanumeric': 0.016252390057361378, 'fraction_numerical': 0.0, 'mean_word_length': 5.269461077844311, '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}}
Graph Connectivity Control of a Mobile Robot Network With Mixed Dynamic Multi-Tasks

Given a team composed of groups of robots with different abilities and different tasks, we propose a control solution that allows maintaining the connectivity between the agents whilst securing the execution of the different tasks assigned to the team. The specific notion of connectivity adopted here is that the different agents have to mutually remain in line-of-sight, and this condition is guaranteed in presence of obstacles. In the computation of the graph topology, based on Minimum Spanning Tree (MST), each agent takes into account the surrounding environment, its own task and the tasks of its neighbours. Our solution permits the execution of heterogeneous tasks and the task dynamic reallocation between the robots when required by the situation. The approach relies on a sound theoretical framework, which is discussed in this letter, while its practical feasibility is shown through simulations and experimental data using real robotic platforms.