Journal article

New cut-balance conditions in networks of clusters

Samuel Martin, Irinel-Constantin Morarescu, Dragan Nesic

AUTOMATICA | PERGAMON-ELSEVIER SCIENCE LTD | Published : 2017

Abstract

Existing results in the literature guarantee that the state of multi-agent systems interacting over networks that satisfy the cut-balance assumption asymptotically converges to a constant vector. Furthermore, when the network is persistently connected the agents reach a common value called consensus. Many real large-scale networks are obtained by sparsely connecting subnetworks of densely connected agents. In this context, our objective is to provide new cut-balance assumptions that are adapted to networks of clusters. They are useful for consensus and agreement in clusters in situations when network topology is such that clusters are given or can be easily identified. In this case our new c..

View full abstract

Grants

Awarded by ANR project COMPACS "Computation Aware Control Systems"


Awarded by CNRS PICS


Awarded by Australian Research Council under the Discovery Project


Funding Acknowledgements

The work of S. Martin and I-C. Morarescu was supported by the ANR project COMPACS "Computation Aware Control Systems", ANA-13-8503-004, the CNRS PEPS "CONAS" and the CNRS PICS No. 6614 "AICONS". The work of D. Nesic was funded by the Australian Research Council under the Discovery Project DP1094326. The material in this paper was not presented at any conference. This paper was recommended for publication in revised form by Associate Editor Carlo Fischione under the direction of Editor Andre L Tits.