Klaassens, J.H.C. (2012) Model reduction of multi-agent systems with consensus dynamics. Master's Thesis / Essay, Mathematics.
|
Text
Jorick_Klaassens_2012_TWM.pdf - Published Version Download (604kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
KlaassensAkkoord.pdf - Other Restricted to Registered users only Download (12kB) |
Abstract
I worked with multi-agent systems of the first order. The connections between the agents are described in a Graph. The agents are given the roll of leader or follower in the system. The multi-agent system is subject to a consensus algorithm. It turns out that the graph Laplacian matrix will play an important roll in describing such leader-follower network systems. With this Laplacian we can write the system in the standard, well-known, sate space representation. I tried a several (balancing) reduction techniques, but they failed to preserve the graph structure. Eventually I found two reduction methods which do preserve the graph structure of the system.
| Item Type: | Thesis (Master's Thesis / Essay) |
|---|---|
| Degree programme: | Mathematics |
| Thesis type: | Master's Thesis / Essay |
| Language: | English |
| Date Deposited: | 15 Feb 2018 07:49 |
| Last Modified: | 15 Feb 2018 07:49 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/10347 |
Actions (login required)
 |
View Item |