A connectivity reduction strategy for multi-agent systems

MaRDI QIDQ3002963zbMATH OpenFDO

Authors Xiaojun Geng, David E. Jeffcoat

Publication date 24 May 2011

zbMATH Keywords

connectivity reduction of multi-agent systemsdirected graphsdistributed algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15)

Recommendations

• An efficient algorithm for determining the connectivity of complex undirected networks
• Distributed constraint optimization on networked multi-agent systems
• Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
• A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
• Almost equitable partitions and controllability of leader-follower multi-agent systems

Cited in

(1)

• A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol

This page was built for publication: A connectivity reduction strategy for multi-agent systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002963)