Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
696564 | Automatica | 2010 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Dimos V. Dimarogonas, Karl H. Johansson,