By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Atrianfar, H. ; Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran, Iran ; Haeri, M.

In this paper, we present sufficient conditions to address a larger class of digraphs, including balanced ones, whose members' Laplacian (L) makes L1L + 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.

Published in:

Control Applications (CCA), 2012 IEEE International Conference on

Date of Conference:

3-5 Oct. 2012