Search

This paper is discussed with the problem of passivity based synchronization for a class of complex dynamical networks (CDNs) consisting uncertain inner coupling matrix together with successive time-varying delays via a state feedback delayed controller. Due to occurrence of uncertainties in coupling strengths, the considered CDNs take account of an uncertain inner coupling strength which is more general than the previously existing inner coupling strengths. Specifically, the uncertainties encountering in coupling terms are characterized with the aid of interval matrix approach. Also, by introducing a simple linear transformation, the corresponding error system is formulated. Then, based on the information about control delay term, two cases are considered namely, differentiable and non-differentiable. More precisely, by constructing an appropriate Lyapunov–Krasovskii functional (LKF) containing triple integral terms in respect of Kronecker product, for both the cases, some sufficient criteria are established in terms of linear matrix inequalities (LMIs) to guarantee the robust synchronization of the addressed CDNs based on passivity property. And the established criteria optimistically reduce the L 2 gain level from the disturbance to the output vector. Subsequently, the desired state feedback gain matrix is designed in terms of the solution to a convex optimization problem. Finally, a numerical example is presented to demonstrate the effectiveness of the proposed theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we consider the quantized distributed optimization problem over general directed digital multi-agent networks, where the communication channels have limited data transmission rates. To solve the optimization problem, a distributed quantized subgradient algorithm is presented among agents. Based on an encoder–decoder scheme and a zoom-in technique, we can achieve not only a consensus, but also an optimal solution. In particular, we study two cases of the quantization levels of each connected directed digital communication channel. One is under the case that the quantization levels are time-varying at each time step, and the other is under the case of fixed quantization level. Two rigorous theoretical analyses are performed and the optimal solutions can be obtained asymptotically. Moreover, the upper bound of the quantization levels at each time step and the convergence rate are analytically characterized. The effectiveness of proposed algorithm is demonstrated by two illustrative examples. [ABSTRACT FROM AUTHOR]