Koning, J.J. (2016) Clustering-based approximation of multi-agent systems defined on weighted directed graphs. Bachelor's Thesis, Applied Mathematics.
|
Text
Thesis.pdf - Published Version Download (371kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf - Other Restricted to Backend only Download (507kB) |
Abstract
This thesis deals with multi-agent systems where the information flow between the agents is represented by a weighted directed graph. We consider a model reduction technique for multi-agent systems that preserves the network structure of the original model. We extend existing results for undirected graphs to the case of directed graphs. We will see that the reduced-order model again represents a multi-agent system de fined on a weighted directed graph and that consensus is preserved. Furthermore, we will give an explicit expression for the relative approximation error that is involved in the model reduction.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Degree programme: | Applied Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 15 Feb 2018 08:30 |
| Last Modified: | 15 Feb 2018 08:30 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/15536 |
Actions (login required)
 |
View Item |