{'fraction_non_alphanumeric': 0.01592797783933518, 'fraction_numerical': 0.002770083102493075, 'mean_word_length': 5.046025104602511, '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}}
Linear quadratic regulator control of multi‐agent systems

This paper considers a collection of agents performing a shared task making use of relative information communicated over an information network. The designed suboptimal controllers are state feedback and static output feedback, which are guaranteed to provide a certain level of performance in terms of a linear quadratic regulator (LQR) cost. Because of the convexity of the LQR performance region, the suboptimal LQR control problem with state feedback is reduced to the solution of two inequalities, with the minimum and maximum eigenvalues of the Laplacian matrix as the coefficients. The advantage of the method is that the LQR control problem of network multi‐agent systems can be converted into the LQR control of a set of single‐agent systems, and the structure constraint on the feedback gain matrix can be eliminated. It can be shown that the size of the LQR control problem will not increase according to the number of the node in the fairly general framework. The method can be extended to the synthesis of the static output feedback, which is derived from the weighting matrices in LQR. Through some coordinate transformation and the augmentation of the output matrix, the LQR synthesis is provided on the basis of the output measurements of the adjacent agents. Numerical examples are presented to illustrate the proposed method. Copyright © 2013 John Wiley & Sons, Ltd.