Answers are grounded in this paper and cite their sources.
This article considers the problem of consensus for discrete‐time networks of multiagent with time‐varying delays and quantization. It is assumed that the logarithmic quantizer is utilized between the information flow through the sensor of each agent, and its quantization error is included in the proposed method. By constructing a suitable Lyapunov‐Krasovskii functional and utilizing matrix theory, a new consensus criterion for the concerned systems is established in terms of linear matrix inequalities (LMIs) which can be easily solved by various effective optimization algorithms. Based on the consensus criterion, a designing method of consensus protocol is introduced. One numerical example is given to illustrate the effectiveness of the proposed method.
No takes yet. Share an insight, caveat, or question.
Park et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: