solution for any feasible initial condition, and its continuous and smooth nature lends itself to Lyapunov stability analysis. We study the case where perfect global knowledge of the algebraic connectivity and its sensitivities is available to all nodes. Also we show, as a proof-of-concept, that the scheme can be extended
to so as to be implemented in a completely distributed manner. The theoretical derivations are illustrated via representative numerical examples.
|Title of host publication||Proceedings of the 53rd IEEE Conference on Decision and Control, Los Angeles, USA|
|Publication status||Published - 2014|
20 Mar 2018
Supervisor: Di Bernardo, M. (Supervisor) & Herrmann, G. (Supervisor)
Student thesis: Doctoral Thesis › Doctor of Philosophy (PhD)File