Loading...

On properties of a particular class of directed graphs used in stability analysis of flocking algorithms

Atrianfar, H ; Sharif University of Technology | 2012

610 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CCA.2012.6402445
  3. Publisher: 2012
  4. Abstract:
  5. In this paper, we present sufficient conditions to address a larger class of digraphs, including balanced ones, whose members' Laplacian (L) makes L 1L + LTL1 to be positive semi-definite, where L1 is the Laplacian associated with a fully connected equally-edged weighted graphs. This property can be later utilized to introduce an appropriate energy function for stability analysis of flocking algorithms in a larger class of networks with switching directed information flow. Also, some of their properties are investigated in the line of matrix theory and graph theory
  6. Keywords:
  7. Directed information ; Energy functions ; Flocking algorithms ; Laplacians ; Matrix theory ; Stability analysis ; Sufficient conditions ; Weighted graph ; Directed graphs ; Laplace transforms ; Algorithms
  8. Source: Proceedings of the IEEE International Conference on Control Applications, 3 October 2012 through 5 October 2012 ; 2012 , Pages 605-608 ; 1085-1992 (ISSN) ; 9781467345033 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6402445&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6402445