University of Twente Student Theses
Controllability of Laplacian Leader Follower Dynamics : Algorithmic Approach
Vanoušek, Mikuláš (2024) Controllability of Laplacian Leader Follower Dynamics : Algorithmic Approach.
|
PDF
722kB |
| Abstract: | Laplacian leader follower dynamics is a consensus algorithm used for distributed coordination of networked systems, the topology of which is given in the form of a graph. We provide an algorithm to classify graphs into their controllability classes (essentially controllable, conditionally controllable, and completely uncontrollable) which is asymptotically faster than one designed for an arbitrary state space linear system. We use this algorithm to answer questions about resiliency of this dynamic to random changes in topology, and to investigate the probability a topology is essentially controllable. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 31 mathematics, 54 computer science |
| Programme: | Computer Science BSc (56964) |
| Link to this item: | https://purl.utwente.nl/essays/98500 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page