Abstract
In this article, the time-varying formation and time-varying formation tracking problems are solved for linear multiagent systems over digraphs without the knowledge of the eigenvalues of the Laplacian matrix associated with the digraph. The solution to these problems relies on an approach that generalizes the directed spanning tree (DST) adaptive method, which was originally limited to consensus problems. Necessary and sufficient conditions for the existence of solutions to the formation problems are derived. Asymptotic convergence of the formation errors is proved via graph theory and Lyapunov analysis.
Original language | English |
---|---|
Pages (from-to) | 690-701 |
Journal | IEEE Transactions on Control of Network Systems |
Volume | 8 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2021 |
Bibliographical note
Accepted Author ManuscriptKeywords
- Adaptive control
- Control systems
- directed graphs
- Eigenvalues and eigenfunctions
- formation control
- Laplace equations
- Multi-agent systems
- multi-agent systems
- Symmetric matrices
- Time-varying systems