On the control of the algebraic connectivity and clustering of a mobile robotic network
Fabio Morbidi · 2013
In this paper two related problems are studied: the control of the algebraic connectivity and clustering of a network of single-integrator agents. A steepest-descent algorithm is presented for the first problem, so that a smooth approximation of the algebraic connectivity of the underlying undirected communication graph converges to an assigned value. For the second problem, a new gradient-based control strategy is proposed to automatically partition the mobile robotic network into two predefined groups: our spectral-clustering method leverages a continuous-time power-iteration algorithm on the normalized Laplacian matrix which provides an estimate of its Fiedler vector at each time instant. The results of numerical simulations are provided to illustrate our theoretical findings.