{'fraction_non_alphanumeric': 0.0167973124300112, 'fraction_numerical': 0.0011198208286674132, 'mean_word_length': 5.385714285714286, '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}}
A multi-agent coverage algorithm with connectivity maintenance

This paper presents a connectivity control algorithm of a multi-agent system. The connectivity of the multi-agent system can be represented by the second smallest eigenvalue λ2 of the Laplacian matrix LG and it is also referred to as algebraic connectivity. Unlike many of the existing connectivity control algorithms which adapt convex optimization technique to maximize algebraic connectivity, we first show that the algebraic connectivity can be maximized by minimizing the weighted sum of distances between the connected agents. We implement a hill-climbing algorithm that minimizes the weighted sum of distances. Semi-definite programming (SDP) is used for computing proper weight w∗. Our proposed algorithm can effectively be mixed with other cooperative applications such as covering an unknown area or following a leader.