Abstract
In this paper, we revisit the problem of consensus disturbance rejection for multiagent systems over a digraph, but from a different perspective, i.e., the perspective of a directed spanning tree (DST). When the minimum nonzero real part of the Laplacian eigenvalues is available, we reproduce the sufficient lower bound for a static homogeneous coupling gain in the literature, by exploring a DST structure of the digraph. The major novelty arises when it is shown that by adaptively tuning the coupling gains along a DST, consensus disturbance rejection can be achieved when the above eigenvalue information is not available. Numerical examples on networks of second-order oscillators and UAVs are included to validate the theoretical results.
Original language | English |
---|---|
Title of host publication | Proceedings of the 41st Chinese Control Conference, CCC 2022 |
Editors | Zhijun Li, Jian Sun |
Publisher | IEEE |
Pages | 4694-4699 |
ISBN (Electronic) | 978-98-8758-153-6 |
DOIs | |
Publication status | Published - 2022 |
Event | 41st Chinese Control Conference, CCC 2022 - Hefei, China Duration: 25 Jul 2022 → 27 Jul 2022 |
Conference
Conference | 41st Chinese Control Conference, CCC 2022 |
---|---|
Country/Territory | China |
City | Hefei |
Period | 25/07/22 → 27/07/22 |
Bibliographical note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-careOtherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Keywords
- Consensus
- Directed spanning tree
- Distributed adaptive control
- Disturbance rejection