Kaastra, S (2013) Robust Synchronization of Multiplicatively Perturbed Multi-Agent Systems. Master's Thesis / Essay, Mathematics.
|
Text
MasterThesisSiebrichKaastra.pdf - Published Version Download (322kB) | Preview |
|
Text
KaastraSAkkoordTrentelman.pdf - Other Restricted to Registered users only Download (23kB) |
Abstract
This report deals with robust synchronization of uncertain multi-agent networks. Given an undirected network with for each of the agents identical nominal linear dynamics, we allow uncertainty in the form of multiplicative perturbations of the transfer matrices of the nominal dynamics. The perturbations are stable and have H1-norm that is bounded by some a priori given desired tolerance. We derive state space equations for dynamic observer based protocols and show that robust synchronization is achieved if and only if each controller from a finite set of related controllers robustly stabilizes a given, single multiplicatively perturbed linear system. By using state feedback, a static protocol is expressed in terms of a positive definite solution to a certain algebraic Riccati equation and also involves weighting factors depending on the smallest positive eigenvalue of the graph Laplacian. We show that for each <1 there exists a static protocol that achieves a synchronization radius y.
Item Type: | Thesis (Master's Thesis / Essay) |
---|---|
Degree programme: | Mathematics |
Thesis type: | Master's Thesis / Essay |
Language: | English |
Date Deposited: | 15 Feb 2018 07:55 |
Last Modified: | 15 Feb 2018 07:55 |
URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/11332 |
Actions (login required)
View Item |