{'fraction_non_alphanumeric': 0.018095238095238095, 'fraction_numerical': 0.0, 'mean_word_length': 5.487654320987654, '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}}
Dynamic Feedback Synchronization of Lur'e Networks via Incremental Sector Boundedness

In this note, we generalize our results on synchronization of homogeneous Lur'e networks by static, relative state information based protocols from Zhang et al to the case that for each agent only relative measurements are available. We establish sufficient conditions under which a linear dynamic synchronization protocol exists for such networks. These conditions involve feasibility of two LMI's together with a coupling inequality, reminiscent of the well-known LMI conditions in H∞ control by measurement feedback. We show that, regardless of the number of agents in the network, only the three inequalities are involved. In the computation of the protocol matrices, the eigenvalues of the Laplacian matrix of the interconnection graph occur. In particular, the matrices representing the protocol depend on the smallest nonzero eigenvalue and the largest eigenvalue of the Laplacian matrix. We validate our results by means of a numerical simulation example.