Abstract

In this article, the problem of nonfragile tracking protocol design for high-order multiagent systems with Lipschitz-type node dynamics is investigated. Considerations are that the network is subject to aperiodic intermittent communications and the in-neighboring agents’ interactions switch in a directed graphs set, in which each element contains a directed spanning tree. The zero-order holder is employed to keep the local information from in-neighboring agents as the network communications are out of action. By virtue of a proposed two-step switching mechanism, one equivalently casts the concerned consensus tracking issue into asymptotically stabilizing a class of uncertain switched time-delay systems. Taking advantage of algebraic graph theory, Lyapunov–Krasovskii stability analysis, and robust nonfragile control approach, it is proved that the nonfragile consensus tracking can be achieved if a group of linear matrix inequalities are feasible and, for each time interval, the communication rate is larger than a threshold value. Numerical examples demonstrate the effectiveness of 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