{'fraction_non_alphanumeric': 0.026687598116169546, 'fraction_numerical': 0.0, 'mean_word_length': 5.510204081632653, '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}}
Cooperative simultaneous attack with multiple missiles under leader-follower communication graphs

The cooperative simultaneous attack problem with multiple missiles against a single target under leader-follower communication graphs is addressed in this paper. Based on the neighboring missiles' time-to-go estimates, which are determined by missiles' ranges-to-go over the closing speeds, a distributed guidance law is proposed. By using algebraic graph theory and Lyapunov stability theory, it is strictly proved that the proposed distributed guidance law can drive all the missiles' real times-to-go to reach consensus in finite time.