Skip to Main content Skip to Navigation
Conference papers

On the control of the algebraic connectivity and clustering of a mobile robotic network

Fabio Morbidi 1, 2
1 NECS - Networked Controlled Systems
GIPSA-DA - Département Automatique, Inria Grenoble - Rhône-Alpes
Abstract : 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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00961563
Contributor : Fabio Morbidi <>
Submitted on : Thursday, March 20, 2014 - 11:25:13 AM
Last modification on : Wednesday, May 13, 2020 - 4:16:01 PM
Document(s) archivé(s) le : Friday, June 20, 2014 - 11:05:40 AM

File

Morbidi_ECC13.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00961563, version 1

Collections

Citation

Fabio Morbidi. On the control of the algebraic connectivity and clustering of a mobile robotic network. 12th biannual European Control Conference (ECC 2013), Jul 2013, Zurich, Switzerland. pp.2801-2806. ⟨hal-00961563⟩

Share

Metrics

Record views

284

Files downloads

324