Graph Embeddings and Laplacian Eigenvalues
SIAM Journal on Matrix Analysis and Applications
Automatica (Journal of IFAC)
Synchronization of multi-agent systems with delayed control input information from neighbors
Automatica (Journal of IFAC)
Discontinuities and hysteresis in quantized average consensus
Automatica (Journal of IFAC)
Consensus seeking over directed networks with limited information communication
Automatica (Journal of IFAC)
Consensus with quantized relative state measurements
Automatica (Journal of IFAC)
Hi-index | 22.15 |
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.