{'fraction_non_alphanumeric': 0.026823134953897737, 'fraction_numerical': 0.0075440067057837385, 'mean_word_length': 5.982456140350878, '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}}
Guaranteed cost optimal leader‐synchronization strategy design for distributed multi‐agent systems with input saturation

In this article, a guaranteed cost optimal leader‐synchronization control strategy design problem is investigated for the input‐saturated multi‐agent systems (MASs). A time‐varying network topology is adopted to describe the varying network communication among the MASs in practical situation. With considering input saturation, time‐varying network topology, and stochastic nonlinearities disturbance, it is literally impossible to obtain the accurate value of the associate cost function for the leader‐synchronization performance. As an alternative, an upper bound of cost function is derived for the distributed MASs. Then, the guaranteed cost optimal leader‐synchronization strategy is designed such that the upper bound can be minimized under a fixed domain of attraction (DOA). Meanwhile, an optimization problem is solved to maximize the DOA by the linear matrix inequality (LMI) method over an infinite horizon. Finally, a B747−100/200 aircraft example consisting of a leader and four followers is provided to illustrate the validity of the proposed methodology.