title: Decentralized Estimation and Control for Preserving the Strong Connectivity of Directed Graphs.
abstract: In order to accomplish cooperative tasks, decentralized systems are required to communicate among each other. Thus, maintaining the connectivity of the communication graph is a fundamental issue. Connectivity maintenance has been extensively studied in the last few years, but generally considering undirected communication graphs. In this paper, we introduce a decentralized control and estimation strategy to maintain the strong connectivity property of directed communication graphs. In particular, we introduce a hierarchical estimation procedure that implements power iteration in a decentralized manner, exploiting an algorithm for balancing strongly connected directed graphs. The output of the estimation system is then utilized for guaranteeing preservation of the strong connectivity property. The control strategy is validated by means of analytical proofs and simulation results.
authors.forename: Lorenzo
authors.initials: L
authors.lastname: Sabattini
authors.forename: Cristian
authors.initials: C
authors.lastname: Secchi
authors.forename: Nikhil
authors.initials: N
authors.lastname: Chopra