Observer-based adaptive consensus tracking for linear multi-agent systems with input saturation

63Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

This study considers the observer-based consensus tracking problem of linear multi-agent systems with input saturation. Existing observer-based consensus protocols are designed based on an undirected graph, and need global information, such as the network size or eigenvalue information of the Laplacian matrix. In this study, based on only the agent dynamics and the relative outputs of neighbouring agents, an adaptive consensus protocol is proposed by assigning a time-varying coupling weight to each node, and this protocol is independent of any global information and hence is fully distributed. Under the assumptions that each agent is asymptotically null controllable with bounded controls and detectable, and the topological graph has a directed spanning tree with the leader as the root node, semi-global observerbased consensus tracking of multi-agent systems can be reached despite actuator saturation occurring. The results are applied to consensus tracking control of two-mass-spring systems, which are well-known models for vibration in many mechanical systems.

Cite

CITATION STYLE

APA

Chu, H., Yuan, J., & Zhang, W. (2015). Observer-based adaptive consensus tracking for linear multi-agent systems with input saturation. IET Control Theory and Applications, 9(14), 2124–2131. https://doi.org/10.1049/iet-cta.2014.1268

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