Distributed Bipartite Consensus Control for Multi-Agent Systems With Actuator Faults Under Fixed and Markovian Switching Topology

We consider the distributed bipartite consensus problem of general linear multi-agent systems (MASs) with structurally balanced symbolic graphs. The communication topology is fixed topology or Markovian switching topology which follows a continuous time Markov process. Different from the traditional...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2024, Vol.12, p.161742-161751
Main Authors: Li, Hongliang, Gu, Xuan, Gan, Yiming, Liao, Kaili, Zhou, Wuneng
Format: Article
Language:English
Subjects:
actuator faults
Actuators
bipartite consensus
Consensus control
Control stability
Control systems
Cooperative control
distributed control protocol
Estimation error
Fault tolerance
Graph theory
Linear systems
Lyapunov methods
Markov processes
Markovian switching topology
Multi-agent systems
multi-agent systems (MASs)
Multiagent systems
Network topology
Observers
Protocols
State observers
Switches
Topology
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the distributed bipartite consensus problem of general linear multi-agent systems (MASs) with structurally balanced symbolic graphs. The communication topology is fixed topology or Markovian switching topology which follows a continuous time Markov process. Different from the traditional multi-agent fault-tolerant consensus control, a distributed consensus control protocol is designed for multi-agent systems with both competitive and cooperative states. A distributed extended state observer and distributed bipartite consensus based on relative neighbor information are designed with the help of algebraic graph theory and Lyapunov stability theory. The bipartite consensus error and estimation error converge to zero under the action of the bipartite control protocol. In the end, the superiority of the theoretical method is verified by simulation examples.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2024.3483282