Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs

• Autores: Chaoyong Li, Zhihua Qu--, Donglian Qi, Feng Wang
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Nº. 107, 2019, págs. 289-295
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • This paper studied distributed estimation of the bounds on algebraic connectivity for a directed graph (i.e., digraph). As is well known, the main challenge of the underlying problem is how to enable local awareness of an entity otherwise prone to global information, in the presence of communication topology. More specifically, we introduce a novel state-dependent approach to estimate the bounds on algebraic connectivity with mild requirement on topology and communication effort. Compared with existing results, the proposed algorithm does not estimate eigenvalues or eigenvectors directly, rather it exploits their implications on the consensus procedure, and achieves a tradeoff between estimation accuracy and topological/communication requirement, and its convergence can be expected in a finite time. Simulation results verified the performance of the proposed strategy.