Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds

DOI10.1016/j.automatica.2014.10.051zbMath1366.94797OpenAlexW2129123449WikidataQ60432033 ScholiaQ60432033MaRDI QIDQ2342459

Dimos V. Dimarogonas, Karl Henrik Johansson, Youcef Mezouar, Guo-Dong Shi, Rosario Aragues, Carlos Sagues

Publication date: 28 April 2015

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2014.10.051

zbMATH Keywords

multi-agent systemsalgebraic connectivitysensor networkscontrol of networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)

Related Items (11)

A dynamical approach to efficient eigenvalue estimation in general multiagent networks ⋮ Distributed control for large-scale systems with adaptive event-triggering ⋮ Fast distributed algebraic connectivity estimation in large scale networks ⋮ On predefined-time consensus protocols for dynamic networks ⋮ Consensus in networks of uncertain Euler-Lagrange agents using adaptive gravity compensation ⋮ Distributed adaptive control of linear multi-agent systems with event-triggered communications ⋮ A suboptimality approach to distributed \(\mathcal{H}_2\) control by dynamic output feedback ⋮ Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs ⋮ Decentralized local-global connectivity maintenance for networked robotic teams ⋮ A class of robust consensus algorithms with predefined‐time convergence under switching topologies ⋮ Robustness and Invariance of Connectivity Maintenance Control for Multiagent Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained distributed algebraic connectivity maximization in robotic networks
• Decentralized estimation and control of graph connectivity for mobile sensor networks
• Event-based broadcasting for multi-agent average consensus
• Distributed estimation of algebraic connectivity of directed networks
• Decentralized estimation of Laplacian eigenvalues in multi-agent systems
• Fast linear iterations for distributed averaging
• Matrix Analysis
• Optimization and Analysis of Distributed Averaging With Short Node Memory
• Consensus and Cooperation in Networked Multi-Agent Systems
• A decentralized algorithm for spectral analysis

This page was built for publication: Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds