On distributed reduced-order observer-based protocol for linear multiagent consensus under switching topology

11Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We discuss linear multiagent systems consensus problem with distributed reduced-order observer-based protocol under switching topology. We use Jordan decomposition method to prove that the proposed protocols can solve consensus problem under directed fixed topology. By constructing a parameter-dependent common Lyapunov function, we prove that the distributed reduced-order observer-based protocol can also solve the continuous-time multi-agent consensus problem under the undirected switching interconnection topology. Then, we investigate the leader-following consensus problem and propose a reduced-order observer-based protocol for each following agent. By using similar analysis method, we can prove that all following agents can track the leader under a class of directed interaction topologies. Finally, the given simulation example also shows the effectiveness of our obtained result. © 2013 Yan Zhang et al.

Cite

CITATION STYLE

APA

Zhang, Y., Gao, L., & Tong, C. (2013). On distributed reduced-order observer-based protocol for linear multiagent consensus under switching topology. Abstract and Applied Analysis, 2013. https://doi.org/10.1155/2013/793276

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