Signed Average Consensus of Signed Networks Under Directed Communication Topologies

In this document, signed average consensus problems are investigated for signed networks under directed communication topologies based on sampled information. To achieve this goal, a distributed control protocol is proposed by leveraging sampled neighbor information and convergence analyses related to this protocol can be developed using tools from graph theory and matrix theory. The requisite conditions can be derived for the convergent results of signed networks. The findings demonstrate that in the presence of structural balance (respectively, unbalance) in a signed digraph, all agents can achieve sign-average consensus (respectively, state stability) if and only if the sampling period satisfies the relevant conditions. The efficacy of our results is demonstrated through the provision of two simulations.