Sign-Consensus of Linear Multi-Agent Systems Over Signed Directed Graphs

This paper investigates sign-consensus problems of general linear multi-agent systems. The interaction between agents is modeled by a signed directed graph, where both cooperation and competition coexist within a group. The graph is allowed to be structurally unbalanced and its adjacency matrix is a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial electronics (1982) 2017-06, Vol.64 (6), p.5075-5083
Main Authors: Jiang, Ye, Zhang, Hongwei, Chen, Jie
Format: Article
Language:English
Subjects:
Bipartite sign-consensus
Computer simulation
Control theory
Graph theory
Graphs
Heuristic algorithms
Internet
linear system
Linear systems
multi-agent system
Multi-agent systems
Multiagent systems
Search algorithms
Search engines
sign-consensus
signed graph
Social network services
Spamming
Topology
Web pages
Websites
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates sign-consensus problems of general linear multi-agent systems. The interaction between agents is modeled by a signed directed graph, where both cooperation and competition coexist within a group. The graph is allowed to be structurally unbalanced and its adjacency matrix is assumed to be eventually positive. Distributed control laws are proposed for several classes of graph topologies. Simulation examples are provided to illustrate the proposed control laws. Signed graph-based multi-agent systems provide models to opinion dynamics and social networks, and may also hold significance in further developing such internet search algorithms as PageRank to counter spamming websites.
ISSN:0278-0046
1557-9948
DOI:10.1109/TIE.2016.2642878