{'fraction_non_alphanumeric': 0.017948717948717947, 'fraction_numerical': 0.0, 'mean_word_length': 5.563025210084033, '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}}
Tracking problem under a time-varying topology

This paper studies the multi-agent tracking problem of a third-order maneuvering target under uncertain communication environments. Each tracking agent is assumed to be a third-order system and can only use its own and neighbors' position, velocity, and acceleration information to design its control input. In this work, the uncertain communication environments are modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sufficient conditions for the existence of a tracking strategy have been expressed in terms of the solvability of linear matrix inequalities. Finally, a numerical example is employed to demonstrate the effectiveness of the proposed tracking strategy.