## $$H_\infty$$ consensus control of multi-agent systems with switching topology: a dynamic output feedback protocol.(English)Zbl 1222.93065

Summary: This article is devoted to the consensus control for switching networks of multiple agents with linear coupling dynamics and subject to external disturbances, which is transformed into an $$H_\infty$$ control problem by defining an appropriate controlled output. On this basis, a distributed dynamic output feedback protocol is proposed with an undetermined system matrix, and a condition in terms of Linear Matrix Inequalities (LMIs) is derived to ensure consensus of the multi-agent system with a prescribed $$H_\infty$$ level. Furthermore, the system matrix of the protocol is designed by solving two LMIs. A numerical example is included to illustrate the effectiveness of the proposed consensus protocol.

### MSC:

 93B36 $$H^\infty$$-control 93A14 Decentralized systems 93B52 Feedback control
Full Text:

### References:

 [1] DOI: 10.1137/1.9781611970777 · Zbl 0816.93004 [2] DOI: 10.1109/TAC.2004.834433 · Zbl 1365.90056 [3] Green M, Linear Robust Control (1995) [4] DOI: 10.1016/j.automatica.2006.02.013 · Zbl 1117.93300 [5] DOI: 10.1109/TAC.2003.812781 · Zbl 1364.93514 [6] Jia Y, Robust H Control (2007) [7] DOI: 10.1007/s11424-009-9145-y · Zbl 1178.93045 [8] DOI: 10.1016/j.sysconle.2008.01.002 · Zbl 1140.93355 [9] DOI: 10.1109/TAC.2004.832203 · Zbl 1365.93243 [10] DOI: 10.1109/TAC.2004.834113 · Zbl 1365.93301 [11] DOI: 10.1109/TAC.2005.846556 · Zbl 1365.93302 [12] DOI: 10.1103/PhysRevLett.75.1226 [13] DOI: 10.1080/00207170600825097 · Zbl 1330.94022 [14] DOI: 10.1016/j.jpdc.2006.08.010 · Zbl 1109.68019 [15] DOI: 10.1002/rnc.1144 · Zbl 1266.93013 [16] DOI: 10.1080/00207170802549560 · Zbl 1168.93395
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.