SYSYJun 26, 2018

Completely Distributed Guaranteed-performance Consensualization for High-order Multiagent Systems with Switching Topologies

arXiv:1806.09770107 citationsh-index: 34
AI Analysis

It addresses the challenge of achieving guaranteed-performance consensus in multiagent systems with switching topologies without requiring global information, which is important for distributed control applications.

This paper achieves completely distributed guaranteed-performance consensus for high-order multiagent systems with switching topologies, using adaptive protocols that are independent of interaction topologies and switching motions. The approach is validated through numerical examples.

The guaranteed-performance consensualization for high-order linear and nonlinear multiagent systems with switching topologies is respectively realized in a completely distributed manner in the sense that consensus design criteria are independent of interaction topologies and switching motions. The current paper firstly proposes an adaptive consensus protocol with guaranteed-performance constraints and switching topologies, where interaction weights among neighboring agents are adaptively adjusted and state errors among all agents can be regulated. Then, a new translation-adaptive strategy is shown to realize completely distributed guaranteed-performance consensus control and an adaptive guaranteed-performance consensualization criterion is given on the basis of the Riccati inequality. Furthermore, an approach to regulate the consensus control gain and the guaranteed-performance cost is proposed in terms of linear matrix inequalities. Moreover, main conclusions for linear multiagent systems are extended to Lipschitz nonlinear cases. Finally, two numerical examples are provided to demonstrate theoretical results.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes