In this paper we afford the Laplacian eigenvalue allocation problem for path graphs through the choice of asymmetric weights. After a brief introduction on the meaningfulness of this mathematical setting in several control problems, and more specifically in distributed control of multi-agent systems and robotic networks, the solution is sought both analytically and through an algorithm. Moreover, it is proved that, if the eigenvalues are chosen satisfying the interlacing property, then the solution is positive. Some examples showing the effectiveness of the proposed solution close the paper.

Laplacian eigenvalue allocation by asymmetric weight assignment for path graphs

Gianfranco Parlangeli
2022-01-01

Abstract

In this paper we afford the Laplacian eigenvalue allocation problem for path graphs through the choice of asymmetric weights. After a brief introduction on the meaningfulness of this mathematical setting in several control problems, and more specifically in distributed control of multi-agent systems and robotic networks, the solution is sought both analytically and through an algorithm. Moreover, it is proved that, if the eigenvalues are chosen satisfying the interlacing property, then the solution is positive. Some examples showing the effectiveness of the proposed solution close the paper.
2022
978-1-6654-6746-9
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: https://hdl.handle.net/11587/486482
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 2
social impact