H∞ Consensus of Linear Multi-Agent Systems with Semi-Markov Switching Network Topologies and Measurement Noises

13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper investigates the H∞ consensus of linear multi-agent systems with semi-Markov switching network topologies and measurement noises. The information that each agent measures its neighbors's has multiplicative noises. The switching of the network topologies are modeled by a semi-Markov process. Taking the external disturbance into account, H∞ consensus of multi-agent systems with multiplicative noises is achieved under semi-Markov switching network topologies by using semi-Markov jump theory, stochastic theory and algebraic graph theory. Finally, simulation example is provided to illustrate the effectiveness of the theoretical results.

Cite

CITATION STYLE

APA

Cong, M., & Mu, X. (2019). H∞ Consensus of Linear Multi-Agent Systems with Semi-Markov Switching Network Topologies and Measurement Noises. IEEE Access, 7, 156089–156096. https://doi.org/10.1109/ACCESS.2019.2949282

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free