In this paper we present a novel decentralized algorithm to estimate the eigenvalues of the Laplacian of the network topology of a multi-agent system. The basic idea is to provide a local interaction rule among agents so that their state oscillates only at frequencies corresponding to eigenvalues of the network topology. In this way, the problem of decentralized eigenvalue estimation is mapped into a problem of signal processing, solvable by applying the Fast Fourier Transform (FFT).

Decentralized Laplacian eigenvalues estimation for networked multi-agent systems

FRANCESCHELLI, MAURO;GIUA, ALESSANDRO;SEATZU, CARLA
2009

Abstract

In this paper we present a novel decentralized algorithm to estimate the eigenvalues of the Laplacian of the network topology of a multi-agent system. The basic idea is to provide a local interaction rule among agents so that their state oscillates only at frequencies corresponding to eigenvalues of the network topology. In this way, the problem of decentralized eigenvalue estimation is mapped into a problem of signal processing, solvable by applying the Fast Fourier Transform (FFT).
File in questo prodotto:
File Dimensione Formato  
05400723.pdf

Solo gestori archivio

Descrizione: Articolo principale
Tipologia: versione editoriale
Dimensione 1.16 MB
Formato Adobe PDF
1.16 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11584/73421
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 60
  • ???jsp.display-item.citation.isi??? 46
social impact