Cluster assignment in multi-agent systems: sparsity bounds and fault tolerance

DOI10.1002/ASJC.3149MaRDI QIDQ6944303zbMATH OpenFDO

Authors Miel Sharf, Daniel Zelazo

Publication date 12 August 2025

Published in Asian Journal of Control (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/ASJC.3149

zbMATH Keywords

clusteringdiffusive couplingfault tolerancegraph theorymulti-agent networkssparsity

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cites work

• Cluster consensus control of generic linear multi-agent systems under directed topology with acyclic partition
• Consensus Problems on Networks With Antagonistic Interactions
• Controllability and Observability of Grid Graphs via Reduction and Symmetries
• Duality and network theory in passivity-based cooperative control
• Fast linear iterations for distributed averaging
• Geometric Method for Passivation and Cooperative Control of Equilibrium-Independent Passive-Short Systems
• Hierarchical Clustering of Dynamical Networks Using a Saddle-Point Analysis
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 5168353 (Why is no real title available?)
• scientific article; zbMATH DE number 1970438 (Why is no real title available?)
• Introduction to algorithms.

This page was built for publication: Cluster assignment in multi-agent systems: sparsity bounds and fault tolerance

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