Distributed scale-free estimation of algebraic connectivity for multi-agent systems

DOI10.1016/J.SYSCONLE.2026.106547MaRDI QIDQ7355289zbMATH OpenFDO

Authors Wei Tan, Xin Chen

Publication date 22 September 2026

Published in Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.SYSCONLE.2026.106547

Mathematics Subject Classification ID

Multi-agent systems (93A16) Consensus (93D50)

Cites work

• Decentralized estimation and control of graph connectivity for mobile sensor networks
• Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
• Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Nonlinear systems.
• Nonsmooth control barrier function design of continuous constraints for network connectivity maintenance
• On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
• Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms

This page was built for publication: Distributed scale-free estimation of algebraic connectivity for multi-agent systems

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