Hajar Atrianfar

Learn More
In this paper, we present sufficient conditions to address a larger class of digraphs, including balanced ones, whose members' Laplacian (L) makes L<sub>1</sub>L + L<sup>T</sup>L<sub>1</sub> to be positive semi-definite, where L<sub>1</sub> is the Laplacian associated with a fully connected equally-edged weighted graphs. This property can be later utilized(More)
This paper deals with the average consensus problem in a multi-agent system with switching interaction topology modeled as a weighted digraph. The convergence analysis is performed in both discrete-time and continuous-time dynamics based on the theory of infinite matrix products. Conditions for system convergence to average consensus are derived in the form(More)
  • 1