Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method
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 topo...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9184889/ |
id |
doaj-54ca2a24a9774b258d3eb42cc3e363d1 |
---|---|
record_format |
Article |
spelling |
doaj-54ca2a24a9774b258d3eb42cc3e363d12021-03-30T03:23:00ZengIEEEIEEE Access2169-35362020-01-01816220916221710.1109/ACCESS.2020.30212789184889Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent MethodDianhao Zheng0https://orcid.org/0000-0001-6666-0894J. Andrew Zhang1https://orcid.org/0000-0002-6102-3762Hongbin Zhang2https://orcid.org/0000-0001-9841-0961Wei Xing Zheng3https://orcid.org/0000-0002-0572-5938Steven W. Su4https://orcid.org/0000-0002-5720-8852School of Computer Science and Technology, Xi’an University of Posts and Telecommunications, Xi’an, ChinaGlobal Big Data Technologies Center, University of Technology Sydney, Sydney, NSW, AustraliaSchool of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, ChinaSchool of Computer, Data, and Mathematical Sciences, Western Sydney University, Sydney, NSW, AustraliaFaculty of Engineering and Information Technology, University of Technology Sydney, Sydney, NSW, AustraliaThis 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.https://ieeexplore.ieee.org/document/9184889/Consensusmulti-agent systemsspanning treeswitched topologies |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Dianhao Zheng J. Andrew Zhang Hongbin Zhang Wei Xing Zheng Steven W. Su |
spellingShingle |
Dianhao Zheng J. Andrew Zhang Hongbin Zhang Wei Xing Zheng Steven W. Su Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method IEEE Access Consensus multi-agent systems spanning tree switched topologies |
author_facet |
Dianhao Zheng J. Andrew Zhang Hongbin Zhang Wei Xing Zheng Steven W. Su |
author_sort |
Dianhao Zheng |
title |
Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method |
title_short |
Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method |
title_full |
Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method |
title_fullStr |
Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method |
title_full_unstemmed |
Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method |
title_sort |
consensus of second-order multi-agent systems without a spanning tree: a sequence-based topology-dependent method |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
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. |
topic |
Consensus multi-agent systems spanning tree switched topologies |
url |
https://ieeexplore.ieee.org/document/9184889/ |
work_keys_str_mv |
AT dianhaozheng consensusofsecondordermultiagentsystemswithoutaspanningtreeasequencebasedtopologydependentmethod AT jandrewzhang consensusofsecondordermultiagentsystemswithoutaspanningtreeasequencebasedtopologydependentmethod AT hongbinzhang consensusofsecondordermultiagentsystemswithoutaspanningtreeasequencebasedtopologydependentmethod AT weixingzheng consensusofsecondordermultiagentsystemswithoutaspanningtreeasequencebasedtopologydependentmethod AT stevenwsu consensusofsecondordermultiagentsystemswithoutaspanningtreeasequencebasedtopologydependentmethod |
_version_ |
1724183516129787904 |