Abstract

In this paper, we study average consensus problem in networks of dynamic agents with uncertain topologies as well as time-varying communication delays. By using the linear matrix inequality method, we establish several sufficient conditions for average consensus in the existence of both uncertainties and delays. Several linear matrix inequality conditions are presented to determine the allowable upper bounds of time-varying communication delays and uncertainties. Numerical examples are worked out to illustrate the theoretical results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call