Minimum Laplacian Controllability Problem of Lobsters

The lobster graph is a typical air-air communication network for UAVs with dozens to hundreds of individuals. Due to the existence of multiple eigenvalues, it is difficult to find out their minimum set of leaders. A new concept named Minimum Perfect Critical Set(MPCS) is proposed to solve the minimu...

Full description

Saved in:
Bibliographic Details
Published in2022 41st Chinese Control Conference (CCC) pp. 4706 - 4710
Main Author Dai, Li
Format Conference Proceeding
LanguageEnglish
Published Technical Committee on Control Theory, Chinese Association of Automation 25.07.2022
Subjects
air-air communication network
Communication networks
Controllability
Eigenvalues and eigenfunctions
eigenvector
Laplace equations
Laplacian Controllability
Lobster
minimum set of leaders
Online AccessGet full text

Cover

More Information
Summary:The lobster graph is a typical air-air communication network for UAVs with dozens to hundreds of individuals. Due to the existence of multiple eigenvalues, it is difficult to find out their minimum set of leaders. A new concept named Minimum Perfect Critical Set(MPCS) is proposed to solve the minimum Laplacian controllability problem. Some MPCSs are found for Lobsters. Based on these theories, an example shows that the minimum set of leaders can be found quickly.
ISSN:2161-2927
DOI:10.23919/CCC55666.2022.9902423