On Laplacian spectra of parametric families of closely connected networks with application to cooperative control |
| |
Authors: | Alla Kammerdiner Alexander Veremyev Eduardo Pasiliao |
| |
Affiliation: | 1.New Mexico State University,Las Cruces,USA;2.Air Force Research Laboratory,Munitions Directorate,Eglin AFB,USA |
| |
Abstract: | In this paper, we introduce mathematical models for studying a supernetwork that is comprised of closely connected groups of subnetworks. For several related classes of such supernetworks, we explicitly derive an analytical representation of their Laplacian spectra. This work is motivated by an application of spectral graph theory in cooperative control of multi-agent networked systems. Specifically, we apply our graph-theoretic results to establish bounds on the speed of convergence and the communication time-delay for solving the average-consensus problem by a supernetwork of clusters of integrator agents. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|