Abstract
This paper investigates the consensus of second-order multi-agent systems under switched topologies. Previous studies indicate that a consensus cannot be reached if the topology is fixed and has no spanning tree, but it is possible to reach a consensus for the multi-agent systems under switched topologies even if every topology has no spanning tree. However, in this paper, we show that some second-order multi-agent systems cannot reach a consensus even if the union of the directed interaction graphs has a spanning tree, and even if the union has a spanning tree frequently enough. It is often complex to judge whether the second-order multi-agent systems can reach a consensus or not under switched topologies if every topology has no spanning tree. This paper proposes a sequence-based topology-dependent method to determine whether a consensus can be reached in this circumstance. Our results are supported by examples and counterexamples.
| Original language | English |
|---|---|
| Pages (from-to) | 162209-162217 |
| Number of pages | 9 |
| Journal | IEEE Access |
| Volume | 8 |
| DOIs | |
| Publication status | Published - 2020 |
Bibliographical note
Publisher Copyright:© 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
Open Access - Access Right Statement
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/Keywords
- intelligent control systems
- multiagent systems